Calculating a branch metric for received scrambled code bits

A chunk of branch metric computation bits (290A,290B) is generated comprising bits that correspond to transition bits of a possible chunk of transition bits that could have been generated by a state transition of a convolutional encoder of a transmitter. The computation bits (290A,290B) are scramble...

Full description

Saved in:
Bibliographic Details
Main Authors ROY SKOVGAARD HANSEN, ESKO JUHANI NIEMINEN
Format Patent
LanguageEnglish
Published 16.10.2013
Subjects
BASIC ELECTRONIC CIRCUITRY
CODE CONVERSION IN GENERAL
CODING
DECODING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary:A chunk of branch metric computation bits (290A,290B) is generated comprising bits that correspond to transition bits of a possible chunk of transition bits that could have been generated by a state transition of a convolutional encoder of a transmitter. The computation bits (290A,290B) are scrambled (280A,280B;310A,310B). A branch metric for the received soft scrambled code bits (270A,270B) is calculated as a function of the scrambled bits (300A,300B) of the computation bits and the received code bits (270A,270B). The branch metric is indicative of the probability that the received code bits (270A,270B) was originally generated by the convolutional encoder as the chunk of transition bits corresponding to the generated computation bits (290A,290B). The generated computation bits are scrambled instead of descrambling the received soft scrambled bits, which requires more processing and hence higher power consumption.
Bibliography:Application Number: GB20120006389