In this paper we introduce an innovative version of the recently proposed Layered ORthogonal lattice Detector (LORD). LORD is an attractive MIMO detection algorithm, which aims to approach the optimal Maximum-Likelihood (ML) detection performance with a reasonable complexity, quadratic in the number of transmitting antennas rather than exponential. LORD is also well suited to a hardware (e.g. ASIC or FPGA) implementation because of its regularity, deterministic latency and parallelism. Nevertheless, its complexity is still high in case of high cardinality constellations, such as the 64-QAM foreseen by the 802.11n standard. We show that, when only global latency constraints exist, e.g. a xed time to detect the whole OFDM symbol, the LORD complexity can be remarkably reduced (up to 60%), still approaching the ML performance.
A Hardware Oriented, Low Complexity LORD MIMO Detector
TOMASONI, ALESSANDRO;FERRARI, MARCO PIETRO;BELLINI, SANDRO;
2010-01-01
Abstract
In this paper we introduce an innovative version of the recently proposed Layered ORthogonal lattice Detector (LORD). LORD is an attractive MIMO detection algorithm, which aims to approach the optimal Maximum-Likelihood (ML) detection performance with a reasonable complexity, quadratic in the number of transmitting antennas rather than exponential. LORD is also well suited to a hardware (e.g. ASIC or FPGA) implementation because of its regularity, deterministic latency and parallelism. Nevertheless, its complexity is still high in case of high cardinality constellations, such as the 64-QAM foreseen by the 802.11n standard. We show that, when only global latency constraints exist, e.g. a xed time to detect the whole OFDM symbol, the LORD complexity can be remarkably reduced (up to 60%), still approaching the ML performance.File | Dimensione | Formato | |
---|---|---|---|
Hardware Oriented MIMO Detector.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
273.34 kB
Formato
Adobe PDF
|
273.34 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.