检索结果-内蒙古大学图书馆

2010 2nd International Conference on Multimedia and Computational Intelligence (ICMCI 2010)

作者： Li Fan School of Mechanical an Electrical Engineering NanChang Institute of Technology Nanchang 330099, China

The main disadvantage of constant modulus algorithm (CMA) is that the output error can not converge to zero for the transmitted signals with non-constant modulus. By exploiting the character of the 16-QAM constellation, a new cost function is defined which can transform the non-constant modulus signals to constant modulus signals. And then the new CMA based on such cost function is proposed. Compared with traditional CMA the proposed algorithm has lower steady state error. The efficiency of the method is proved by computer simulations in underwater acoustic channels.

关键词： blind equalization constant modulus algorithm cost function

来源：评论

学校读者我要写书评

暂无评论

A New constant modulus algorithm Based on Dual-step Size

A New Constant Modulus Algorithm Based on Dual-step Size

引用

第一届国际测量仪器与测试自动化学术会议

作者： Rao Wei Guo Yecai (Department of Electrical Engineering, Anhui University of Science and Technology, Huainan 232001 China)

In order to overcome the slow convergence rate and large residual error of constant modulus algorithm (CMA). a new constant modulus algorithm based on dual-step size is proposed. This algorithm operates with switching the step size from one to another and the condition of switching is based on the decision of the equalizer's output. Comparing with the CMA. the advantages of the new algorithm are faster convergence rate and lower residual error. The efficiency of the method is proved by computer simulations.

关键词： constant modulus algorithm dual-step size blind equalization.

来源：评论

学校读者我要写书评

暂无评论

constant modulus algorithms using hyperbolic Givens rotations

引用

SIGNAL PROCESSING 2014年 104卷 412-423页

作者： Ikhlef, A. Iferroujene, R. Boudjellal, A. Abed-Meraim, K. Belouchrani, A. Univ British Columbia ECE Dept Vancouver BC V6T 1Z4 Canada Ecole Natl Polytech EE Dept Algiers 16200 Algeria Polytech Orleans PRISME Lab F-45067 Orleans France

We propose two new algorithms to minimize the constant modulus (CM) criterion in the context of blind source separation. The first algorithm, referred to as Givens CMA (G-CMA), uses unitary Givens rotations and proceeds in two stages: prewhitening step, which reduces the channel matrix to a unitary one followed by a separation step where the resulting unitary matrix is computed as a product of Givens rotations. However, for small sample sizes, the prewhitening does not make the channel matrix close enough to unitary and hence applying Givens rotations alone does not provide satisfactory performance. To remediate to this problem, we propose to use Hyperbolic rotations in conjunction with Givens rotations. This second algorithm, referred to as Hyperbolic G-CMA (HG-CMA), is shown to outperform the G-CMA as well as the Analytical CMA (ACMA). The last part of this paper is dedicated to an efficient adaptive implementation of the HG-CMA and to performance assessment through numerical experiments. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Blind source separation constant modulus algorithm Adaptive CMA Sliding window Hyperbolic rotations Givens rotations

来源：评论

学校读者我要写书评

暂无评论

Baud-spaced constant modulus blind equalization via hybrid genetic algorithm and generalized pattern search optimization

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2008年第2期62卷 122-131页

作者： Zaouche, A. Dayoub, I. Rouvaen, J. M. Univ Valenciennes Opto Acousto Elect Dept IEMN UMR CNRS 8520 F-59313 Le Mont Houy 9 France

The present paper deals with the formulation of the baud-spaced constant modulus blind equalization in the presence of Gaussian noise as an unconstrained optimization problem via the use of genetic algorithm and generalized pattern search (GPS) algorithm. Simulation results show that the proposed approach is more robust to the adopted initialization strategy and much more likely to outperform the classical constant modulus algorithm in terms of minimum-squared error, intersymbol interference and error vector magnitude quantities. (C) 2007 Elsevier GmbH. All rights reserved.

关键词： blind channel equalization pattern search genetic algorithms constant modulus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Adaptive constant modulus Blind Equalization algorithm and Its Stochastic Stability Analysis

引用

IEEE SIGNAL PROCESSING LETTERS 2010年第1期17卷 55-58页

作者： Abrar, Shafayat Nandi, Asoke K. Univ Liverpool Dept Elect Engn & Elect Liverpool L69 3GJ Merseyside England

A constant modulus algorithm is presented for blind equalization of complex-valued communication channels. The proposed algorithm is obtained by solving a novel deterministic optimization criterion which comprises the minimization of a priori as well as a posteriori dispersion error, leading to an update equation having a particular zero-memory continuous Bussgang-type non-linearity. We also derive a stochastic bound for the range of step-sizes for a generic Bussgang-type constant modulus algorithm. The theoretical result is validated through computer simulations.

关键词： Adaptive equalizer blind equalization constant modulus algorithm stochastic stability

来源：评论

学校读者我要写书评

暂无评论

A class of widely linear quaternion blind equalisation algorithms

引用

SIGNAL PROCESSING 2025年 230卷

作者： Zhang, Min Xiang, Min Zheng, Zhi Talebi, Sayed Pouria Mandic, Danilo P. Beihang Univ Sch Instrumentat & Optoelect Engn Beijing Peoples R China Beihang Univ Hangzhou Innovat Inst Hangzhou Peoples R China Natl Inst Extremely Weak Magnet Field Infrastruct Hangzhou Peoples R China Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu Peoples R China Univ Roehampton Comp Sci Dept London England Imperial Coll London Dept Elect & Elect Engn London England

