An Efficient Receiver for Preamble Detection in LTE SC-FDMA Systems with an Antenna Array

In this letter, we propose an efficient low complexity receiver for the preamble detection in single-carrier frequency division multiple access (SC-FDMA) systems with an antenna array. The proposed low complexity receiver is derived using a digital mixer and a multistage decimation filter. The signa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2010-12, Vol.14 (12), p.1167-1169
Main Authors: LEE, Moon-Sik, CHOI, Young-Min
Format: Article
Language:English
Subjects:
antenna array
Antenna arrays
Antennas
Applied sciences
Channels
Complexity
Complexity theory
Detection, estimation, filtering, equalization, prediction
Discrete Fourier transforms
Equivalence
Exact sciences and technology
Frequency division multiple access
Frequency domain analysis
Information, signal and communications theory
low complexity receiver
LTE
multistage decimation filter
Optimization
Radiocommunications
Receivers
Receiving antennas
SC-FDMA
Signal and communications theory
Signal, noise
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, we propose an efficient low complexity receiver for the preamble detection in single-carrier frequency division multiple access (SC-FDMA) systems with an antenna array. The proposed low complexity receiver is derived using a digital mixer and a multistage decimation filter. The signals for each receive antenna are non-coherently combined. Simulations performed in various channel environments validate that the proposed receiver attains a high detection performance equivalent to the full frequency domain approach which provides the optimal performance, while being quite low in computational complexity.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2010.101210.101409