On Superregular Matrices and Convolutional Codes with Finite Decoder Memory

Jonas Hansen, Jan Østergaard, Johnny Kudahl, John Madsen

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

Resumé

In this paper, we present explicit code constructions for a family of (n,k,δ) convolutional codes with optimum distance profiles. The family of convolutional codes is obtained from sets of jointly superregular matrices. For the case of finite decoder memory, we evaluate the performance of the constructed codes in terms of both symbol loss probability and symbol delay. We then present a combinatorial method to calculate the exact symbol loss probability and symbol delay for each symbol individually. We compare the symbol loss probability for two specific systematic convolutional codes for the cases where the sink has infinite or finite memory. Finally, we compare the performance of our convolutional codes with optimum distance profile and random based convolutional codes.

OriginalsprogEngelsk
Titel2018 IEEE 87th Vehicular Technology Conference (VTC Spring)
Antal sider5
ForlagIEEE
Publikationsdato20 jul. 2018
Sider1-5
ISBN (Trykt)978-1-5386-6356-1
ISBN (Elektronisk)978-1-5386-6355-4
DOI
StatusUdgivet - 20 jul. 2018
BegivenhedIEEE Vehicular Technology Conference Spring 2018 - Porto, Portugal
Varighed: 3 jun. 20186 jun. 2018
http://www.ieeevtc.org/vtc2018spring/

Konference

KonferenceIEEE Vehicular Technology Conference Spring 2018
LandPortugal
ByPorto
Periode03/06/201806/06/2018
Internetadresse
NavnI E E E V T S Vehicular Technology Conference. Proceedings
ISSN1550-2252

Fingerprint

Convolutional codes
Data storage equipment

Emneord

    Citer dette

    Hansen, J., Østergaard, J., Kudahl, J., & Madsen, J. (2018). On Superregular Matrices and Convolutional Codes with Finite Decoder Memory. I 2018 IEEE 87th Vehicular Technology Conference (VTC Spring) (s. 1-5). IEEE. I E E E V T S Vehicular Technology Conference. Proceedings https://doi.org/10.1109/VTCSpring.2018.8417504
    Hansen, Jonas ; Østergaard, Jan ; Kudahl, Johnny ; Madsen, John. / On Superregular Matrices and Convolutional Codes with Finite Decoder Memory. 2018 IEEE 87th Vehicular Technology Conference (VTC Spring) . IEEE, 2018. s. 1-5 (I E E E V T S Vehicular Technology Conference. Proceedings).
    @inproceedings{23a11a6f86a44f78b539523727336daa,
    title = "On Superregular Matrices and Convolutional Codes with Finite Decoder Memory",
    abstract = "In this paper, we present explicit code constructions for a family of (n,k,δ) convolutional codes with optimum distance profiles. The family of convolutional codes is obtained from sets of jointly superregular matrices. For the case of finite decoder memory, we evaluate the performance of the constructed codes in terms of both symbol loss probability and symbol delay. We then present a combinatorial method to calculate the exact symbol loss probability and symbol delay for each symbol individually. We compare the symbol loss probability for two specific systematic convolutional codes for the cases where the sink has infinite or finite memory. Finally, we compare the performance of our convolutional codes with optimum distance profile and random based convolutional codes.",
    keywords = "Convolutional codes, finite memory, linear codes, superregular matrices",
    author = "Jonas Hansen and Jan {\O}stergaard and Johnny Kudahl and John Madsen",
    year = "2018",
    month = "7",
    day = "20",
    doi = "10.1109/VTCSpring.2018.8417504",
    language = "English",
    isbn = "978-1-5386-6356-1",
    pages = "1--5",
    booktitle = "2018 IEEE 87th Vehicular Technology Conference (VTC Spring)",
    publisher = "IEEE",
    address = "United States",

    }

    Hansen, J, Østergaard, J, Kudahl, J & Madsen, J 2018, On Superregular Matrices and Convolutional Codes with Finite Decoder Memory. i 2018 IEEE 87th Vehicular Technology Conference (VTC Spring) . IEEE, I E E E V T S Vehicular Technology Conference. Proceedings, s. 1-5, Porto, Portugal, 03/06/2018. https://doi.org/10.1109/VTCSpring.2018.8417504

    On Superregular Matrices and Convolutional Codes with Finite Decoder Memory. / Hansen, Jonas; Østergaard, Jan; Kudahl, Johnny; Madsen, John.

    2018 IEEE 87th Vehicular Technology Conference (VTC Spring) . IEEE, 2018. s. 1-5.

    Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

    TY - GEN

    T1 - On Superregular Matrices and Convolutional Codes with Finite Decoder Memory

    AU - Hansen, Jonas

    AU - Østergaard, Jan

    AU - Kudahl, Johnny

    AU - Madsen, John

    PY - 2018/7/20

    Y1 - 2018/7/20

    N2 - In this paper, we present explicit code constructions for a family of (n,k,δ) convolutional codes with optimum distance profiles. The family of convolutional codes is obtained from sets of jointly superregular matrices. For the case of finite decoder memory, we evaluate the performance of the constructed codes in terms of both symbol loss probability and symbol delay. We then present a combinatorial method to calculate the exact symbol loss probability and symbol delay for each symbol individually. We compare the symbol loss probability for two specific systematic convolutional codes for the cases where the sink has infinite or finite memory. Finally, we compare the performance of our convolutional codes with optimum distance profile and random based convolutional codes.

    AB - In this paper, we present explicit code constructions for a family of (n,k,δ) convolutional codes with optimum distance profiles. The family of convolutional codes is obtained from sets of jointly superregular matrices. For the case of finite decoder memory, we evaluate the performance of the constructed codes in terms of both symbol loss probability and symbol delay. We then present a combinatorial method to calculate the exact symbol loss probability and symbol delay for each symbol individually. We compare the symbol loss probability for two specific systematic convolutional codes for the cases where the sink has infinite or finite memory. Finally, we compare the performance of our convolutional codes with optimum distance profile and random based convolutional codes.

    KW - Convolutional codes

    KW - finite memory

    KW - linear codes

    KW - superregular matrices

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

    U2 - 10.1109/VTCSpring.2018.8417504

    DO - 10.1109/VTCSpring.2018.8417504

    M3 - Article in proceeding

    SN - 978-1-5386-6356-1

    SP - 1

    EP - 5

    BT - 2018 IEEE 87th Vehicular Technology Conference (VTC Spring)

    PB - IEEE

    ER -

    Hansen J, Østergaard J, Kudahl J, Madsen J. On Superregular Matrices and Convolutional Codes with Finite Decoder Memory. I 2018 IEEE 87th Vehicular Technology Conference (VTC Spring) . IEEE. 2018. s. 1-5. (I E E E V T S Vehicular Technology Conference. Proceedings). https://doi.org/10.1109/VTCSpring.2018.8417504