Browsing by Author "UENG, FB"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Item, ADAPTIVE BLIND EQUALIZATION USING 2ND-ORDER AND HIGHER-ORDER STATISTICS(1995-01-01) ;UENG, FB ;SU, YT ;電信工程研究所 ;友訊交大聯合研發中心Institute of Communications EngineeringThis paper presents two classes of adaptive blind algorithms based on second- and higher order statistics. The first class contains fast recursive algorithms whose cost functions involve second and third- or fourth-order cumulants. These algorithms are stochastic gradient-based but have structures similar to the fast transversal filters (FTF) algorithms. The second class is composed of two stages: the first stage uses a gradient adaptive lattice (GAL) while the second stage employs a higher order-cumulant (HOC) based least mean squares (LMS) filter. The computational loads for these algorithms are all linearly proportional to the number of taps used, Furthermore, the second class, as various numerical examples indicate, yields very fast convergence rates and low steady state mean square errors (MSE) and intersymbol interference (ISI), MSE convergence analyses for the proposed algorithms are also provided and compared with simulation results.Item type:Item, ADAPTIVE BLIND EQUALIZATION USING 2ND-ORDER AND HIGHER-ORDER STATISTICS (VOL 13, PG 132, 1995)(1995-02-01) ;UENG, FB ;SU, YT ;交大名義發表 ;電信工程研究所National Chiao Tung UniversityItem type:Item, ADAPTIVE IIR BLIND ALGORITHMS(1995-06-08) ;UENG, FB ;SU, YT ;交大名義發表 ;電信工程研究所National Chiao Tung UniversityInfinite impulse response (IIR) filtering, when compared with finite impulse response (FIR) filtering, can result in a substantial computational saving and small mean-squared error (MSE). Two IIR blind algorithms based on the second and fourth order cumulants are presented. Simulation results indicate that the proposed IIR blind algorithms not only have faster convergence rates but also lower MSEs than their FIR counterparts.