The Bootstrapped Algorithm: A Fast Algorithm for Blind Signal Separation
Final rept. Apr 1992-Jun 1993
NEW JERSEY INST OF TECH NEWARK
Pagination or Media Count:
The bootstrapped algorithm was introduced in the previous report. RL- TR-93-24, dated April 1993. Their different structures were proposed and shown to be suitable for blind signal separation and interference cancellation. It was demonstrated that the speed of convergence of these algorithms is much faster than other algorithms. Unlike other algorithms. the speed of convergence does not depend on the signals power ratios and. hence, does not depend on the eigenvalue spread of the input correlation matrix. Further studies of these algorithms are reported in this section, which includes questions related to bandwidth, complexity, and dynamic studies for real-time control. Also reported are studies of spatial separation and direction-of-arrival estimation of wideband signals as well as application of the algorithm for broadband interference cancellation. Some preliminary results on applications to the blind decision feedback equalizer and separation of CDMA signals are also included. Algorithm, Signal processing, Interference cancellation.
- Electrical and Electronic Equipment