Abstract: A method and apparatus for multicasting of a multi-packet message are disclosed. Data to be transmitted as a message are divided into N sets, each set being encoded to generate encoded data. A set of parity bits is separated from each of the N sets of encoded data. The N sets of separated parity bits are encoded by a systematic code with a predetermined distance S across the N sets, resulting in N? parity-bit packets. The N? parity-bit packets are encoded with a code that is selected so that each receiving station decodes the N? parity-bit packets with a high probability. The N-packet message, comprising the N sets of encoded data less the separated bits, and the N? packets are multicasted. If less than S packets of the N-packet message fail to decode at a receiving station, the receiving station recovers all N packets using the N? packets.

Abstract: A system involves a first SerDes link from a first integrated circuit (IC) to a second IC and a second link from the second IC to the first IC. Power consumption settings in circuitry of the first link are adjusted to control power consumption such that the bit error rate of the first link is maintained in a range, where the lower bound of the range is substantially greater than zero. Power consumption settings in circuitry for the second link are adjusted to control power consumption such that the bit error rate of the second link is maintained in range, where the lower bound of the range is substantially greater than zero. In one example, circuitry in the second IC detects errors in the first link and reports back via the second link. The first IC uses the reported information to determine a bit error rate for the first link.

Abstract: Methods and apparatuses for enhanced processing of received channels in a mobile communications system is described. Particularly, convolutionally encoded tail biting data in a mobile communications system is efficiently decoding by replicating the received encoded signal N times, where N equals a number of iterations. A Viterbi decoding algorithm is applied and a most likely survivor path is obtained. The ensuing decoding window is set as a fixed decoding window and placed at a mid-section of the most likely survivor path. Simulations have shown codeword accuracy to be comparable to MLSE with less complexity. A high degree of accuracy has been obtained for N=3.

Abstract: A system involves a first SerDes link from a first integrated circuit (IC) to a second IC and a second link from the second IC to the first IC. Power consumption settings in circuitry of the first link are adjusted to control power consumption such that the bit error rate of the first link is maintained in a range, where the lower bound of the range is substantially greater than zero. Power consumption settings in circuitry for the second link are adjusted to control power consumption such that the bit error rate of the second link is maintained in range, where the lower bound of the range is substantially greater than zero. In one example, circuitry in the second IC detects errors in the first link and reports back via the second link. The first IC uses the reported information to determine a bit error rate for the first link.

Abstract: Methods and apparatuses for enhanced processing of received channels in a mobile communications system is described. Particularly, convolutionally encoded tail biting data in a mobile communications system is efficiently decoding by replicating the received encoded signal N times, where N equals a number of iterations. A Viterbi decoding algorithm is applied and a most likely survivor path is obtained. The ensuing decoding window is set as a fixed decoding window and placed at a mid-section of the most likely survivor path. Simulations have shown codeword accuracy to be comparable to MLSE with less complexity. A high degree of accuracy has been obtained for N=3.

Abstract: A Method and System for Utilization of an Outer Decoder in a Broadcast Services Communication System is described. An outer decoder and an inner decoder encode a block of information to be transmitted, to improve protection by adding redundancy. The redundancy permits decoding of the information from less than a complete encoded block of information. Consequently, the receiving station determines when sufficient amount of information for successful decoding has been received, and utilizes the time remaining before the next block of information arrives to perform other activities, e.g., hard handoff on a broadcast channel, inter-frequency hard handoff, and other activities. Alternatively, the receiving station can cease reception, thus decrease power consumption. Furthermore, part of the information block may be utilized for transmission of signaling information.

Abstract: In a communication system 10, a method and apparatus provide for decoding a sequence of turbo encoded data symbols. The channel nodes Rx, Ry and Rz are updated based on a received channel output, and the outgoing messages from symbol nodes (701, 707, 708) are initialized. The symbol nodes symbol nodes (701, 707, 708) are in communication with the channel nodes Rx, Ry and Rz. Updates of computational nodes C (704) and D (706) at different time instances are performed in accordance with a triggering schedule.

