Abstract
Blind separation of instantaneous linear mixtures of digital signals is a basic problem in communications. When little or nothing can be assumed about the mixing matrix, signal separation may be achieved by exploiting structural properties of the transmitted signals, e.g., finite alphabet or coding constraints. We propose a monotonically convergent and computationally efficient iterative least squares (ILS) blind separation algorithm based on an optimal scaling lemma. The signal estimation step of the proposed algorithm is reminiscent of successive interference cancellation (SIC) ideas. For well-conditioned data and moderate SNR, the proposed SIC-ILS algorithm provides a better performance/complexity tradeoff than competing ILS algorithms. Coupled with blind algebraic digital signal separation methods, SIC-ILS offers a computationally inexpensive true least squares refinement option. We also point out that a widely used ILS finite alphabet blind separation algorithm can exhibit limit cycle behavior.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 3146-3152 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 48 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2000 |
| Externally published | Yes |
Bibliographical note
Funding Information:Manuscript received June 23, 1999; revised July 31, 2000. This work was supported by NSF/CAREER Grant CCR-9733540. A preliminary version of part of the material contained in this paper was presented at the IEEE International Conference on Acoustics, Speech, and Signal Processing, Phoenix, AZ, March 15–19, 1999. The associate editor coordinating the review of this paper and approving it for publication was Dr. Vikram Krishnamurthy.