← Back to Patent Explorer
US5710784A Expired / Lapsed US ⏱️ 0.0 years remaining

Multirate serial viterbi decoder for code division multiple access system applications

Assignee: Qualcomm Inc
•
Filing: 1996-10-09
•
Granted: 1998-01-20
•
Expires: 2016-10-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A Viterbi decoder for recovering the original bit data stream that was convolutionally encoded as a code symbol stream in a Code Division Multiple Access (CDMA) mobile communication system. The decoder simultaneously decodes at the several data rates associated with certain multirate vocoders. The decoder can decode at an unknown data rate in either continuous or framed packet modes. It accomplishes this by simultaneously decoding at multiple rates and by creating one or more data quality metrics for each decoded data packet. Special input and output buffering is provided to isolate the decoder from system timing constraints. The input buffer includes selection and accumulation logic to organize code symbol data into the packet order for repeat mode or random burst mode at lower frame data rates. Decoded data packets for each of several predetermined data transfer rates are held in an output buffer for about half of the decoding cycle, thereby permitting the system microprocessor to examine and select the appropriate decoded data packet. The decoder also can be reconfigured to operate at any one of several predetermined convolutional encoding algorithms. The Viterbi decoder, implemented as a single monolithic integrated circuit, can be used in any and all of many different multiuser telecommunications channels.

Inventors

  • 👤 Daniel Ray Kindred
  • 👤 Brian K. Butler
  • 👤 Ephraim Zehavi
  • 👤 Jack Keil Wolf

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 13:11
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/3776; H04; H04L; H04L25/00; H04L25/02; H03M13/39; H03M13/41; H04B; H04B1/00; H04B1/69; H04B1/707; H04L1/00; H04L1/0001; H04L1/0009; H04L1/004; H04L1/0045; H04L1/0046; H04L1/0052; H04L1/0054; H04L1/0056; H04L1/0071; H04L1/08; H04L1/20; H04L1/208; H04L25/0262; H04B2201/00; H04B2201/69; H04B2201/707; H04B2201/70703; H04L1/0023; H04L1/0032; H04L25/03; H04L25/03006; H04L25/03178

Claims Analysis

