Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/24662
Title: Faster Decoding of rank metric convolutional codes
Author: Napp, Diego
Pinto, Raquel
Rosenthal, Joachim
Vettori, Paolo
Keywords: Convolutional codes
Rank metric
Issue Date: Jul-2018
Abstract: A new construction of maximum rank distance systematic rank metric convolutional codes is presented, which permits to reduce the computational complexity of the decoding procedure, i.e., of the underlying Viterbi algorithm. This result is achieved by lowering the number of branch metrics to be calculated and by setting to the highest value the metric of the remaining edges in the trellis.
Peer review: yes
URI: http://hdl.handle.net/10773/24662
Publisher Version: http://mtns2018.ust.hk/media/files/0071.pdf
Appears in Collections:CIDMA - Comunicações

Files in This Item:
File Description SizeFormat 
MTNS18_0071.pdf186.64 kBAdobe PDFView/Open


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.