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

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...

Full description

Saved in:
Bibliographic Details
Published in2011 International Conference on Reconfigurable Computing and FPGAs pp. 321 - 326
Main Authors Cervantes-Lozano, P., Gonzalez-Perez, L. F., Garcia-Garcia, A. D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2011
Subjects
Algorithm design and analysis
Complexity theory
Computer architecture
Delay
K-best Sphere-Decoder
Merging
MIMO
MIMO systems
Parallel Sorting Algorithms
Sorting
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9781457717345
1457717344
ISSN:2325-6532
2640-0472
DOI:10.1109/ReConFig.2011.13