Finite truncation depth trellis codes for the dicode channel

Finite truncation depth trellis codes for the dicode channel

A technique for the construction of trellis codes that double the squared free Euclidean distance on the dicode (1-D) channel is presented. This technique uses periodic pruning and permutation of the trellis to ensure that a small detector path memory length is sufficient. Some high rate codes const...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on magnetics 1995-11, Vol.31 (6), p.3027-3029
Hauptverfasser: Mittelholzer, T., McEwen, P.A., Altekar, S.A., Wolf, J.K.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Convolutional codes
Detectors
Electronics
Euclidean distance
Exact sciences and technology
Information processing
Laboratories
Lifting equipment
Magnetic devices
Magnetic recording
Other magnetic recording and storage devices (including tapes, disks, and drums)
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Signal processing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A technique for the construction of trellis codes that double the squared free Euclidean distance on the dicode (1-D) channel is presented. This technique uses periodic pruning and permutation of the trellis to ensure that a small detector path memory length is sufficient. Some high rate codes constructed using this technique are given.
ISSN:0018-9464
1941-0069
DOI:10.1109/20.490258