http://iet.metastore.ingenta.com
1887

Look-ahead sphere decoding: algorithm and VLSI architecture

Look-ahead sphere decoding: algorithm and VLSI architecture

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

Buy article PDF
$19.95
(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
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Multiple-input-multiple-output (MIMO) systems are recognised as a key enabling technology in high-performance wireless communications; however, the implementation of high-throughput MIMO detectors still is a critical task. Among known MIMO detectors, sphere decoder algorithm (SDA) is capable of optimal performance with acceptable processing complexity. The study presents an improved SDA, which enables significant throughput increase at a very limited additional complexity and with no degradation in terms of bit error rate performance. The modified detection method, called LASDA (look-ahead SDA), is based on formal algorithm transformations, namely look-ahead, retiming and pipelining, and requires a modified tree search strategy. The VLSI design of LASDA detector supporting a 4×4 MIMO channel with 16 QAM modulation is detailed in the study for a 130 nm CMOS standard cell technology: synthesis results show that the proposed solution achieves an average throughput of 380 Mbps at a signal-to-noise ratio of 22 dB (Rayleigh fading channel), with an occupied silicon area of 0.18 mm2. Comparisons with a number of previous implementations are also provided.

References

    1. 1)
    2. 2)
      • Multiple-input multiple-output in UTRA (Release 7), 3GPP Std. TR25.876, 2006, http://www.3gpp.org/ftp/specs.
    3. 3)
      • H. Bolcskei , D. Gesbert , C.B. Papadias , A.J. Van Der Veen . (2006) Space-time wireless systems: from array processing to MIMO communications.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Jie, J., Tsui, C.-y., Mow, W.-h.: `A threshold-based algorithm and VLSI architecture of a k-best lattice decoder for MIMO systems', IEEE Int. Symp. on Circuits and Systems 2005 (ISCAS 2005), May 2005, 4, p. 3359–3362.
    8. 8)
      • Guo, Z., Nilsson, P.: `VLSI implementation issues of lattice decoders for MIMO systems', Proc. 2004 Int. Symp. on Circuits and Systems 2004 (ISCAS ’04), May 2004, 4, p. 477–480.
    9. 9)
      • Hess, C., Wenk, M., Burg, A.: `Reduced complexity MIMO detector with close-to ML error rate performance', Proc. ACM Great Lakes Symp. on VLSI, GLSVLSI’07, March 2007, Stresa-Lago Maggiore, Italy.
    10. 10)
    11. 11)
      • Barbero, L., Thompson, J.: `Performance analysis of a fixed-complexity sphere decoder in high-dimensional MIMO systems', Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, ICASSP 2006, May 2006.
    12. 12)
      • Siti, M., Fitz, M.: `On layer ordering techniques for near-optimal MIMO detectors', Proc. IEEE Wireless Communications and Networking Conf., WCNC 2007, March 2007, p. 1199–1204.
    13. 13)
      • Lee, J., Soon Kim, H., Park, S.-C.: `Parallel architecture for sphere decoder with runtime constraint', Proc. IEEE Consumer Communications and Networking Conf., CCNC 2008, January 2008, p. 181–184.
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
      • Studer, C., Wenk, M., Burg, A., Bolcskei, H.: `Soft-output MIMO detection algorithms: performance and implemention aspects', Proc. 40h Asilomar Conf. on Signals, Systems, and Computers, October 2006, p. 2071–2076.
    19. 19)
    20. 20)
      • Marsch, P., Zimmermann, E., Fettweis, G.: `Smart candidate adding: a new low-complexity approach towards near-capacity MIMO detection', Proc. 13th European Signal Processing Conf. (EUSIPCO), September 2005.
    21. 21)
    22. 22)
      • Cupaiuolo, T., Siti, M., Tomasoni, A.: `Low-complexity high throughput VLSI architecture of soft-output ML MIMO detector', Design, Automation and Test in Europe Conf. and Exhibition (DATE), March 2010, p. 1396–1401.
    23. 23)
      • Sun, Y., Cavallaro, J.R.: `High throughput VLSI architecture for soft-output MIMO detection based on a greedy graph algorithm', Proc. ACM Great Lakes Symp. VLSI, GLSVLSI’09, March 2009, New York, USA, p. 445–450.
    24. 24)
      • Mennenga, B., Fettweis, G.: `Search sequence determination for tree search based detection algorithms', IEEE Sarnoff Symp., SARNOFF ’09, March 2009, p. 1–6.
    25. 25)
    26. 26)
    27. 27)
      • D. Wubben , R. Bohnke , V. Kuhn , K.-D. Kammeyer . (2003) Mmse extension of v-blast based on sorted qr decomposition.
    28. 28)
      • Lee, S., Lee, J., Seo, S., Park, S C.: `VLSI implementation of area-efficient list sphere decoder', Int. Symp. Intelligent Signal Processing and Communications (ISPACS 2006), December 2006, p. 610–613.
    29. 29)
      • Myllyla, M., Juntti, M., Cavallaro, J.: `Implementation aspects of list sphere detector algorithms', IEEE Global Telecommunications Conf., GLOBECOM ’07, November 2007, p. 3915–3920.
    30. 30)
      • K. Parhi . (1959) VLSI digital signal processing systems.
    31. 31)
      • Burg, A., Wenk, M., Fichtner, W.: `VLSI implementation of pipelined sphere decoding with early termination', Proc. European Signal Proc. Conf. (EUSIPCO 2006), September 2006, Florence, Italy.
    32. 32)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0523
Loading

Related content

content/journals/10.1049/iet-com.2010.0523
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address