2012/08/01 by Fabian Schuh, Schuh, Fabian, Andreas Schenk +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Cellular Automata and Applications #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1208.0193
5 pages, 9 figures, submitted to SCC 13
arxiv created 2012/08/01 · openalex publication_date 2012/08/01 · arxiv updated 2012/08/02 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
Matched decoding is a technique that enables the efficient maximum-likelihood sequence estimation of convolutionally encoded PAM-transmission over ISI-channels. Recently, we have shown that the super-trellis of encoder and channel can be described with significantly fewer states without loss in Euclidean distance, by introducing a non-linear representation of the trellis. This paper extends the matched decoding concept to punctured convolutional codes and introduces a time-variant, non-linear trellis description.