Convolutional decoding with the ending state decided by crc bits placed inside multiple coding bursts

Abstract From the Canadian patent

An improved coding and decoding process is disclosed to determine the ending state of a convolutional decoding using Viterbi algorithm without the use of tail bits. The most important information bits (12) are first coded with a block code (14). The block code word (14) and the rest of the information bits (11) are then split into several bursts (B-Burst). Each burst is coded with a convolutional code. The most important information bit part of the block code word is then placed in the beginning of the code burst for the convolutional encoder. The parity bit part can be placed between the end of the most important information bit part and the end of the code burst. In the …