Skip to main content

A Pipelined Parallel Algorithm for OSIC Decoding

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2007)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foschini, G.J.: Layered space-time architecture for wireless communications in a fading environment when using multiple antennas. Bell Labs Technical Journal 1, 41–59 (1996)

    Article  Google Scholar 

  2. Sellathurai, M., Haykin, S.: Turbo-BLAST for wireless communications: theory and experiments. IEEE Transactions on Signal Processing 50(10), 2538–2546 (2002)

    Article  Google Scholar 

  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 

  7. Sayed, A.H., Kailath, T.: A state-space approach to adaptive RLS filtering. IEEE Signal Processing Magazine 11(3), 18–60 (1994)

    Article  MathSciNet  Google Scholar 

  8. Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore, MD, USA (1996)

    MATH  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Roman Wyrzykowski Jack Dongarra Konrad Karczewski Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martínez-Zaldívar, FJ., Vidal-Maciá, AM., Alonso, P. (2008). A Pipelined Parallel Algorithm for OSIC Decoding. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68111-3_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68105-2

  • Online ISBN: 978-3-540-68111-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics