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

Autor:	Andres D. Garcia-Garcia, Pedro Cervantes-Lozano, Luis F. Gonz´lez-Perez
Rok vydání:	2011
Předmět:	Sorting algorithm Computer science MIMO Sorting Demodulation Algorithm design Throughput (business) Algorithm Bottleneck Computer Science::Information Theory Rayleigh fading
Zdroj:	ReConFig
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a82eb2d49d3a2497bf47df4aa84ecf2d https://doi.org/10.1109/reconfig.2011.13 Zobrazit plný text záznamu