A Low-Complexity Bock Linear Smoothing Channel Estimation for SIMO-OFDM Systems without Cyclic Prefix
Summary :
Orthogonal frequency-division multiplexing (OFDM) systems often use a cyclic prefix (CP) to simplify the equalization design at the cost of bandwidth efficiency. To increase the bandwidth efficiency, we study the blind equalization with linear smoothing [1] for single-input multiple-output (SIMO) OFDM systems without CP insertion in this paper. Due to the block Toeplitz structure of channel matrix, the block matrix scheme is applied to the linear smoothing channel estimation, which equivalently increases the number of sample vectors and thus reduces the perturbation of sample autocorrelation matrix. Compared with the linear smoothing and subspace methods, the proposed block linear smoothing requires the lowest computational complexity. Computer simulations show that the block linear smoothing yields a channel estimation error smaller than that from linear smoothing, and close to that of the subspace method. Evaluating by the minimum mean-square error (MMSE) equalizer, the block linear smoothing and subspace methods have nearly the same bit-error-rates (BERs).
- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.4 pp.1076-1083
- Publication Date
- 2008/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e91-b.4.1076
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jung-Lang YU, Chia-Hao CHEN, "A Low-Complexity Bock Linear Smoothing Channel Estimation for SIMO-OFDM Systems without Cyclic Prefix" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 4, pp. 1076-1083, April 2008, doi: 10.1093/ietcom/e91-b.4.1076.
Abstract: Orthogonal frequency-division multiplexing (OFDM) systems often use a cyclic prefix (CP) to simplify the equalization design at the cost of bandwidth efficiency. To increase the bandwidth efficiency, we study the blind equalization with linear smoothing [1] for single-input multiple-output (SIMO) OFDM systems without CP insertion in this paper. Due to the block Toeplitz structure of channel matrix, the block matrix scheme is applied to the linear smoothing channel estimation, which equivalently increases the number of sample vectors and thus reduces the perturbation of sample autocorrelation matrix. Compared with the linear smoothing and subspace methods, the proposed block linear smoothing requires the lowest computational complexity. Computer simulations show that the block linear smoothing yields a channel estimation error smaller than that from linear smoothing, and close to that of the subspace method. Evaluating by the minimum mean-square error (MMSE) equalizer, the block linear smoothing and subspace methods have nearly the same bit-error-rates (BERs).
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.4.1076/_p
Copy
@ARTICLE{e91-b_4_1076,
author={Jung-Lang YU, Chia-Hao CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={A Low-Complexity Bock Linear Smoothing Channel Estimation for SIMO-OFDM Systems without Cyclic Prefix},
year={2008},
volume={E91-B},
number={4},
pages={1076-1083},
abstract={Orthogonal frequency-division multiplexing (OFDM) systems often use a cyclic prefix (CP) to simplify the equalization design at the cost of bandwidth efficiency. To increase the bandwidth efficiency, we study the blind equalization with linear smoothing [1] for single-input multiple-output (SIMO) OFDM systems without CP insertion in this paper. Due to the block Toeplitz structure of channel matrix, the block matrix scheme is applied to the linear smoothing channel estimation, which equivalently increases the number of sample vectors and thus reduces the perturbation of sample autocorrelation matrix. Compared with the linear smoothing and subspace methods, the proposed block linear smoothing requires the lowest computational complexity. Computer simulations show that the block linear smoothing yields a channel estimation error smaller than that from linear smoothing, and close to that of the subspace method. Evaluating by the minimum mean-square error (MMSE) equalizer, the block linear smoothing and subspace methods have nearly the same bit-error-rates (BERs).},
keywords={},
doi={10.1093/ietcom/e91-b.4.1076},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - A Low-Complexity Bock Linear Smoothing Channel Estimation for SIMO-OFDM Systems without Cyclic Prefix
T2 - IEICE TRANSACTIONS on Communications
SP - 1076
EP - 1083
AU - Jung-Lang YU
AU - Chia-Hao CHEN
PY - 2008
DO - 10.1093/ietcom/e91-b.4.1076
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2008
AB - Orthogonal frequency-division multiplexing (OFDM) systems often use a cyclic prefix (CP) to simplify the equalization design at the cost of bandwidth efficiency. To increase the bandwidth efficiency, we study the blind equalization with linear smoothing [1] for single-input multiple-output (SIMO) OFDM systems without CP insertion in this paper. Due to the block Toeplitz structure of channel matrix, the block matrix scheme is applied to the linear smoothing channel estimation, which equivalently increases the number of sample vectors and thus reduces the perturbation of sample autocorrelation matrix. Compared with the linear smoothing and subspace methods, the proposed block linear smoothing requires the lowest computational complexity. Computer simulations show that the block linear smoothing yields a channel estimation error smaller than that from linear smoothing, and close to that of the subspace method. Evaluating by the minimum mean-square error (MMSE) equalizer, the block linear smoothing and subspace methods have nearly the same bit-error-rates (BERs).
ER -
English
