Parallel Adaptive Decision Feedback Equalizers

Kalavai J. Raghunath, Keshab K Parhi

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

Achieving high speed in decision feedback equalizers (DFE's) is difficult because of the nonlinear decision directed adaptation. Recently, parallel DFE and extended LMS DFE algorithms were proposed for parallel implementation of DFE's. In this correspondence, we first present a new double-row DFE algorithm which outperforms the previous approaches. Under the no error propagation assumption, our algorithm will perform exactly like a serially adapting DFE. The multiplication complexity of the double-row DFE algorithm is of the same order as the parallel DFE algorithm and the extended LMS method. The previous algorithms and the double-row DFE algorithm may become impractical to implement due to their large computational complexity. We propose three additional novel parallel implementations of the DFE which lead to considerable hardware savings and avoid the coding loss of the former approaches. The different algorithms are compared on the basis of convergence analysis and simulation results.

Original languageEnglish (US)
Pages (from-to)1956-1961
Number of pages6
JournalIEEE Transactions on Signal Processing
Volume41
Issue number5
DOIs
StatePublished - Jan 1 1993

Fingerprint

Decision feedback equalizers
Computational complexity
Hardware

Cite this

Parallel Adaptive Decision Feedback Equalizers. / Raghunath, Kalavai J.; Parhi, Keshab K.

In: IEEE Transactions on Signal Processing, Vol. 41, No. 5, 01.01.1993, p. 1956-1961.

Research output: Contribution to journalArticle

Raghunath, Kalavai J. ; Parhi, Keshab K. / Parallel Adaptive Decision Feedback Equalizers. In: IEEE Transactions on Signal Processing. 1993 ; Vol. 41, No. 5. pp. 1956-1961.
@article{bde1f733ec60452aa8a0de97a812a4e3,
title = "Parallel Adaptive Decision Feedback Equalizers",
abstract = "Achieving high speed in decision feedback equalizers (DFE's) is difficult because of the nonlinear decision directed adaptation. Recently, parallel DFE and extended LMS DFE algorithms were proposed for parallel implementation of DFE's. In this correspondence, we first present a new double-row DFE algorithm which outperforms the previous approaches. Under the no error propagation assumption, our algorithm will perform exactly like a serially adapting DFE. The multiplication complexity of the double-row DFE algorithm is of the same order as the parallel DFE algorithm and the extended LMS method. The previous algorithms and the double-row DFE algorithm may become impractical to implement due to their large computational complexity. We propose three additional novel parallel implementations of the DFE which lead to considerable hardware savings and avoid the coding loss of the former approaches. The different algorithms are compared on the basis of convergence analysis and simulation results.",
author = "Raghunath, {Kalavai J.} and Parhi, {Keshab K}",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/78.215315",
language = "English (US)",
volume = "41",
pages = "1956--1961",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Parallel Adaptive Decision Feedback Equalizers

AU - Raghunath, Kalavai J.

AU - Parhi, Keshab K

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Achieving high speed in decision feedback equalizers (DFE's) is difficult because of the nonlinear decision directed adaptation. Recently, parallel DFE and extended LMS DFE algorithms were proposed for parallel implementation of DFE's. In this correspondence, we first present a new double-row DFE algorithm which outperforms the previous approaches. Under the no error propagation assumption, our algorithm will perform exactly like a serially adapting DFE. The multiplication complexity of the double-row DFE algorithm is of the same order as the parallel DFE algorithm and the extended LMS method. The previous algorithms and the double-row DFE algorithm may become impractical to implement due to their large computational complexity. We propose three additional novel parallel implementations of the DFE which lead to considerable hardware savings and avoid the coding loss of the former approaches. The different algorithms are compared on the basis of convergence analysis and simulation results.

AB - Achieving high speed in decision feedback equalizers (DFE's) is difficult because of the nonlinear decision directed adaptation. Recently, parallel DFE and extended LMS DFE algorithms were proposed for parallel implementation of DFE's. In this correspondence, we first present a new double-row DFE algorithm which outperforms the previous approaches. Under the no error propagation assumption, our algorithm will perform exactly like a serially adapting DFE. The multiplication complexity of the double-row DFE algorithm is of the same order as the parallel DFE algorithm and the extended LMS method. The previous algorithms and the double-row DFE algorithm may become impractical to implement due to their large computational complexity. We propose three additional novel parallel implementations of the DFE which lead to considerable hardware savings and avoid the coding loss of the former approaches. The different algorithms are compared on the basis of convergence analysis and simulation results.

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

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

U2 - 10.1109/78.215315

DO - 10.1109/78.215315

M3 - Article

VL - 41

SP - 1956

EP - 1961

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 5

ER -