System, method and apparatus for tail biting convolutional code decoding
AssigneeIntel Corporation
InventorsTzahi Weisman, Tom Harel
Life of this patent
Estimating the term…
Abstract
Techniques to decode tail biting convolutional code are disclosed. A plurality of sets for a trellis may be determined. Each set may include a first stage and a second stage of the trellis. Path metrics for each state in a set may be determined when the first stage and the second stage have a same state. The path metrics may be compared to determine a state with a minimum path metric. Bits from the state with the minimum path metric may be output. Other embodiments are described and claimed.
Claims20
A method performed by a wireless transceiver, comprising:
- receiving a message via a receiver;
- decoding the message via a decoder by:
- determining a plurality of sets for a trellis of a convolutional code in the message, each set comprising a first stage and a second stage of the trellis;
- determining path metrics for each state in a set when the first stage and the second stage have a same state;
- comparing the path metrics to determine a state with a minimum path metric;
- and
- outputting bits from the state with the minimum path metric.
An article comprising a storage medium containing instructions that when executed enable a system to:
- determine, via a decoder for a receiver, a plurality of sets for a trellis, each set comprising a first stage and a second stage of length N, wherein N is a length of the message;
- determine path metrics for each state in a set when a state of the first stage equals a state of the second stage;
- compare, via the decoder, the path metrics to determine a state with a minimum path metric;
- and
- output bits by tracing back from the state of the minimum path metric.
An apparatus, comprising:
- a processor;
- and
- a receiver to receive a message, the receiver having a decoder that when executed by the processor is operative to determine multiple sets of a trellis diagram for a convolutional code in the message, each set having a different first state and second state, determine a path metric for each state in the multiple sets when a state is tail biting, determine a state with a minimum path metric from the path metrics, and output bits from the state of the minimum path metric.
Dependencies are inferred from the claim text.