Reduced-state sequence estimation for coded modulation of intersymbol interference channels

Eyüboğlu, Murat; Qureshi, Shahzad Ahmad

doi:10.1109/49.29621

Cited by 183 publications

(55 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Note that when using the samples only at time k − 1 and k, (9) reduces to the M&M TED (by ignoring the constant term of both TEDs). It is worth exploring the characteristics of both TEDs, which can be determined by the timing function [3], defined as the mean ofˆ k assuming that all decisions are correct and the input data symbols are uncorrelated with unit energy.…”

Section: ∂L(y|rmentioning

confidence: 99%

See 1 more Smart Citation

Per-survivor timing recovery for uncoded partial response channels

Kovintavewat

Barry

Erden

et al. 2004

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)

View full text Add to dashboard Cite

Abstract-A conventional receiver performs timing recovery and equalization separately. Specifically, conventional timing recovery is based on a phase-locked loop that relies on the decision provided by its own symbol detector. We propose a new timing recovery scheme based on per-survivor processing (PSP) that jointly performs timing recovery and equalization for uncoded partial response channels. In the proposed scheme, each survivor of the Viterbi algorithm maintains its own estimate of the timing offset, and this estimate is updated according to the history data associated with the survivor path. As compared to conventional timing recovery at BER = 10 −4 , the proposed scheme can provide a 0.5 dB gain in SNR.

show abstract

Section: ∂L(y|rmentioning

confidence: 99%

“…PSP was first applied to the application of reduced-state sequence estimation [9]. The general PSP concept and its various applications were later introduced in [5].…”

Section: Psp-based Timing Recoverymentioning

confidence: 99%

Per-survivor timing recovery for uncoded partial response channels

Kovintavewat

Barry

Erden

et al. 2004

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)

View full text Add to dashboard Cite

show abstract

“…Based on the STM algorithm, are chosen to maximize (7). Applying the strict convex property of log function, can be chosen to maximize (19) As a result, to find the maximum value of (19) is to minimize (20) Therefore, the variance of error is not involved in determining . To figure out the solution, and are taken into (20).…”

Section: ) Delay Decision Mode (Ddm)mentioning

confidence: 99%

Soft-threshold-based multilayer decision feedback equalizer (STM-DFE) algorithm and VLSI architecture

Lin

2005

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Abstract-The decision feedback equalizer (DFE) is an efficient scheme to suppress intersymbol interference (ISI) in various communication and magnetic recording systems. However, most cost-effective DFE implementations suffer from the phenomenon of error propagation, which degrades its bit error rate (BER) performance. This paper proposes a soft-threshold-based multilayer DFE (STM-DFE) technique to reduce the BER. It involves very low hardware overhead costs as compared to the conventional DFE. When applied to a practical Lorentzian channel and channels of different eigenvalue spread, the STM algorithm even outperforms the Ideal DFE (IDFE) system (in the IDFE, symbols are correctly fed back without propagation errors). Simulation results show that the proposed scheme can efficiently reduce the burst error length (BEL) as well as BER. Additionally, the hardware overhead to implement the STM-DFE algorithm is negligible compared with the conventional DFE. By using the concepts of Shanbhag and Parhi and of Yang, Wu, and Lai, we also propose the pipelined STM-DFE (PSTM-DFE) architecture for high-speed communication/storage applications.

show abstract

“…However, the complexity of the algorithm increases exponentially with the increase in the length of the coefficients of the channel. Several literatures have suggested the reduced complexity ML detectors [6]- [7].…”

Section: Introductionmentioning

confidence: 99%

A Novel Approach for Turbo Decoding In ISI Channel

Soni¹,

Chauhan²,

Vasudevan³

2012

IJCA

View full text Add to dashboard Cite

Turbo codes are family of forward error correcting codes, whose performance is near Shannon limit. Turbo decoding is based on the maximum a-posterior algorithm (MAP) algorithm. In this paper, the problem of turbo decoding in ISI channel is studied. A Super-trellis structure method has been presented and modified turbo decoding is suggested. Two methods have been suggested for turbo decoding in ISI channel. In the first method, we take all possible combinations of output of encoder-2 and in method-2, output of each encoder is passed through channel filter independently. Method-2 performs better than method-1 but requires higher bandwidth. The improvement in performance is demonstrated through simulations.

show abstract

Reduced-state sequence estimation for coded modulation of intersymbol interference channels

Cited by 183 publications

References 12 publications

Per-survivor timing recovery for uncoded partial response channels

Per-survivor timing recovery for uncoded partial response channels

Soft-threshold-based multilayer decision feedback equalizer (STM-DFE) algorithm and VLSI architecture

A Novel Approach for Turbo Decoding In ISI Channel

Contact Info

Product

Resources

About