On the SOVA for extremely high code rates over partial response channels

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper, we extend the derivation of the iterative soft-output Viterbi algorithm (SOVA) for partial response (PR) channels, and modify its decoding process such that it works consistently for arbitrary high code rates, e.g., rate 64/65. We show that the modified SOVA always outperforms the conventional SOVA that appears in the literature with a significant difference for high code rates. It also offers a significant cut down in the trace-back computations. We further examine its performance for parallel and serial concatenated codes on a preceded Class IV partial response (PR4) channel. Code rates of the form k0/k0+1 (k0 = 4, 8, and 64) are considered. Our simulations indicate that the loss suffered by the modified SOVA, relative to the APP algorithm, is consistent for all code rates and is at most 1.2 dB for parallel concatenations and at most 1.6 dB for serial concatenations at Pb = 10-5.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalJournal of Communications and Networks
Volume5
Issue number1
Publication statusPublished - Mar 2003
Externally publishedYes

Fingerprint

Viterbi algorithm
Concatenated codes
Decoding

Keywords

  • Decoding depth
  • Iterative decoding
  • Parallel and serial concatenation
  • Partial response signaling
  • SOVA

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

On the SOVA for extremely high code rates over partial response channels. / Ghrayeb, Ali.

In: Journal of Communications and Networks, Vol. 5, No. 1, 03.2003, p. 1-6.

Research output: Contribution to journalArticle

@article{5ab9ca9e9c9d4a56b5577742a0e29a0f,
title = "On the SOVA for extremely high code rates over partial response channels",
abstract = "In this paper, we extend the derivation of the iterative soft-output Viterbi algorithm (SOVA) for partial response (PR) channels, and modify its decoding process such that it works consistently for arbitrary high code rates, e.g., rate 64/65. We show that the modified SOVA always outperforms the conventional SOVA that appears in the literature with a significant difference for high code rates. It also offers a significant cut down in the trace-back computations. We further examine its performance for parallel and serial concatenated codes on a preceded Class IV partial response (PR4) channel. Code rates of the form k0/k0+1 (k0 = 4, 8, and 64) are considered. Our simulations indicate that the loss suffered by the modified SOVA, relative to the APP algorithm, is consistent for all code rates and is at most 1.2 dB for parallel concatenations and at most 1.6 dB for serial concatenations at Pb = 10-5.",
keywords = "Decoding depth, Iterative decoding, Parallel and serial concatenation, Partial response signaling, SOVA",
author = "Ali Ghrayeb",
year = "2003",
month = "3",
language = "English",
volume = "5",
pages = "1--6",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "1",

}

TY - JOUR

T1 - On the SOVA for extremely high code rates over partial response channels

AU - Ghrayeb, Ali

PY - 2003/3

Y1 - 2003/3

N2 - In this paper, we extend the derivation of the iterative soft-output Viterbi algorithm (SOVA) for partial response (PR) channels, and modify its decoding process such that it works consistently for arbitrary high code rates, e.g., rate 64/65. We show that the modified SOVA always outperforms the conventional SOVA that appears in the literature with a significant difference for high code rates. It also offers a significant cut down in the trace-back computations. We further examine its performance for parallel and serial concatenated codes on a preceded Class IV partial response (PR4) channel. Code rates of the form k0/k0+1 (k0 = 4, 8, and 64) are considered. Our simulations indicate that the loss suffered by the modified SOVA, relative to the APP algorithm, is consistent for all code rates and is at most 1.2 dB for parallel concatenations and at most 1.6 dB for serial concatenations at Pb = 10-5.

AB - In this paper, we extend the derivation of the iterative soft-output Viterbi algorithm (SOVA) for partial response (PR) channels, and modify its decoding process such that it works consistently for arbitrary high code rates, e.g., rate 64/65. We show that the modified SOVA always outperforms the conventional SOVA that appears in the literature with a significant difference for high code rates. It also offers a significant cut down in the trace-back computations. We further examine its performance for parallel and serial concatenated codes on a preceded Class IV partial response (PR4) channel. Code rates of the form k0/k0+1 (k0 = 4, 8, and 64) are considered. Our simulations indicate that the loss suffered by the modified SOVA, relative to the APP algorithm, is consistent for all code rates and is at most 1.2 dB for parallel concatenations and at most 1.6 dB for serial concatenations at Pb = 10-5.

KW - Decoding depth

KW - Iterative decoding

KW - Parallel and serial concatenation

KW - Partial response signaling

KW - SOVA

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

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

M3 - Article

VL - 5

SP - 1

EP - 6

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 1

ER -