Du är här

On permutor designs based on cycles for serially concatenated convolutional codes

Författare:
Publiceringsår: 2004
Språk: Engelska
Sidor: 1494-1503
Publikation/Tidskrift/Serie: IEEE TRANSACTIONS ON COMMUNICATIONS
Volym: 52
Nummer: 9
Dokumenttyp: Artikel
Förlag: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

Sammanfattning

A new permutor design for serially concatenated convolutional codes is presented. It is based on the construction of a permutation matrix without short cycles of special types. For such a permutor, we give a lower bound on the minimum distance of the overall code that is significantly larger than that achievable with first-order separation (spreading factors). Additionally, the minimum distance can be attuned to the permutation length. This property may be useful for the construction of codes with moderate block lengths.

Disputation

Nyckelord

  • Technology and Engineering
  • permutor design
  • serially concatenated convolutional codes (SCCCs)

Övriga

Published
Yes
  • ISSN: 0090-6778

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen