On Superregular Matrices and Convolutional Codes with Finite Decoder Memory

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

doi:10.1109/VTCSpring.2018.8417504

On Superregular Matrices and Convolutional Codes with Finite Decoder Memory

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

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

1 Citation (Scopus)

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.

Original language	English
Title of host publication	2018 IEEE 87th Vehicular Technology Conference (VTC Spring)
Number of pages	5
Publisher	IEEE (Institute of Electrical and Electronics Engineers)
Publication date	20 Jul 2018
Pages	1-5
ISBN (Print)	978-1-5386-6356-1
ISBN (Electronic)	978-1-5386-6355-4
DOIs	https://doi.org/10.1109/VTCSpring.2018.8417504
Publication status	Published - 20 Jul 2018
Event	IEEE Vehicular Technology Conference Spring 2018 - Porto, Portugal Duration: 3 Jun 2018 → 6 Jun 2018 http://www.ieeevtc.org/vtc2018spring/

Conference

Conference	IEEE Vehicular Technology Conference Spring 2018
Country/Territory	Portugal
City	Porto
Period	03/06/2018 → 06/06/2018
Internet address	http://www.ieeevtc.org/vtc2018spring/

Series	I E E E V T S Vehicular Technology Conference. Proceedings
ISSN	1550-2252

Keywords

Convolutional codes
finite memory
linear codes
superregular matrices

Access to Document

10.1109/VTCSpring.2018.8417504

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@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 = jul,

day = "20",

doi = "10.1109/VTCSpring.2018.8417504",

language = "English",

isbn = "978-1-5386-6356-1",

series = "I E E E V T S Vehicular Technology Conference. Proceedings",

publisher = "IEEE (Institute of Electrical and Electronics Engineers)",

pages = "1--5",

booktitle = "2018 IEEE 87th Vehicular Technology Conference (VTC Spring)",

address = "United States",

note = "IEEE Vehicular Technology Conference Spring 2018 ; Conference date: 03-06-2018 Through 06-06-2018",

url = "http://www.ieeevtc.org/vtc2018spring/",

}

Hansen, J, Østergaard, J, Kudahl, J & Madsen, J 2018, On Superregular Matrices and Convolutional Codes with Finite Decoder Memory. in 2018 IEEE 87th Vehicular Technology Conference (VTC Spring) . IEEE (Institute of Electrical and Electronics Engineers), I E E E V T S Vehicular Technology Conference. Proceedings, pp. 1-5, IEEE Vehicular Technology Conference Spring 2018, 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 et al.
2018 IEEE 87th Vehicular Technology Conference (VTC Spring) . IEEE (Institute of Electrical and Electronics Engineers), 2018. p. 1-5 (I E E E V T S Vehicular Technology Conference. Proceedings).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-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

T3 - I E E E V T S Vehicular Technology Conference. Proceedings

SP - 1

EP - 5

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

PB - IEEE (Institute of Electrical and Electronics Engineers)

T2 - IEEE Vehicular Technology Conference Spring 2018

Y2 - 3 June 2018 through 6 June 2018

ER -

On Superregular Matrices and Convolutional Codes with Finite Decoder Memory

Abstract

Conference

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this