Quaternion adaptive filters have been applied extensively to model three- and four-dimensional phenomena in signal processing, but most of them require a known reference signal. In this paper, a class of widely linear quaternion-valued Godard (WL-QGodard) algorithms is derived, which include the widely linear quaternionvalued constant modulus algorithm (WL-QCMA) as a special case. The derived filter allows for signal recovery operations in the absence of reference signals to be performed directly in the quaternion domain, eliminating the need for transformation to real-valued vector algebras and preserving the advantages of the quaternion division algebra. Compared to state-of-the-art quaternion blind equalisation algorithms, the proposed algorithm models the signal transmission channel using the widely linear quaternion framework, which has more extensive applicability and can better represent real-world scenarios. Furthermore, aided by GHR calculus, for the first time, we present a performance analysis framework for the QGodard algorithm and WL-QGodard algorithms, which depicts the dynamic and their static convergence behaviours, overcoming the challenges posed by the noncommutative quaternion algebra and non-isomorphism between the quaternion equalisers and real-valued equalisers. Finally, simulation results over physically meaningful wireless communication signals indicate the effectiveness and superiority of the proposed WL-QCMA, and the validity of the theoretical performance analysis.

关键词： Quaternion blind equalisation Godard algorithm constant modulus algorithm Static convergence behaviour Dynamic convergence behaviour Widely linear model

来源：评论

学校读者我要写书评

暂无评论

Conjugate gradient and steepest descent constant modulus algorithms applied to a blind adaptive array

引用

SIGNAL PROCESSING 2010年第10期90卷 2835-2841页

作者： Diene, Oumar Bhaya, Amit Fed Univ ABC CECS Ctr Engn Modeling & Appl Social Sci BR-09090400 Santo Andre SP Brazil Univ Fed Rio de Janeiro NACAD COPPE Dept Elect Engn BR-21945970 Rio De Janeiro Brazil

Multi-user mobile communication systems use adaptive and linearly constrained adaptive filters for blind and non-blind adaptive interference cancelation, multipath reduction, equalization, and adaptive beamforming. A conjugate gradient and a steepest descent method for real-time processing are proposed and applied to blind adaptive array processor. Simulations show that the proposed algorithms have performance comparable to those of algorithms proposed earlier. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Blind adaptive filters constant modulus algorithm Blind adaptive arrays Lyapunov function Conjugate gradient method

来源：评论

学校读者我要写书评

暂无评论

Sufficient conditions for the local convergence of constant modulus algorithms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2000年第10期48卷 2785-2796页

作者： Schniter, P Johnson, CR Ohio State Univ Dept Elect Engn Columbus OH 43210 USA Cornell Univ Dept Elect Engn Ithaca NY 14853 USA

The constant modulus (CM) criterion has become popular in the design of blind linear estimators of sub-Gaussian i.i.d. processes transmitted through unknown linear channels in the presence of unknown additive interference, The existence of multiple CM minima, however, makes it difficult for CM-minimizing schemes to generate estimates of the desired source (as opposed to an interferer) in multiuser environments, In this paper, we present three separate sufficient conditions under which gradient descent (GD) minimization of CIM cost will locally converge to an estimator of the desired source at a particular delay. The sufficient conditions are expressed in terms of statistical properties of the initial estimates, specifically, CM cost, kurtosis, and signal-to-interference-plus-noise ratio (SINR). Implications on CM-GD initialization methods are also discussed.

关键词： blind beamforming blind deconvolution blind equalization blind multiuser detection constant modulus algorithm Godard algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Singularity Avoidance Capability of constant modulus algorithms in Coherent Optical Fibre Communication Systems

Analysis of the Singularity Avoidance Capability of Constant...

引用

2023 Asia Communications and Photonics Conference/2023 International Photonics and Optoelectronics Meetings, ACP/POEM 2023

作者： Nwakamma, Peter Akachi Froc, Gwillerm Jaouen, Yves Ware, Cedric Institut Polytechnique de Paris LTCI Télécom Paris Palaiseau France Mistubishi-Electric R&D Centre Europe Communication Division Rennes France

constant modulus algorithm (CMA) in dual-polarization optical coherent transmission is revisited for optical access. We introduce a refined CMA, exhibit singularity-free operation up to 5 ps/km0.5 polarization mode di... 详细信息

ISBN: (纸本)9798350312614

关键词： coherent detection constant modulus algorithm optical access polarization division multi-plexing polarization mode dispersion

来源：评论

学校读者我要写书评

暂无评论

Robust constant modulus algorithms for Channel Equalization

Robust Constant Modulus Algorithms for Channel Equalization

引用

Conference on Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments

作者： Gajo, Z. Linczuk, M. Warsaw Univ Technol Inst Elect Syst PL-00665 Warsaw Poland

ISBN: (纸本)9781628413694

In this paper a robust version of conventional constant modulus algorithm is presented. This robust algorithm is used for multipath channel equalization in the presence of impulsive heavy-tailed noise described by alpha-stable distribution. The advantage of presented robust algorithm over conventional algorithm dedicated to Gaussian noise is confirmed experimentally.

关键词： constant modulus algorithm robust channel equalization impulsive noise alpha-stable distribution

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：