Code trellis degeneration using SST (scarce state transition) Viterbi decoding of QLI codes

Masato Tajima

doi:10.1109/isit.1997.613334

ScienceGate Book Chapters

JOURNAL ARTICLE

Code trellis degeneration using SST (scarce state transition) Viterbi decoding of QLI codes

Masato Tajima

Year: 2002 Pages: 397-397

DOI: 10.1109/isit.1997.613334

Get Full-Text PDF Get Analytical Report

Abstract

We show that code trellis degeneration can be realized for SST (scarce state transition) Viterbi decoding of quick look-in (QLI) codes. We consider an AWGN channel with biphase modulation.

Keywords:

Viterbi decoder Decoding methods Computer science Viterbi algorithm Code (set theory) Iterative Viterbi decoding Convolutional code Soft output Viterbi algorithm Trellis (graph) Sequential decoding Algorithm Block code Programming language

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.24

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Cellular Automata and Applications

Physical Sciences → Computer Science → Computational Theory and Mathematics

Error Correcting Code Techniques

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Wireless Communication Techniques

Physical Sciences → Engineering → Electrical and Electronic Engineering

Code trellis degeneration using SST (scarce state transition) Viterbi decoding of QLI codes

Abstract

Metrics

Citation History

Topics

Related Documents

Scarce-state-transition error-trellis decoding of binary block codes

Scarce-state-transition error-trellis decoding ofblock codes with BPSK signals

Scarce-State-Transition Viterbi Decoding of Punctured Convolutional Codes for VLSI Implementation

On the equivalence between scarce-state-transition viterbi decoding and syndrome decoding of convolutional codes

Scarce-state-transition syndrome-former error-trellis decoding of (n,n-1) convolutional codes