Convolutional codes from "optimal" linear block codes
Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Both non-recursive and recursive (i.e. turbo codes) convolutional codes (CCs) require careful choices of generators to obtain codes with large minimum distance and ultimately low bit error rate for a given channel characteristic. We first give a constructive method for building a generator matrix of either type of convolutional code based on certain low rate high distance linear block codes. For non-recursive CCs, these linear block codes have optimal dimension given block length n and minimum distance d if 2d>n. For recursive CCs, the linear block codes are constructed to appear random as determined by certain randomness tests. |
---|---|
ISSN: | 1058-6393 2576-2303 |
DOI: | 10.1109/ACSSC.1996.599065 |