Blind source separation of instantaneous MIMO systems based on the least-squares Constant Modulus Algorithm

Blind source separation of instantaneous MIMO systems based on the least-squares Constant Modulus Algorithm

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Vision, Image and Signal Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Blind symbol detection for mobile communications systems has been widely studied and can be implemented by using either adaptive or iterative techniques. However, adaptive blind algorithms require data of sufficient length to converge. Therefore, in a rapidly changing environment, they are likely unable to track the changing channels. In such a situation, one possible solution is to use iterative blind algorithms. Iterative blind source separation algorithms based on the least-squares constant modulus algorithm (LSCMA) for instantaneous multiple-input multiple-output (MIMO) systems are proposed. Since the LSCMA cannot guarantee correct separation and hence cannot be used directly for MIMO channels, two extensions are considered: cancellation techniques (successive and parallel), and using an orthogonality constraint to ensure independence among different outputs. In common with many block iterative algorithms, it is found that for small block sizes there can be a BER flare-up effect at high SNR, although this can be removed for a sufficiently large block size. Of the proposed algorithms, simulation results show that the orthogonality-based algorithm has the best performance, and is comparable to iterative least-squares with projection (ILSP) algorithm, but offers cheaper computational complexity.


    1. 1)
    2. 2)
      • Wolniansky, P.W., Foschini, G.J., Golden, G.D., Valenzuela, R.A.: `V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel, invited paper', Proc. ISSSE-98, 29 Sept. 1998, Pisa, Italy.
    3. 3)
      • G.D. Golden , C.J. Foschini , R.A. Valenzuela , P.W. Wolniansky . Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture. Electron. Lett. , 1
    4. 4)
      • Debbah, M., Muquet, B., de Courville, M., Muck, M., Simoens, S., Loubaton, P.: `A MMSE successive interference cancellation scheme for a new adjustable hybrid spread OFDM system', IEEE 51st Vehicular Technology Conference Proceedings, 2000, 2, p. 745–749.
    5. 5)
      • Boubaker, N., Letaief, K.B., Murch, R.D.: `A low complexity multicarrier BLAST architecture for realizing high data rates over dispensive fading channels', IEEE Vehicular Technology Conference, 2001, 2, p. 800–804.
    6. 6)
      • Berder, O, Collin, L., Burel, G., Rostaing, P.: `Digital transmission combining BLAST and OFDM concepts: experimentation on the UHF COST 207 channel', IEEE Global Telecommunications Conference, 2001, 1, p. 141–145.
    7. 7)
    8. 8)
    9. 9)
      • Sfar, S., Murch, R.D., Letaief, K.B.: `Achieving high capacities in CDMA systems using multiuser detection based on BLAST', IEEE International Conference on Communications, 2001, 2, p. 565–569.
    10. 10)
      • Wu, G., Wang, H., Chen, M., Cheng, S., Lilleberg, J.: `Modified parallel interference cancellation for multicode CDMA systems with V-BLAST architecture', IEEE Vehicular Technology Conference, 2002, 2, p. 684–688.
    11. 11)
    12. 12)
      • S. Haykin . (2000) Unsupervised adaptive filtering, volume 1: blind source separation.
    13. 13)
    14. 14)
    15. 15)
    16. 16)
      • T. Li , N.D. Sidiropoulos . Blind digital signal separation using successive interference cancellation iterative least squares. IEEE Trans. Sig. Process. , 11 , 3146 - 3152
    17. 17)
      • Agee, B.G.: `The least-squares CMA: a new technique for rapid correction of constant modulus signals', Proc. ICASSP, 1986, 11, p. 953–956.
    18. 18)
      • Agee, B.G.: `Blind separation and capture of communication signals using a multi-target constant modulus beamformer', Proc. IEEE Military Communications Conference, 1989, 2, p. 340–346.
    19. 19)
      • Leary, J.: `Least-squares multi-user CMArray: a new algorithm for blind adaptive beamforming', Proc. Thirty-First Asilomar Conference on Signals, Systems and Computers, 1998, 1, p. 902–905.
    20. 20)
      • Sansrimahachai, P., Ward, D.B., Constantinides, A.G.: `Multiple-input multiple-output least-squares constant modulus algorithms', Proc. GLOBECOM, 2003, 4, p. 2084–2088.
    21. 21)
      • J.J. Shynk , A.V. Keerthi , A. Mathur . Steady-state analysis of the multistage constant modulus array. IEEE Trans. Sig. Process. , 4 , 948 - 962
    22. 22)
      • A. Mathur , A.V. Keerthi , J.J. Shynk . Cochannel signal recovery using the MUSIC algorithm and the constant modulus array. IEEE Sig. Process. Lett. , 10 , 191 - 194
    23. 23)
    24. 24)
      • C.B. Papadias . Globally convergent blind source separation based on a multiuser kurtosis maximisation criterion. IEEE Trans. Sig. Process. , 12 , 3508 - 3519
    25. 25)
      • G.H. Golub , C.F. Van Loan . (1996) Matrix Computations.
    26. 26)
      • A.J. van der Veen , A. Paulraj . An analytical constant modulus algorithm. IEEE Trans. Sig. Process. , 5 , 1136 - 1155

Related content

This is a required field
Please enter a valid email address