A pipelined parallel algorithm for OSIC decoding

Authors:
Francisco-Jose Martínez-Zaldívar;Antonio-Manuel Vidal-Maciá;Pedro Alonso
Affiliations:
Departamento de Comunicaciones, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 3
Cited 0

An efficient square-root algorithm for BLAST

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02
Turbo-BLAST for wireless communications: theory and experiments

IEEE Transactions on Signal Processing
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.