On SC/FDE block transmission with reduced cyclic prefix assistance
Type
article
Identifier
GUSMÃO, A. [et al.] (2006) - On SC/FDE block transmission with reduced cyclic prefix assistance. In IEEE International Conference on Communications, Istanbul, 11-15 June. Doi: 10.1109/ICC.2006.255468
10.1109/ICC.2006.255468
Title
On SC/FDE block transmission with reduced cyclic prefix assistance
Subject
Cyclic prefix assistance
SC/FDE block transmission
SC/FDE block transmission
Date
2018-01-30T12:38:34Z
2018-01-30T12:38:34Z
2006-07-11
2018-01-30T12:38:34Z
2006-07-11
Description
“© © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
For conventional CP-assisted (Cyclic Prefix) SC/FDE implementations (Single- Carrier/Frequency-Domain Equalisation), as well as for OFDM implementations (Orthogonal Frequency Division Multiplexing), the CP length is known to be selected on the basis of the expected maximum delay spread. Next, the data block size can be chosen to be large enough to minimise the CP overhead, yet small enough to make the channel variation over the block negligible. This paper considers the possibility of reducing the overall CP assistance, when transmitting sequences of SC blocks, while avoiding an excessively long FFT block for FDE purposes and keeping good performances through a moderate increase of the FDE receiver complexity. Firstly, we present an algorithm for a Decision-Directed Correction (DDC) of the FDE inputs when the CP is not long enough to cope with the time-dispersive channel effects. The resulting FDE performance is then evaluated in worst-case (CP-free) conditions, and the impact of previous decisions which are not error-free is shown to be rather small. In the following, we present and evaluate a novel class of reduced-CP SC/FDE schemes, which takes advantage of the DDC algorithm for replacing "seless" CP redundancy by fully useful channel coding redundancy: highly power/bandwidth efficient block transmission schemes, especially recommendable for both strongly time-dispersive and time-varying channel conditions, are then achieved.
info:eu-repo/semantics/publishedVersion
For conventional CP-assisted (Cyclic Prefix) SC/FDE implementations (Single- Carrier/Frequency-Domain Equalisation), as well as for OFDM implementations (Orthogonal Frequency Division Multiplexing), the CP length is known to be selected on the basis of the expected maximum delay spread. Next, the data block size can be chosen to be large enough to minimise the CP overhead, yet small enough to make the channel variation over the block negligible. This paper considers the possibility of reducing the overall CP assistance, when transmitting sequences of SC blocks, while avoiding an excessively long FFT block for FDE purposes and keeping good performances through a moderate increase of the FDE receiver complexity. Firstly, we present an algorithm for a Decision-Directed Correction (DDC) of the FDE inputs when the CP is not long enough to cope with the time-dispersive channel effects. The resulting FDE performance is then evaluated in worst-case (CP-free) conditions, and the impact of previous decisions which are not error-free is shown to be rather small. In the following, we present and evaluate a novel class of reduced-CP SC/FDE schemes, which takes advantage of the DDC algorithm for replacing "seless" CP redundancy by fully useful channel coding redundancy: highly power/bandwidth efficient block transmission schemes, especially recommendable for both strongly time-dispersive and time-varying channel conditions, are then achieved.
info:eu-repo/semantics/publishedVersion
Access restrictions
restrictedAccess
http://creativecommons.org/licenses/by/4.0/
http://creativecommons.org/licenses/by/4.0/
Language
eng
Comments