Total Claims: 67
Claim 1
Independent Claim 279 words
A method of providing decoded bit data in response to a transmission of code symbol data which represents original bit data having a data rate R i , where R i is one data rate of two or more predetermined original bit data rates, the method being executable using a decoder apparatus including an input buffer, a convolutional decoder, and an output buffer, the method including the steps of: transmitting said code symbol data in frames of predetermined time duration wherein the transition between each said successive frame of said code symbol data is forced to a predetermined state; receiving and storing successive portions of said transmission of said code symbol data in said input buffer; and decoding any portion of said successive portions in said convolutional decoder in two or more passes to obtain two or more rackets {P i } of decoded bit data, each packet P i being decoded during a respective pass of said two or more passes, each packet P i including: decoded bit data I i corresponding to original bit data having said data rate R i ; and quality metric data Q i representing symbol error conditions in said any portion and data error conditions in said decoded bit data; and storing said two or more packets in said output buffer, wherein said quality metric data Q i representing data error conditions in each said frame of said decoded bit data includes: a Quality Metric (QM) representing the results of a comparison between a predetermined Quality Threshold (QT) value and a measure of the probability of decoding said zero state at said each transition between successive frames of said decoded bit data.
Claim 2
Independent Claim 279 words
A method of providing decoded bit data in response to a transmission of code symbol data which represents original bit data having a data rate R i , where R i is one data rate of two or more predetermined original bit data rates, the method being executable using a decoder apparatus including an input buffer, a convolutional decoder, and an output buffer, the method including the steps of: transmitting said code symbol data in frames of predetermined time duration wherein the transition between each said successive frame of said code symbol data is forced to a predetermined state; receiving and storing successive portions of said transmission of said code symbol data in said input buffer; and decoding any portion of said successive portions in said convolutional decoder in two or more passes to obtain two or more rackets {P i } of decoded bit data, each packet P i being decoded during a respective pass of said two or more passes, each packet P i including: decoded bit data I i corresponding to original bit data having said data rate R i ; and quality metric data Q i representing symbol error conditions in said any portion and data error conditions in said decoded bit data; and storing said two or more packets in said output buffer, wherein said quality metric data Q i representing data error conditions in each said frame of said decoded bit data includes: a Quality Metric (QM) representing the results of a comparison between a predetermined Quality Threshold (QT) value and a measure of the probability of decoding said zero state at said each transition between successive frames of said decoded bit data.
Claim 3
Independent Claim 322 words
A method of providing decoded bit data in response to a transmission of code symbol data which represents original bit data having a data rate R i , where R i is one data rate of two or more predetermined original bit data rates, the method being executable using a decoder apparatus including an input buffer, a convolutional decoder, and an output buffer, the method including the steps of: transmitting said code symbol data in frames of predetermined time duration wherein the transition between each said successive frame of said code symbol data is forced to a predetermined state; receiving and storing successive portions of said transmission of said code symbol data in said input buffer; and decoding any portion of said successive portions in said convolutional decoder in two or more passes to obtain two or more packets {P i } of decoded bit data, each packet P i being decoded during a respective pass of said two or more passes, each packet P i including: decoded bit data I i corresponding to original bit data having said data rate R i ; and quality metric data Q i representing symbol error conditions in said any portion and data error conditions in said decoded bit data; and storing said two or more packets in said output buffer, wherein said code symbol data representing said original bit data encoded according to a coding algorithm, the method further including the steps of recoding each of said at least two decoded bit data packets {P i } according to said coding algorithm to create a packet of local code symbol data (L i ); comparing said code symbol data with each of said at least two local code symbol data packets {L i } to produce a qualitative measure (Q i ) of the number of differences there between; and storing at least two qualitative measures {Q i } in said output data buffer.
Claim 4
Independent Claim 322 words
A method of providing decoded bit data in response to a transmission of code symbol data which represents original bit data having a data rate R i , where R i is one data rate of two or more predetermined original bit data rates, the method being executable using a decoder apparatus including an input buffer, a convolutional decoder, and an output buffer, the method including the steps of: transmitting said code symbol data in frames of predetermined time duration wherein the transition between each said successive frame of said code symbol data is forced to a predetermined state; receiving and storing successive portions of said transmission of said code symbol data in said input buffer; and decoding any portion of said successive portions in said convolutional decoder in two or more passes to obtain two or more packets {P i } of decoded bit data, each packet P i being decoded during a respective pass of said two or more passes, each packet P i including: decoded bit data I i corresponding to original bit data having said data rate R i ; and quality metric data Q i representing symbol error conditions in said any portion and data error conditions in said decoded bit data; and storing said two or more packets in said output buffer, wherein said code symbol data representing said original bit data encoded according to a coding algorithm, the method further including the steps of recoding each of said at least two decoded bit data packets {P i } according to said coding algorithm to create a packet of local code symbol data (L i ); comparing said code symbol data with each of said at least two local code symbol data packets {L i } to produce a qualitative measure (Q i ) of the number of differences there between; and storing at least two qualitative measures {Q i } in said output data buffer.
Claim 5
Independent Claim 290 words
A method of providing decoded bit data in response to a transmission of code symbol data which represents original bit data having a data rate R i , where R i is one data rate of two or more predetermined original bit data rates, the method being executable using a decoder apparatus including an input buffer, a convolutional decoder, and an output buffer, the method including the steps of: transmitting said code symbol data in frames of predetermined time duration wherein the transition between each said successive frame of said code symbol data is forced to a predetermined state; receiving and storing successive portions of said transmission of said code symbol data in said input buffer; and decoding any portion of said successive portions in said convolutional decoder in two or more passes to obtain two or more packets {P i } of decoded bit data, each packet P i being decoded during a respective pass of said two or more passes, each packet P i including: decoded bit data I i corresponding to original bit data having said data rate R i ; and quality metric data Q i representing symbol error conditions in said any portion and data error conditions in said decoded bit data; and storing said two or more packets in said output buffer, wherein frames of data having a first bit data rate include packets of encoded data bits, each packet including cyclic redundancy check bits, the method comprising the additional unordered steps of: determining an error rate for said packets of data bits using said cyclic redundancy check bits; producing a qualitative measure (Q i ) indicating said error rate; and storing at least two qualitative measures {Q i } in said output buffer.
Claim 6
Independent Claim 290 words
A method of providing decoded bit data in response to a transmission of code symbol data which represents original bit data having a data rate R i , where R i is one data rate of two or more predetermined original bit data rates, the method being executable using a decoder apparatus including an input buffer, a convolutional decoder, and an output buffer, the method including the steps of: transmitting said code symbol data in frames of predetermined time duration wherein the transition between each said successive frame of said code symbol data is forced to a predetermined state; receiving and storing successive portions of said transmission of said code symbol data in said input buffer; and decoding any portion of said successive portions in said convolutional decoder in two or more passes to obtain two or more packets {P i } of decoded bit data, each packet P i being decoded during a respective pass of said two or more passes, each packet P i including: decoded bit data I i corresponding to original bit data having said data rate R i ; and quality metric data Q i representing symbol error conditions in said any portion and data error conditions in said decoded bit data; and storing said two or more packets in said output buffer, wherein frames of data having a first bit data rate include packets of encoded data bits, each packet including cyclic redundancy check bits, the method comprising the additional unordered steps of: determining an error rate for said packets of data bits using said cyclic redundancy check bits; producing a qualitative measure (Q i ) indicating said error rate; and storing at least two qualitative measures {Q i } in said output buffer.
Claim 7
Dependent Claim 261 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, a method for decoding said code symbol data comprising the steps of: (a) receiving and storing code symbol data in an input data buffer; (b) decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of said decoded bit data corresponding to a respective one of at least two of said first plurality of predetermined original bit data rates {R i }; and (c) storing said at least two decoded bit data packets {P i } in an output data buffer; (d) recoding each of said at least two decoded bit data packets {P i } according to said first coding algorithm to create a packet of local code symbol data (L i ); (e) comparing said code symbol data with each of said at least two local code symbol data packets {L i } to create a qualitative measure (Q i ) of the number of differences therebetween; and (f) storing each of said at least two qualitative measures {Q i } in said output data buffer.
Claim 8
Dependent Claim 261 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, a method for decoding said code symbol data comprising the steps of: (a) receiving and storing code symbol data in an input data buffer; (b) decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of said decoded bit data corresponding to a respective one of at least two of said first plurality of predetermined original bit data rates {R i }; and (c) storing said at least two decoded bit data packets {P i } in an output data buffer; (d) recoding each of said at least two decoded bit data packets {P i } according to said first coding algorithm to create a packet of local code symbol data (L i ); (e) comparing said code symbol data with each of said at least two local code symbol data packets {L i } to create a qualitative measure (Q i ) of the number of differences therebetween; and (f) storing each of said at least two qualitative measures {Q i } in said output data buffer.
Claim 9
Dependent Claim 161 words
The method of claim 4 wherein said sequential decoding step (b) comprises the steps of: (b.1) assigning at least one symbol metric value to each of said code symbol data in accordance with a second coding algorithm; (b.2) assigning branch metric values representing the original data bit transition probability corresponding to each said code symbol datum in accordance with selected ones of said symbol metric values; (b.3) assigning state metric values representing the original data bit transition probability corresponding to said code symbol datum in accordance with the sum of the most probably preceding said state metric value and said branch metric value therefrom; (b.4) storing said state metric values in a path memory; and (b.5) selecting the most probable value for each said original data bit in accordance with the most probable said state metric value corresponding to a decision path chain preceding the most probable said state metric value corresponding to said each code symbol in said path memory.
Claim 10
Dependent Claim 42 words
The method of claim 5 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 11
Dependent Claim 47 words
The method of claim 5 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 12
Dependent Claim 159 words
The method of claim 4 wherein said decoding step (b) comprises the steps of: (b.1) assigning at least one symbol metric value to each of said code symbol data in accordance with a second coding algorithm; (b.2) assigning branch metric values representing the original data bit transition probability corresponding to each said code symbol datum in accordance with selected ones of said symbol metric values; (b.3) assigning state metric values representing the original data bit transition probability corresponding to said code symbol datum in accordance with the sum of the most probably preceding said state metric value and said branch metric value therefrom; (b.4) storing said state metric values in a path memory; and (b.5) selecting the most probable value for each said original data bit in accordance with the most probable state metric value corresponding to a decision path chain preceding the most probable said state metric value corresponding to said each code symbol in said path memory.
Claim 13
Dependent Claim 42 words
The method of claim 8 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 14
Dependent Claim 47 words
The method of claim 8 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 15
Dependent Claim 42 words
The method of claim 4 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 16
Dependent Claim 47 words
The method of claim 4 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 17
Dependent Claim 42 words
The method of claim 4 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 18
Dependent Claim 47 words
The method of claim 4 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 19
Dependent Claim 474 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means couvled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said decoder means comprises: symbol metric means for assigning a symbol metric value to each said code symbol in accordance with a second coding algorithm; branch metric calculator means coupled to said symbol metric means for creating a pair of branch metric values representing the weighted probability for an original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said symbol metric value; decision path means coupled to said branch metric calculator means for creating and storing a state metric decision value for each possible original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said branch metric values; and path chain-back means coupled to said decision path means for selecting the most probable decision path for each said original data bit transition and for creating a corresponding said decoded data bit.
Claim 20
Dependent Claim 474 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means couvled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said decoder means comprises: symbol metric means for assigning a symbol metric value to each said code symbol in accordance with a second coding algorithm; branch metric calculator means coupled to said symbol metric means for creating a pair of branch metric values representing the weighted probability for an original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said symbol metric value; decision path means coupled to said branch metric calculator means for creating and storing a state metric decision value for each possible original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said branch metric values; and path chain-back means coupled to said decision path means for selecting the most probable decision path for each said original data bit transition and for creating a corresponding said decoded data bit.
Claim 21
Dependent Claim 336 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said multirate decoder is embodied essentially in a single monolithic integrated circuit.
Claim 22
Dependent Claim 336 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said multirate decoder is embodied essentially in a single monolithic integrated circuit.
Claim 23
Dependent Claim 276 words
A multi rate decoder for decoding code symbol data received at an input to yield decoded bit data at an output, where said code symbol data represent original bit data according to a first coding algorithm, said code symbol data being transmitted at a rate equivalent to one of a first plurality of predetermined original bit data rates {R i }, wherein said code symbol data comprises a representation of said original bit data according to a first coding algorithm when said original bit rate is a predetermined maximum and wherein said code symbol data represents a first version and (N i -1) repeated versions of coded original bit data, where N i and i are non-zero positive integers, said multirate sequential decoder comprising: input buffer means coupled to said input for accepting and storing code symbol data; decoder means coupled to said input buffer means for decoding said code symbol in at least two passes to create, in each pass a packet (P i ) of said decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said output and to said sequential decoder means for storing said at least two decoded bit data packets {P i }; first selection means coupled to said input buffer means for selecting one of a plurality of decoding modes each corresponding to a different said first coding algorithm; and second selection means coupled to said input buffer means for selecting one of said first and second channel modes corresponding to continuous and framed original bit data.
Claim 24
Dependent Claim 276 words
A multi rate decoder for decoding code symbol data received at an input to yield decoded bit data at an output, where said code symbol data represent original bit data according to a first coding algorithm, said code symbol data being transmitted at a rate equivalent to one of a first plurality of predetermined original bit data rates {R i }, wherein said code symbol data comprises a representation of said original bit data according to a first coding algorithm when said original bit rate is a predetermined maximum and wherein said code symbol data represents a first version and (N i -1) repeated versions of coded original bit data, where N i and i are non-zero positive integers, said multirate sequential decoder comprising: input buffer means coupled to said input for accepting and storing code symbol data; decoder means coupled to said input buffer means for decoding said code symbol in at least two passes to create, in each pass a packet (P i ) of said decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said output and to said sequential decoder means for storing said at least two decoded bit data packets {P i }; first selection means coupled to said input buffer means for selecting one of a plurality of decoding modes each corresponding to a different said first coding algorithm; and second selection means coupled to said input buffer means for selecting one of said first and second channel modes corresponding to continuous and framed original bit data.
Claim 25
Dependent Claim 67 words
The multirate decoder of claim 17 further comprising: symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means.
Claim 26
Dependent Claim 42 words
The method of claim 18 wherein said code symbol data provided to aid input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 27
Dependent Claim 47 words
The method of claim 18 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 28
Dependent Claim 53 words
The multirate decoder of claim 18 further comprising: quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) symbol data errors associated with said each decoded data bit packet (P i ).
Claim 29
Dependent Claim 87 words
The multirate decoder of claim 21 wherein said quality metric means comprises: data recoder means for recoding each of said at least two decoded bit data packets {P i } according to said first coding algorithm to create a packet of local code symbol data (L i ); and comparison means coupled to said data recoder means for comparing each said local code symbol data packet (L i ) with each said code symbol data set (S i ) and for counting the number of differences therebetween.
Claim 30
Dependent Claim 42 words
The method of claim 21 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 31
Dependent Claim 47 words
The method of claim 21 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 32
Dependent Claim 157 words
The multirate decoder of claim 22 wherein said decoder means comprises: symbol metric means for assigning a symbol metric value to each said code symbol in accordance with a second coding algorithm; branch metric calculator means coupled to said symbol metric means for creating a pair of branch metric values representing the weighted probability for an original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said symbol metric value; decision path means coupled to said branch metric calculator means for creating and storing a state metric decision value for each possible original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said branch metric values; and path chain-back means coupled to said decision path means for selecting the most probable decision path for each said original data bit transition and for creating a corresponding said decoded data bit.
Claim 33
Dependent Claim 42 words
The method of claim 22 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 34
Dependent Claim 47 words
The method of claim 22 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 35
Dependent Claim 14 words
The multirate decoder of claim 25 embodied essentially in a single monolithic integrated circuit.
Claim 36
Dependent Claim 42 words
The method of claim 25 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 37
Dependent Claim 47 words
The method of claim 25 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 38
Dependent Claim 47 words
The method of claim 17 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 39
Dependent Claim 42 words
The method of claim 28 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 40
Dependent Claim 47 words
The method of claim 28 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 41
Dependent Claim 54 words
The multirate decoder of claim 17 further comprising: quality metric means in said sequential decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) symbol data errors associated with said each decoded data bit packet (P i ).
Claim 42
Dependent Claim 87 words
The multirate decoder of claim 34 wherein said quality metric means comprises: data recoder means for recoding each of said at least two decoded bit data packets {P i } according to said first coding algorithm to create a packet of local code symbol data (L i ); and comparison means coupled to said data recoder means for comparing each said local code symbol data packet (L i ) with each said code symbol data set (S i ) and for counting the number of differences therebetween.
Claim 43
Dependent Claim 42 words
The method of claim 34 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 44
Dependent Claim 47 words
The method of claim 34 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 45
Dependent Claim 42 words
The method of claim 35 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 46
Dependent Claim 47 words
The method of claim 35 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 47
Dependent Claim 157 words
The multirate decoder of claim 17 wherein said decoder means comprises: symbol metric means for assigning a symbol metric value to each said code symbol in accordance with a second coding algorithm; branch metric calculator means coupled to said symbol metric means for creating a pair of branch metric values representing the weighted probability for an original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said symbol metric value; decision path means coupled to said branch metric calculator means for creating and storing a state metric decision value for each possible original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said branch metric values; and path chain-back means coupled to said decision path means for selecting the most probable decision path for each said original data bit transition and for creating a corresponding said decoded data bit.
Claim 48
Dependent Claim 14 words
The multirate decoder of claim 17 embodied essentially in a single monolithic integrated circuit.
Claim 49
Dependent Claim 42 words
The method of claim 17 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 50
Dependent Claim 404 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said quality metric means comprises: data recoder means for recoding each of said at least two decoded bit data packets {P i } according to said first coding algorithm to create a packet of local code symbol data (L i ); and comparison means coupled to said data recoder means for comparing each said local code symbol data packet (L i ) with each said code symbol data set (S i ) and for counting the number of differences therebetween.
Claim 51
Dependent Claim 404 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said quality metric means comprises: data recoder means for recoding each of said at least two decoded bit data packets {P i } according to said first coding algorithm to create a packet of local code symbol data (L i ); and comparison means coupled to said data recoder means for comparing each said local code symbol data packet (L i ) with each said code symbol data set (S i ) and for counting the number of differences therebetween.
Claim 52
Dependent Claim 157 words
The multirate decoder of claim 43 wherein said decoder means comprises: symbol metric means for assigning a symbol metric value to each said code symbol in accordance with a second coding algorithm; branch metric calculator means coupled to said symbol metric means for creating a pair of branch metric values representing the weighted probability for an original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said symbol metric value; decision path means coupled to said branch metric calculator means for creating and storing a state metric decision value for each possible original data bit transition corresponding to said each code symbol from said input buffer means, responsive to the corresponding said branch metric values; and path chain-back means coupled to said decision path means for selecting the most probable decision path for each said original data bit transition and for creating a corresponding said decoded data bit.
Claim 53
Dependent Claim 42 words
The method of claim 44 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 54
Dependent Claim 47 words
The method of claim 44 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 55
Dependent Claim 14 words
The multirate decoder of claim 44 embodied essentially in a single monolithic integrated circuit.
Claim 56
Dependent Claim 42 words
The method of claim 47 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated version of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 57
Dependent Claim 53 words
The multirate decoder of claim 43 further comprising: quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) symbol data errors associated with said each decoded data bit packet (P i ).
Claim 58
Dependent Claim 87 words
The multirate decoder of claim 49 wherein said quality metric means comprises: data recoder means for receding each of said at least two decoded bit data packets (P i ) according to said first coding algorithm to create a packet of local code symbol data (L i ); and comparison means coupled to said data recoder means for comparing each said local code symbol data packet (L i ) with each said code symbol data set (S i ) and for counting the number of differences therebetween.
Claim 59
Dependent Claim 42 words
The method of claim 50 wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 60
Dependent Claim 47 words
The method of claim 50 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 61
Dependent Claim 47 words
The method of claim 43 wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 62
Dependent Claim 360 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 63
Dependent Claim 360 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein said code symbol data provided to said input buffer comprises a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate.
Claim 64
Dependent Claim 365 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 65
Dependent Claim 365 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output, said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 66
Dependent Claim 365 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality, metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.
Claim 67
Dependent Claim 365 words
In a communication system in which original bit data, provided at one of a first plurality of predetermined original bit data rates {R i }, is encoded to provide code symbol data, and wherein said code symbol data is provided in frames comprising a first version and (N i -1) repeated versions of code symbol data when said original bit rate is less than a predetermined maximum data rate and wherein said frames comprise said first version of said coded symbol data when said original bit rate is said predetermined maximum data rate, wherein a multirate decoder for creating decoded bit data corresponding to said first version of said coded original bit data at an output said multirate decoder comprising: input buffer means for accepting and storing said code symbol data; decoder means coupled to said input buffer means for decoding said code symbol data in at least two passes to create in each pass a packet (P i ) of decoded bit data corresponding to a respective one of at least two said predetermined original bit data rates {R i } responsive to said code symbol data; output buffer means coupled to said sequential decoder means for storing said at least two packets {P i } of said decoded bit data; symbol transfer means in said input buffer means for selecting a set (S i ) of said code symbol data corresponding to said first version of said coded original bit data for each of at least two of said predetermined original bit data rates {R i } and for transferring said set (S i ) to said sequential decoder means; and quality, metric means in said decoder means for creating a quality measure (Q i ) for each said decoded bit data packet (P i ), said quality measure (Q i ) representing the number of code symbol data errors associated with said each decoded data bit packet (P i ), wherein ones of the first version of said coded symbol data and said (N-1) repeated versions of said coded symbol data are deleted to provide to said input buffer said code symbol data containing one remaining version of said coded symbol data.

References Cited (Backward Citations)

US4748626A Cited
US4845714A Cited
US5023889A Cited
US5056117A Cited
US5416787A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-01-19 2001-07-21 2002-01-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-01-19 2005-07-21 2006-01-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-01-19 2009-07-21 2010-01-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag