Frequency-domain block signal detection with QRM-MLD for training sequence-aided single-carrier transmission

Authors:
Tetsuya Yamamoto;Kazuki Takeda;Fumiyuki Adachi
Affiliations:
Department of Electrical and Communication Engineering, Graduate School of Engineering, Tohoku University, Sendai, Japan;Department of Electrical and Communication Engineering, Graduate School of Engineering, Tohoku University, Sendai, Japan;Department of Electrical and Communication Engineering, Graduate School of Engineering, Tohoku University, Sendai, Japan
Venue:
EURASIP Journal on Advances in Signal Processing - Special issue on advances in single carrier block modulation with frequency domain processing
Year:
2011

Citing 5
Cited 0

Low-complexity adaptive tree search algorithm for MIMO detection

IEEE Transactions on Wireless Communications
The finite-length multi-input multi-output MMSE-DFE

IEEE Transactions on Signal Processing
Channel and noise variance estimation and tracking algorithms for unique-word based single-carrier systems

IEEE Transactions on Wireless Communications
Frequency domain equalization for single-carrier broadband wireless systems

IEEE Communications Magazine
Adaptive control of surviving symbol replica candidates in QRM-MLD for OFDM MIMO multiplexing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A frequency-domain block signal detection (FDBD) using QR decomposition with M-algorithm maximum likelihood detection (QRM-MLD) can significantly improve the bit error rate (BER) performance of the cyclic prefix inserted single-carrier (CP-SC) block transmission in a frequency-selective fading channel. However, the use of a fairly large number of the surviving paths is required in theM-algorithm, leading to high computational complexity. In this paper, we propose the use of the training sequenceaided SC (TA-SC) block transmission instead of CP-SC block transmission. We show that TA-SC using FDBD with QRM-MLD can achieve the BER performance close to the matched-filter (MF) bound while reducing the computational complexity compared to CP-SC.