By Topic

Analysis of Parallel Sorting Algorithms in K-best Sphere-Decoder Architectures for MIMO Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pedro Cervantes-Lozano ; ITESM Campus Estado de Mexico, Atizapan de Zaragoza, Mexico ; Luis F. Gonz´lez-Perez ; Andres D. Garcia-Garcia

This article presents a complexity and delay analysis of Parallel Sorting Algorithms (PSA) in K-best Sphere-Decoder (K-best SD) receivers in slow-flat Rayleigh fading channels for MIMO (Multiple-Input Multiple-Output) systems. The K-best SD algorithm is a strategic Near-Optimal Spatial-Multiplexing MIMO (SM-MIMO) demodulation solution (due to its trade-off between Bit-Error-Rate performance and algorithmic complexity) that requires sorting procedures for symbol-decoding purposes. Unfortunately, sorting represents a critical data throughput bottleneck for K-best SD architectures. PSA alleviate this situation by providing suitable implementations of sorting algorithms easily adapted to K-best SD architectures. Several versions of the Bubble-Sort (BS) and the Batcher-Sort (BtchS) algorithms are considered for this analysis.

Published in:

2011 International Conference on Reconfigurable Computing and FPGAs

Date of Conference:

Nov. 30 2011-Dec. 2 2011