Abstract: Techniques for efficiently performing erasure-and-single-error correction block decoding on a received block of symbols previously coded column-wise with an (N, K) linear block code and row-wise with an error detection code (e.g., a CRC code). Initially, each row of the received block is marked as either an erased row or an un-erased row. To perform erasure-and-single-error correction block decoding on the received block, a codeword corresponding to a column of the received block containing an undetected symbol error is initially identified. The location of the symbol error in the codeword is then determined based on a particular block decoding scheme and corresponding to the selected (N, K) block code. The row of the received block containing the symbol error is then marked as an erased row. Block decoding may then be performed for the received block with the newly marked erased row containing the symbol error.

Abstract: A decoding method and apparatus include providing capability for decoding data symbols that were encoded in a transmitter by either a serial-concatenated code or turbo code in a parallel processing fashion. The receiver upon knowing the encoding method may reconfigure the selection of data symbols from a table to accommodate the appropriate decoding process. Initially a data symbol estimate for a number of data symbols of a plurality of data symbols Xi, Yi, and Wi are determined. The estimates of data symbols Xi, Yi, and Wi passing to a first and second decision nodes include estimates for the variables in one or more encoding equations. A new estimate for the data symbol Xi is determined based on the estimate determined at the initial step and the new estimate for each occurrence of the data symbol Xi at the first and second decision nodes.

Abstract: In an orthogonal frequency division multiplexing (OFDM) system which uses an outer Reed-Solomon encoder and interleaver an inner convolutional encoder, after the inner convolutional encoding the data bits are interleaved, and then grouped into symbols, each symbol having “m” bits. After grouping, the symbols are mapped to a complex plane using quadrature amplitude modulation (QAM). Thus, bits, not symbols, are interleaved by the inner interleaver. A receiver performs a soft decision regarding the value of each bit in each complex QAM symbol received.

Abstract: A decoding method and apparatus include providing capability for decoding data symbols that were encoded in a transmitter by either a serial-concatenated code or turbo code in a parallel processing fashion. The receiver upon knowing the encoding method may reconfigure the selection of data symbols from a table to accommodate the appropriate decoding process. Initially a data symbol estimate for a number of data symbols of a plurality of data symbols Xi, Yi, and Wi are determined. The estimates of data symbols Xi, Yi, and Wi passing to a first and second decision nodes include estimates for the variables in one or more encoding equations. A new estimate for the data symbol Xi is determined based on the estimate determined at the initial step and the new estimate for each occurrence of the data symbol Xi at the first and second decision nodes.

Abstract: Techniques for efficiently performing erasure-and-single-error correction block decoding on a received block of symbols previously coded column-wise with an (N, K) linear block code and row-wise with an error detection code (e.g., a CRC code). Initially, each row of the received block is marked as either an erased row or an un-erased row. To perform erasure-and-single-error correction block decoding on the received block, a codeword corresponding to a column of the received block containing an undetected symbol error is initially identified. The location of the symbol error in the codeword is then determined based on a particular block decoding scheme and corresponding to the selected (N, K) block code. The row of the received block containing the symbol error is then marked as an erased row. Block decoding may then be performed for the received block with the newly marked erased row containing the symbol error.

Abstract: A decoding method and apparatus include providing capability for decoding data symbols that were encoded in a transmitter by either a serial-concatenated code or turbo code in a parallel processing fashion. The receiver upon knowing the encoding method may reconfigure the selection of data symbols from a table (600) to accommodate the appropriate decoding process. Initially a data symbol estimate for a number of data symbols of a plurality of data symbols Xi, Yi, and Wi are determined. The estimates of data symbols Xi, Yi, and Wi passing to a first and second decision nodes (610, 620) include estimates for the variables in one or more encoding equations. A new estimate for the data symbol Xi is determined based on the estimate determined at the initial step and the new estimate for each occurrence of the data symbol Xi at the first and second decision nodes (610, 620).

