.png){kind=icon}
.png){kind=icon}
Return
A Robust Decoding Scheme for Convolutionally Coded Transmission Through a Markov Gaussian Channel
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2014.2312727.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Communication systems are susceptible to impulse noise, particularly when the impulse statistics are not time invariant and are difficult to model accurately. To address the challenge of impulse noise, a robust and efficient decoding scheme was devised for single-carrier convolutionally coded transmissions over memory impulse noise channels. By accommodating channel states but without relying on statistical knowledge of impulses, the Viterbi algorithm (VA) based on an expanded set of trellis states was employed to perform maximum-likelihood decoding. A detailed analysis of complexity was offered; the analytical results reinforced the efficiency of the proposed scheme compared with the traditional VA. The simulation results indicated that the proposed decoding scheme is compellingly robust: The bit error probability performance level attained using the proposed decoder is remarkably close to that of an optimal decoder, which uses impulse statistics; furthermore, the proposed decoder was superior to the alpha-penalty function decoder, which neglects the channel memory property and experiences an error floor under fairly general circumstances.
Keywords:
Impulse noise
Markov Gaussian channel
transition probability
Viterbi algorithm (VA)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W