MODULUS OF CONSTANT CROSS SECTION

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An analytical constant modulus algorithm

Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of co-channel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval of all individual CM signals that are present in the channel. In this paper, we show that the underlyin...

متن کامل

Fixed window constant modulus algorithms

W e propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined i f the peak position of the initialized global channel/equalizer response is known. These fixed window CM algorithms are data eficient, computationa...

متن کامل

Maximum likelihood separation of constant modulus signals

In this paper we derive a Newton scoring algorithm for the maximum likelihood separation and directionof-arrival estimation of constant modulus (CM) signals, using a sensors array. We present a rapidly converging scheme for the joint estimation of the signals and their directions, based on their CM property. We discuss initialization and show that the complexity is moderate. 2

متن کامل

The MSE performance of constant modulus receivers

The constant modulus algorithm (CMA) is an e ective technique for blind receiver design in practice. Treating CMA as a linear estimation problem, e ects of noise and channel conditions are investigated. For the class of channels with arbitary nite impulse responses, an analytical description of locations of constant modulus receivers and an upper bound of their mean squared errors (MSE) are der...

متن کامل

Convergence analysis of the constant modulus algorithm

We study the global convergence of the stochastic gradient constant modulus algorithm (CMA) in the absence of channel noise as well as in the presence of channel noise. The case of fractionally spaced equalizer and/or multiple antenna at the receiver is considered. For the noiseless case, we show that with proper initialization, and with small step size, the algorithm converges to a zero-forcin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science

سال: 1901

ISSN: 0036-8075,1095-9203

DOI: 10.1126/science.13.337.949