List Viterbi decoding of tail biting convolutional codes
AssigneeQUALCOMM Incorporated
InventorsRenqiu Wang, Hao Xu, Yongbin Wei, Dung Ngoc Doan
Life of this patent
Estimating the term…
Loading patent…
AssigneeQUALCOMM Incorporated
InventorsRenqiu Wang, Hao Xu, Yongbin Wei, Dung Ngoc Doan
Estimating the term…
A low complexity List Viterbi algorithm (LVA) for decoding tail biting convolutional codes (TBCCs) has lower complexity than a solution of running the LVA algorithm for all states. In one aspect, a low complexity LVA-TBCC process includes finding a list of states from a single Viterbi algorithm and finding a list of potential codewords for each state in the state list using the LVA. A cyclic redundancy check may prune out false solutions. The disclosed method may be applied to many communication systems to improve error performance similar to LTE downlink PBCH decoding enhancements.
A method in a wireless communication system for decoding tail biting convolutional codes (TBCCs) with a List Viterbi algorithm (LVA), the method comprising:
An apparatus configured to operate in a wireless communication system and configured to decode tail biting convolutional codes (TBCCs) with a List Viterbi algorithm (LVA), the apparatus comprising:
A computer program product configured for decoding tail biting convolutional codes (TBCCs) with a List Viterbi algorithm (LVA), the computer program product comprising:
An apparatus configured for decoding tail biting convolutional codes (TBCCs) with a List Viterbi algorithm (LVA), the apparatus comprising:
Dependencies are inferred from the claim text.