A Pipelined Parallel Algorithm for OSIC Decoding
This paper describes and compares two algorithms for the Ordered Successive Interference Cancellation (OSIC) decoding procedure proposed in V-BLAST wireless MIMO systems. They are based on algorithms that solve the Recursive Least Squares (RLS) problem, and are derived from the square root version of the Kalman Filter and the square root version of the Information Filter, respectively. For OSIC decoding, the latter is a novel and faster solution than the former because a matrix multiplication and some rotation applications are avoided. The algorithm has been formulated as a block algorithm, observing an optimum block size that minimizes execution time. It has been parallelized as a pipeline, and so is very efficient.
KeywordsMultiple Input Multiple Output Channel Matrix Recursive Little Square Multiple Input Multiple Output Minimize Execution Time
Unable to display preview. Download preview PDF.
- 3.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. In: Proc. IEEE ISSSE 1998, pp. 295–300 (1998)Google Scholar
- 4.Viterbo, E., Boutros, J.: A universal lattice decoder for fading channels. IEEE Trans. Inf. Theory 45(5) ( July 1999)Google Scholar
- 5.Hassibi, B.: An efficient square-root algorithm for BLAST. In: IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 2, pp. II737– II740 (2000)Google Scholar
- 6.Choi, Y.-S., Voltz, P.J., Cassara, F.A.: On channel estimation and detection for multicarrier signals in fast and selective Rayleigh fading channels. IEEE Transactions on Communications 49(8) (August 2001)Google Scholar
- 9.Kumar, V., Gram, A., Gupta, A., Karypis, G.: An Introduction to Parallel Computing: Design and Analysis of Algorithms, ch.4, 2nd edn. Addison-Wesley, Harlow, England (2003)Google Scholar