Guard sequence optimization for block transmission over linear frequency-selective channels
We show that the optimum length-/spl nu/ guard sequence for block transmission over a linear Gaussian-noise dispersive channel with memory /spl nu/ is a linear combination of the N information symbols of the block. A closed-form expression for the optimum guard sequence is derived subject to a total...
Saved in:
Published in | IEEE transactions on communications Vol. 50; no. 6; pp. 938 - 946 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.06.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We show that the optimum length-/spl nu/ guard sequence for block transmission over a linear Gaussian-noise dispersive channel with memory /spl nu/ is a linear combination of the N information symbols of the block. A closed-form expression for the optimum guard sequence is derived subject to a total average energy constraint on the information and guard symbols. The achievable channel block throughput with the optimum guard sequence is compared with that achievable with two common guard sequence types, namely zero stuffing and cyclic prefix. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
ISSN: | 0090-6778 1558-0857 |
DOI: | 10.1109/TCOMM.2002.1010613 |