Abstract: In a communication system 10, a method and apparatus provide for decoding a sequence of turbo encoded data symbols. The channel nodes Rx, Ry and Rz are updated based on a received channel output, and the outgoing messages from symbol nodes (701, 707, 708) are initialized. The symbol nodes symbol nodes (701, 707, 708) are in communication with the channel nodes Rx, Ry and Rz. Updates of computational nodes C (704) and D (706) at different time instances are performed in accordance with a triggering schedule.

Abstract: A Method and System for Utilization of an Outer Decoder in a Broadcast Services Communication System is described. An outer decoder and an inner decoder encode a block of information to be transmitted, to improve protection by adding redundancy. The redundancy permits decoding of the information from less than a complete encoded block of information. Consequently, the receiving station determines when sufficient amount of information for successful decoding has been received, and utilizes the time remaining before the next block of information arrives to perform other activities, e.g., hard handoff on a broadcast channel, inter-frequency hard handoff, and other activities. Alternatively, the receiving station can cease reception, thus decrease power consumption. Furthermore, part of the information block may be utilized for transmission of signaling information.

Abstract: A method and apparatus for multicasting of a multi-packet message are disclosed. Data to be transmitted as a message are divided into N sets, each set being encoded to generate encoded data. A set of parity bits is separated from each of the N sets of encoded data. The N sets of separated parity bits are encoded by a systematic code with a predetermined distance S across the N sets, resulting in N′ parity-bit packets. The N′ parity-bit packets are encoded with a code that is selected so that each receiving station decodes the N′ parity-bit packets with a high probability. The N-packet message, comprising the N sets of encoded data less the separated bits, and the N′ packets are multicasted. If less than S packets of the N-packet message fail to decode at a receiving station, the receiving station recovers all N packets using the N′ packets.

Abstract: In an orthogonal frequency division multiplexing (OFDM) system which uses an outer Reed-Solomon encoder and interleaver an inner convolutional encoder, after the inner convolutional encoding the data bits are interleaved, and then grouped into symbols, each symbol having “m” bits. After grouping, the symbols are mapped to a complex plane using quadrature amplitude modulation (QAM). Thus, bits, not symbols, are interleaved by the inner interleaver. A receiver performs a soft decision regarding the value of each bit in each complex QAM symbol received.

Abstract: In an orthogonal frequency division multiplexing (OFDM) system which uses an outer Reed-Solomon encoder and interleaver an inner convolutional encoder, after the inner convolutional encoding the data bits are interleaved, and then grouped into symbols, each symbol having “m” bits. After grouping, the symbols are mapped to a complex plane using quadrature amplitude modulation (QAM). Thus, bits, not symbols, are interleaved by the inner interleaver. A receiver performs a soft decision regarding the value of each bit in each complex QAM symbol received.

Abstract: In an orthogonal frequency division multiplexing (OFDM) system which uses an outer Reed-Solomon encoder and interleaver an inner convolutional encoder, after the inner convolutional encoding the data bits are interleaved, and then grouped into symbols, each symbol having "m" bits. After grouping, the symbols are mapped to a complex plane using quadrature amplitude modulation (QAM). Thus, bits, not symbols, are interleaved by the inner interleaver. A receiver performs a soft decision regarding the value of each bit in each complex QAM symbol received.

Abstract: An encoder for encoding data as trellis coded data and a decoder for decoding the trellis coded data. The encoder uses a rate ½ convolutional encoder punctured to a rate k/n to produce n symbols from k input bits. The symbols are converted by a converter to sets of p symbols and provided to an interleaver. In the interleaver certain ones of the symbols are delayed. Symbol sets are output from the interleaver to a 2P-ary modem for modulation and transmission. The decoder uses a modem for providing from the modulated data sets of p symbols. A deinterleaver delays certain ones of the symbols to achieve time alignment of the originally interleaved symbols. The sets of time aligned symbols are provided to metric calculators for computing signal metrics which are provided to a converter for providing n sets of metrics to a metric decoder. The metric decoder computes from the n sets of metrics an estimate of the encoded k data bits.