Amit Kumar Kohli

Numeric Variable Forgetting Factor RLS Algorithm for Second-Order Volterra Filtering

Nonlinear adaptive filtering techniques for system identification (based on the Volterra model) are widely used for the identification of nonlinearities in many applications. In this correspondence, the improved tracking capability of a numeric variable forgetting factor recursive least squares (NVFF-RLS) algorithm is presented for first-order and second-order time-varying Volterra systems under a nonstationary environment. The nonlinear system tracking problem is converted into a state estimation problem of the time-variant system. The time-varying Volterra kernels are governed by the first-order Gauss–Markov stochastic difference equation, upon which the state-space representation of this system is built. In comparison to the conventional fixed forgetting factor recursive least squares algorithm, the NVFF-RLS algorithm provides better channel estimation as well as channel tracking performance in terms of the minimum mean square error (MMSE) for first-order and second-order Volterra systems. The NVFF-RLS algorithm is adapted to the time-varying signals by using the updating prediction error criterion, which accounts for the nonstationarity of the signal. The demonstrated simulation results manifest that the proposed method has good adaptability in the time-varying environment, and it also reduces the computational complexity.

Fading model for antenna array receiver for a ring-type cluster of scatterers

This correspondence presents an alternate method for simulating the time-varying flat fading wireless channels for the antenna array receivers, in which the discrete ring of scatterers is incorporated around the mobile transmitter to model the spreading of azimuth. The ring-type cluster of scatterers continuously changes due to the movement of the mobile unit. Under this time-varying environment, each scatterer, at successive stages of the ring, is correlated with the scatterers at preceding stages of the ring using the second-order Markov modelling. The correlation of fading waveforms generated with the proposed paradigm is compared with the expected analytical correlation, which clearly depicts that the simulation results are consistent with the findings based on Jakes’ model.

Variable Forgetting Factor LS Algorithm for Polynomial Channel Model

Variable forgetting factor (VFF) least squares (LS) algorithm for polynomial channel paradigm is presented for improved tracking performance under nonstationary environment. The main focus is on updating VFF when each time-varying fading channel is considered to be a first-order Markov process. In addition to efficient tracking under frequency-selective fading channels, the incorporation of proposed numeric variable forgetting factor (NVFF) in LS algorithm reduces the computational complexity.

Adaptive Multiuser Channel Estimation using Reduced Kalman/LMS Algorithm

This paper presents an adaptive multiuser channel estimator using the reduced-Kalman least-mean-square (RK-LMS) algorithm. The frequency-selective fading channel is modeled as a tapped-delay-line filter with smoothly time-varying Rayleigh distributed tap coefficients. The multiuser channel estimator based on minimum-mean-square-error (MMSE) criterion is used to predict the filter coefficients. We also present its convergence characteristics and tracking performance using the RK-LMS algorithm. Unlike the previously available Kalman filtering algorithm based approach (Chen, Chen IEEE Trans Signal Process 49(7): 1523–1532, 2001) the incorporation of RK-LMS algorithm reduces the computational complexity of multiuser channel estimator used in the code division multiple access wireless systems. The computer simulation results are presented to demonstrate the substantial improvement in its tracking performance under the smoothly time-varying environment.

Adaptive Filtering Techniques using Cyclic Prefix in OFDM Systems for Multipath Fading Channel Prediction

This paper presents adaptive channel prediction techniques for wireless orthogonal frequency division multiplexing (OFDM) systems using cyclic prefix (CP). The CP not only combats intersymbol interference, but also precludes requirement of additional training symbols. The proposed adaptive algorithms exploit the channel state information contained in CP of received OFDM symbol, under the time-invariant and time-variant wireless multipath Rayleigh fading channels. For channel prediction, the convergence and tracking characteristics of conventional recursive least squares (RLS) algorithm, numeric variable forgetting factor RLS (NVFF-RLS) algorithm, Kalman filtering (KF) algorithm and reduced Kalman least mean squares (RK-LMS) algorithm are compared. The simulation results are presented to demonstrate that KF algorithm is the best available technique as compared to RK-LMS, RLS and NVFF-RLS algorithms by providing low mean square channel prediction error. But RK-LMS and NVFF-RLS algorithms exhibit lower computational complexity than KF algorithm. Under typical conditions, the tracking performance of RK-LMS is comparable to RLS algorithm. However, RK-LMS algorithm fails to perform well in convergence mode. For time-variant multipath fading channel prediction, the presented NVFF-RLS algorithm supersedes RLS algorithm in the channel tracking mode under moderately high fade rate conditions. However, under appropriate parameter setting in

Dual-Band Dielectric Resonator Antenna for C and X Band Application

2\times 1

Review article: Achieving maximum reliability in fault tolerant network design for variable networks

2×1 space–time block-coded OFDM system, NVFF-RLS algorithm bestows enhanced channel tracking performance than RLS algorithm under static as well as dynamic environment, which leads to significant reduction in symbol error rate.

A computational study on the design of overall reliability measures of optimized ANN for computer networks with fixed and varying link reliabilities

This correspondence presents the adaptive polynomial filtering using the generalized variable step-size least mean