Delay processing vs. per survivor techniques for equalization with fading channels

Shan Gao; Iain B. Collings

doi:10.1109/GLOCOM.1999.831714

Delay processing vs. per survivor techniques for equalization with fading channels

Shan Gao^*, Iain B. Collings

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

1 Citation (Scopus)

Abstract

This paper analyses the performance of equalizers for unknown fading channels. We compare two versions of a delay processing equalizer, with a per-survivor equalizer, and with a Viterbi algorithm with known channel information. New adaptive algorithms are developed which adjust the decision delay based on the trellis path metric ratios and the path merging lag. The analysis focuses on the trade-off between computational complexity and achievable bit error rate. The crucial factors include fading rate, noise, equalization trellis size, and accuracy of channel estimates. Simulations are used to determine the effect of each of these factors on algorithm performance.

Original language	English
Title of host publication	Conference Record / IEEE Global Telecommunications Conference
Place of Publication	Piscataway, N.J.
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	2306-2310
Number of pages	5
Volume	5
ISBN (Print)	0780357965
DOIs	https://doi.org/10.1109/GLOCOM.1999.831714
Publication status	Published - Dec 1999
Externally published	Yes
Event	1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz Duration: 5 Dec 1999 → 9 Dec 1999

Other

Other	1999 IEEE Global Telecommunication Conference - GLOBECOM'99
City	Rio de Janeiro, Braz
Period	5/12/99 → 9/12/99

Access to Document

10.1109/GLOCOM.1999.831714

Cite this

@inproceedings{41ee42be4dc444a790a82af05b0cd9ff,

title = "Delay processing vs. per survivor techniques for equalization with fading channels",

abstract = "This paper analyses the performance of equalizers for unknown fading channels. We compare two versions of a delay processing equalizer, with a per-survivor equalizer, and with a Viterbi algorithm with known channel information. New adaptive algorithms are developed which adjust the decision delay based on the trellis path metric ratios and the path merging lag. The analysis focuses on the trade-off between computational complexity and achievable bit error rate. The crucial factors include fading rate, noise, equalization trellis size, and accuracy of channel estimates. Simulations are used to determine the effect of each of these factors on algorithm performance.",

author = "Shan Gao and Collings, {Iain B.}",

year = "1999",

month = dec,

doi = "10.1109/GLOCOM.1999.831714",

language = "English",

isbn = "0780357965",

volume = "5",

pages = "2306--2310",

booktitle = "Conference Record / IEEE Global Telecommunications Conference",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "1999 IEEE Global Telecommunication Conference - GLOBECOM'99 ; Conference date: 05-12-1999 Through 09-12-1999",

}

Gao, S & Collings, IB 1999, Delay processing vs. per survivor techniques for equalization with fading channels. in Conference Record / IEEE Global Telecommunications Conference. vol. 5, 831714, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, N.J., pp. 2306-2310, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 5/12/99. https://doi.org/10.1109/GLOCOM.1999.831714

Delay processing vs. per survivor techniques for equalization with fading channels. / Gao, Shan; Collings, Iain B.
Conference Record / IEEE Global Telecommunications Conference. Vol. 5 Piscataway, N.J.: Institute of Electrical and Electronics Engineers (IEEE), 1999. p. 2306-2310 831714.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Delay processing vs. per survivor techniques for equalization with fading channels

AU - Gao, Shan

AU - Collings, Iain B.

PY - 1999/12

Y1 - 1999/12

N2 - This paper analyses the performance of equalizers for unknown fading channels. We compare two versions of a delay processing equalizer, with a per-survivor equalizer, and with a Viterbi algorithm with known channel information. New adaptive algorithms are developed which adjust the decision delay based on the trellis path metric ratios and the path merging lag. The analysis focuses on the trade-off between computational complexity and achievable bit error rate. The crucial factors include fading rate, noise, equalization trellis size, and accuracy of channel estimates. Simulations are used to determine the effect of each of these factors on algorithm performance.

AB - This paper analyses the performance of equalizers for unknown fading channels. We compare two versions of a delay processing equalizer, with a per-survivor equalizer, and with a Viterbi algorithm with known channel information. New adaptive algorithms are developed which adjust the decision delay based on the trellis path metric ratios and the path merging lag. The analysis focuses on the trade-off between computational complexity and achievable bit error rate. The crucial factors include fading rate, noise, equalization trellis size, and accuracy of channel estimates. Simulations are used to determine the effect of each of these factors on algorithm performance.

UR - http://www.scopus.com/inward/record.url?scp=0033295833&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.1999.831714

DO - 10.1109/GLOCOM.1999.831714

M3 - Conference proceeding contribution

AN - SCOPUS:0033295833

SN - 0780357965

VL - 5

SP - 2306

EP - 2310

BT - Conference Record / IEEE Global Telecommunications Conference

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, N.J.

T2 - 1999 IEEE Global Telecommunication Conference - GLOBECOM'99

Y2 - 5 December 1999 through 9 December 1999

ER -

Delay processing vs. per survivor techniques for equalization with fading channels

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this