The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This tutorial session paper provides a brief survey of adaptive signal processing methods and applications. We give the update equations of FIR and IIR adaptive filters. We provide brief descriptions of LMS, RLS, and block time and frequency domain algorithms. The tutorial begins with an introduction to adaptive methods and continues with a discussion on least squares and gradient techniques. The...
The challenges for today's wireless communication technology are increased data rates, channel capacity and spectrum efficiency with reduced interference. The adaptive antenna array is capable of adapting to the varying signal environments automatically and forms beams in the directions of the desired signals by steering nulls in the directions of interfering signals. Therefore smart antenna is the...
The challenge of a modern day wireless system is to provide reliable and extensive service, which provide the desired capacity for communication. It is necessary to increase the capacity and channel bandwidth at the same time minimize the channel interference. Smart antenna is one of the best techniques to improve the capacity of the wireless communication system by improving the gain of main lobe...
The performance of the Least Mean Square (LMS) and Recursive Least Square (RLS) adaptive array are compared via Monte Carlo simulation. The comparisons are in terms of the convergence behavior, the Mean Square Error (MSE) of weight tracking, and the Bit Error Rate (BER). The communication systems is the downlink from High Altitude Platforms (HAPs) to antenna arrays onboard high speed train on Ka-band...
Smart antenna is the most efficient leading innovation for maximum capacity and improved quality and coverage. Using beam forming algorithms the weight of antenna arrays can be adjusted to form certain amount of adaptive beam to track corresponding users automatically and at the same time to minimize interference arising from other users by introducing nulls in their directions. This paper focuses...
The 3G cellular networks are being designed to provide high bit rate services, multimedia traffic, in addition to voice calls. 3G utilizes W-CDMA as a radio access technology which provides highly efficient spectrum utilization & variable user data rates. The dedicated pilot is presented in the structure of the up-link WCDMA frame of IMT-2000 physical channels & this dedicated pilot supports...
This paper presents the fixed and floating-point implementations for field-programmable gate arrays (FPGAs) of third-order hand tremor predictors using recursive-least square (RLS) and a proposed Kalman adaptation algorithm. The proposed algorithm outperforms RLS in convergence speed and mean square error (MSE). It also shows better numerical convergence than the RLS as the number of bits in fixed-point...
The quality of mobile communications have been severely affected by interference among users in TD-SCDMA, in allusion to this problem, the smart antenna adaptive beam-forming algorithm are researched deeply in the thesis. According to the technical features that smart antenna can adaptive track the user signals realize the design and simulation of smart antenna in interference suppression, and compare...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.