Time varying convolutional codes revisited

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

There are several cases where the maximum free distance (MFD) time-invariant convolutional code of a given rate and total encoder memory does not meet the Heller bound or where the encoder that does meet the Heller bound is catastrophic. In order to find codes that meet the Heller bound, it is sometimes necessary to use time-varying convolutional codes. Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters. In addition, the use of time-varying encoders in order to achieve "spectral thinning" is explored.

Original languageEnglish (US)
Title of host publicationProceedings - 2001 IEEE Information Theory Workshop, ITW 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages67-69
Number of pages3
ISBN (Electronic)0780371194, 9780780371194
DOIs
StatePublished - Jan 1 2001
Event2001 IEEE Information Theory Workshop, ITW 2001 - Cairns, Australia
Duration: Sep 2 2001Sep 7 2001

Publication series

NameProceedings - 2001 IEEE Information Theory Workshop, ITW 2001

Other

Other2001 IEEE Information Theory Workshop, ITW 2001
CountryAustralia
CityCairns
Period9/2/019/7/01

Fingerprint

Convolutional codes
Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Computational Theory and Mathematics
  • Electrical and Electronic Engineering

Cite this

Perez, L. C. (2001). Time varying convolutional codes revisited. In Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001 (pp. 67-69). [955138] (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2001.955138

Time varying convolutional codes revisited. / Perez, Lance C.

Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 67-69 955138 (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Perez, LC 2001, Time varying convolutional codes revisited. in Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001., 955138, Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001, Institute of Electrical and Electronics Engineers Inc., pp. 67-69, 2001 IEEE Information Theory Workshop, ITW 2001, Cairns, Australia, 9/2/01. https://doi.org/10.1109/ITW.2001.955138
Perez LC. Time varying convolutional codes revisited. In Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 67-69. 955138. (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001). https://doi.org/10.1109/ITW.2001.955138
Perez, Lance C. / Time varying convolutional codes revisited. Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc., 2001. pp. 67-69 (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001).
@inproceedings{ffd5f11ef85c4ca9bc0bf9f23419ad87,
title = "Time varying convolutional codes revisited",
abstract = "There are several cases where the maximum free distance (MFD) time-invariant convolutional code of a given rate and total encoder memory does not meet the Heller bound or where the encoder that does meet the Heller bound is catastrophic. In order to find codes that meet the Heller bound, it is sometimes necessary to use time-varying convolutional codes. Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters. In addition, the use of time-varying encoders in order to achieve {"}spectral thinning{"} is explored.",
author = "Perez, {Lance C}",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/ITW.2001.955138",
language = "English (US)",
series = "Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "67--69",
booktitle = "Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001",

}

TY - GEN

T1 - Time varying convolutional codes revisited

AU - Perez, Lance C

PY - 2001/1/1

Y1 - 2001/1/1

N2 - There are several cases where the maximum free distance (MFD) time-invariant convolutional code of a given rate and total encoder memory does not meet the Heller bound or where the encoder that does meet the Heller bound is catastrophic. In order to find codes that meet the Heller bound, it is sometimes necessary to use time-varying convolutional codes. Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters. In addition, the use of time-varying encoders in order to achieve "spectral thinning" is explored.

AB - There are several cases where the maximum free distance (MFD) time-invariant convolutional code of a given rate and total encoder memory does not meet the Heller bound or where the encoder that does meet the Heller bound is catastrophic. In order to find codes that meet the Heller bound, it is sometimes necessary to use time-varying convolutional codes. Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters. In addition, the use of time-varying encoders in order to achieve "spectral thinning" is explored.

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

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

U2 - 10.1109/ITW.2001.955138

DO - 10.1109/ITW.2001.955138

M3 - Conference contribution

AN - SCOPUS:39049108597

T3 - Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001

SP - 67

EP - 69

BT - Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001

PB - Institute of Electrical and Electronics Engineers Inc.

ER -