Abstract: A communications device includes a phase and frequency tracking loop having a signal input and adjustable loop filter that establishes a predetermined tracking loop bandwidth for samples of communication signals received at the signal input and processed within the tracking loop. A tracking loop update circuit updates the loop filter operating parameters. It is operative with the loop filter for increasing or decreasing the tracking loop bandwidth of the phase and frequency tracking loop based on the measured signal-to-noise ratio in the received samples of communication signals at the signal output by the tracking loop and on the known or measured apriori tracking capabilities of demodulator based on the symbol rate of communication signal.

Abstract: A receiver receives an inter-symbol correlated (ISC) signal with information symbols and a corresponding parity symbol. Values of information symbols are estimated utilizing parity samples that are generated from the parity symbols. One or more maximum likelihood (ML) decoding metrics are generated for the information symbols. One or more estimations are generated for the information symbols based on the one or more ML decoding metrics. A parity metric is generated for each of the one or more generated estimations of the information symbols. The parity metric is generated by summing a plurality of values of one of the generated estimations to generate a sum, and wrapping the sum to obtain a parity check value that is within the boundaries of a symbol constellation utilized in generating the information symbols.

Abstract: An embodiment of an arrangement detects sequences of digitally modulated symbols from multiple sources. The arrangement identifies a suitable set of candidate values for at least one transmitted sequence of symbols and determines for each candidate value a set of sequences of transmitted symbols. The arrangement estimates at least one further set of sequences of transmitted symbols, calculates a metric for each sequence of transmitted symbols, and selects the sequence that maximizes the metric. At the end, a-posteriori bit soft output information for the selected sequence is calculated from the metrics for said sequences. Generally, these calculations are based on the information coming from a channel-state-information matrix and a-priori information on the modulated symbols from a second module, such as a forward error-correction-code (ECC) decoder.

Abstract: Disclosed is a method and apparatus for composing a received symbol signal modulated with a bit reflected Gray code into bit information. According to an embodiment of the present invention, a positive integer of the received symbol signal having bits is assigned according to the Gray mapping rule, and a sign is determined. A value that is indicative of an arrangement of the bits constituting the received symbol signal is calculated. A boundary value in at least one bit group consisting of the bits constituting the received symbol signal is acquired, and a difference from an absolute value of the received symbol signal is calculated. The received symbol signal is converted into information per bit using a value of the received symbol signal based on the positive integer and the determined sign, the value that is indicative of the bit arrangement, and the difference from the absolute value.

Abstract: An apparatus for trellis-based detection in a communication system including a processor and memory having computer program code configured to construct a trellis representing a transmitted signal formed from a plurality of symbols, each having a constellation size, transmitted by a number of transmit antennas, and form a log likelihood ratio at nodes of the trellis as a log-sum of a number of exponential terms corresponding to a hypothesized transmitted bit value of the plurality of symbols. The number of exponential terms is limited by a number of most likely paths of the trellis extending from each node of the trellis and the constellation size. The processor and memory including computer program code are further configured to form a list at each node of the trellis of a size limited to the number of the most likely paths of the trellis extending from each node of the trellis.

Abstract: Teachings presented herein offer the performance advantages of sequence estimation for received signal symbol detection, while simultaneously providing potentially significant reductions in computational overhead. Initial demodulation of a received signal identifies a reduced number of candidate symbol values for all or a subset of a sequence of symbols represented in a received signal. A sequence estimation process, e.g., an MLSE process, constrains its state spaces to the reduced number of candidate symbols values, rather than considering all possible symbol values.

Abstract: A method for operating a Viterbi decoder uses few data move operations to improve efficiency. The Viterbi decoder predicts a state in which the convolution encoder might have operated while generating a convolutionally encoded data stream. The Viterbi decoder maintains a first set of states and based on the received convolutionally encoded data stream, predicts second and third sets of states. The Viterbi decoder then calculates first and second sets of decision bits based on the transitions to the second and third sets of states. Path metric values associated with the third set of states are stored in a memory buffer. Thereafter, during trace-back, the Viterbi decoder extracts first and second decoded bits from first and second sets of decision bits respectively.

Abstract: Certain embodiments provide methods that may allow for improvements in performance and power consumption by terminating the turbo decoding process early when one of at least two test criterion is satisfied in communications systems, including UMTS, WCDMA, and TD-DCMA.

Abstract: Log-likelihood ratios produced by a decoder are incorporated into a soft symbol to soft bit estimation process and are used to perform improved channel estimation and impairment covariance estimation. In an example method, a plurality of soft bits and corresponding probability metrics for a series of received unknown symbols are generated. Estimates of the received unknown information symbols are then regenerated, as a function of the soft bits and corresponding probability metrics. An estimate of the average amplitude of the received unknown information symbols, or an estimate of the propagation channel response experienced by the received unknown information symbols, or both, are calculated, as a function of the regenerated symbol estimates. The results are applied to produce demodulated symbols for a second decoding iteration for the series of received unknown symbols.

Abstract: A likelihood value calculation device includes: likelihood value calculation unit 201 that takes as input an equalization signal of a modulated signal, and that, in accordance with a first control signal, calculates from the equalization signal a provisional likelihood value for which the bit value of each signal point is “0” for each bit position; arithmetic inversion unit 202 that, in accordance with a second control signal, supplies for each bit position the provisional likelihood value without alteration or subjects the provisional likelihood value to arithmetic inversion and supplies the likelihood value following inversion; and operation control unit 200 that holds, for each combination of a radio mode and a modulation mode, a control pattern used to control the likelihood value calculation unit 201 and arithmetic inversion unit 202 and that generates the first and second control signals in accordance with the control pattern designated from among these control patterns.

Abstract: A technique for determining in a fading channel environment a scaling factor for soft bit quantization is proposed. In a method realisation, the technique includes repeatedly determining an SNR value for the fading channel, calculating a weighted average based on a plurality of the SNR values, wherein weighting is performed such that contributions of extremal SNR values are attenuated, and determining the scaling factor for soft bit quantization dependent on the weighted average.

Abstract: A system including a detection module, a reconstruction module, and a correlation module. The detection module receives first signals from a medium and detects data bits from the first signals. The reconstruction module reconstructs the data bits and generates second signals. The correlation module generates first correlation values by correlating the first and second signals and generates second correlation values by self-correlating the second signals. In response to at least one of the first and second signals including a floating number having a plurality of bits and a sign bit, the correlation module generates at least one of the first and second correlation values based on a plurality of most significant bits of the floating number and the sign bit of the floating number. The first and second correlation values indicate whether the data bits detected from the first signals include errors due to defects in the medium.

Abstract: Described herein are apparatus, system, and method for data synchronization via a maximum-likelihood decoder in a memory controller. The method comprises receiving a constrained codeword from a non-volatile memory (NVM) via a channel, the constrained codeword including an appended bit-stream; and decoding the received constrained codeword by reconstructing the appended bit-stream and invoking a synchronization procedure that applies a maximum-likelihood (ML) estimator to estimate locations of any insertion, deletion, or error in the reconstructed appended bit-stream.

Abstract: Block-encoded transmissions of a multi-antenna terminal unit are effectively detected in the presence of co-channel interfering transmissions when the base station has a plurality of antennas, and interference cancellation is combined with maximum likelihood decoding. More specifically, the signals received at the base station antennas are combined in a linear combination that relates to the channel coefficients between the various transmitting terminal units and the base antennas. By selecting proper coefficients for the linear combination and choosing probable transmitted signals that minimize a minimum mean squared error function, the signals of the various terminal units are canceled when detecting the signal of a particular unit. In another embodiment of the invention, the basic approach is used to obtain an initial estimate of the signals transmitted by one terminal unit, and the contribution of those signals is removed from the received signals prior to detecting the signals of other terminal units.

Abstract: A receiver includes an antenna array that generates received signals from a first remote transmitter and a second remote transmitter, the antenna array having a beam pattern that is controllable based a control signal. A plurality of receiver sections process the received signals to generate down-converted signals. A receiver processing module, generates the control signal to control the beam pattern to a first pattern during a first time period for reception from the first remote transmitter, generates a first reception estimate based on the down-converted signals during the first time period, generates the control signal to control the beam pattern to a second pattern during a second time period for reception from the second remote transmitter, generates a second reception estimate based on the down-converted signals during the second time period, and generates inbound data based on the first reception estimate and the second reception estimate.

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: Disclosed are a method and apparatus of adaptive transmission signal detection based on a signal-to-noise ratio and a Chi-squared distribution for decoding a reception signal in the form of multi-streams into a transmission signal, the method comprising: receiving a reception signal vector; estimating a channel matrix of a channel that the reception signal vector experienced; performing QR decomposition based on the estimated channel matrix; calculating dimensions of divisional spaces adaptively on the basis of a signal-to-noise ratio (SNR) or a signal-to-interference noise ratio (SINR); detecting a maximum likelihood point having a maximum likelihood value among lattice points within each divisional space obtained on the basis of results from performing the QR decomposition and calculating dimension of the divisional spaces; and recovering a transmission signal vector based on the detected maximum likelihood points.

Abstract: In the present invention, deciding M final soft decision bit values includes a first step of securing an I channel value and a Q channel value of the received transmission signal, a second step of securing initial soft decision bit values for a first bit and a second bit by using the secured I channel value and the secured Q channel value, a third step of cyclically securing initial soft decision bit values for a third bit to an Mth bit by using the initial soft decision bit values for the first bit and the second bit, and a fourth step of securing final soft decision bit values by multiplying the secured initial soft decision bit values by a gain, wherein the gain is calculated based on a reliability adjustment value of the initial soft decision bit values.

Abstract: Embodiments for demodulating data streams are disclosed. In one embodiment, a method includes receiving, at a multiple-input device, a plurality of data streams. The method also includes determining a degree of correlation among the plurality of data streams. The method also includes selecting a demodulator based on the degree of correlation.

Abstract: A full-rate distributed space-time (ST) code design is provided for amplify-and-forward cooperative wireless channels. A signal space diversity technique is employed at the source node and a unique signature vector at each relay node. The distributed space-time (ST) codes can achieve full cooperative diversity and full rate. The achievable diversity gain is M+1, where M is the number of relay nodes. Optimal power allocation can be used to maximize the coding gain under a total power constraint.

Abstract: Apparatuses, methods and systems of receive signal detection of a multi-carrier signal are disclosed. One method includes receiving a multi-carrier signal, determining a characteristic of each sub-carrier of the multi-carrier signal, and selecting a one of a plurality of receive signal detection techniques for each sub-carrier of the multi-carrier signal based on the determined characteristic of the sub-carrier.

Abstract: Within a user device to which a radio communication network infrastructure transmits data carried by a sequence of frames broadcast to the user device, each frame comprising a first section comprising data and a second section comprising redundancy information associated with the data of a predetermined number B of previous frames in the sequence, a number of consecutive lost frames is compared to a threshold dependent on the number B of previous frames with which said redundancy information is associated and encoding parameters that generate said redundancy information, and a request to retransmit at least one of the consecutive lost frames is sent to the radio communication network infrastructure if the number of consecutive lost frames exceeds said threshold.

Abstract: A method involves receiving an LDPC coded bitstream and demultiplexing the received LDPC coded bitstream using an optimized demultiplexer, the optimized demultiplexer being designed by: substituting Q levels of a constellation mapper by Q parallel binary erasure channels; optimizing a density evolution of erasure probability over said binary erasure channels for a plurality of demultiplexer offsets; and identifying from the plurality of demultiplexer offsets those with a minimum number of check node decoder collisions.

Abstract: Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. These performance advantages allow a noise margin target to be achieved using simpler component codes and a much shorter interleaver than was needed when using prior art codes such as Turbo codes. Decoders are also provided. Both encoding and decoding complexity can be lowered, and interleavers can be made much shorter, thereby shortening the block lengths needed in receiver elements such as equalizers and other decision-directed loops.

Abstract: A communication system includes: a module configured to decode a remainder portion of a receiver message using a mechanism with a compensation channel value calculated from decoding an evaluation portion of the receiver message with a different mechanism, or using a mechanism-controller generated using a mismatch characterization based on determining a partial-sensitive output and a partial-insensitive output, or a combination thereof for communicating with a device.

Abstract: Methods and apparatus are provided for secure distribution and storage of data using N channels. An input data sequence, X, is distributed using a plurality, N, of channels. In one embodiment, the input data sequence, X, is split into N subsequences; and the N subsequences are encoded into N bit streams using a set of Slepian-Wolf codes with N separate encoders and a joint decoder. The Slepian-Wolf codes can be selected to ensure a computational complexity to obtain a portion of the input data sequence grows exponentially with respect to a length of the input data sequence unless all of the N bit streams are compromised. In another embodiment, the input data sequence, X, is compressed using a lossless data compressing techniques; and the compressed input data sequence is split into N subsequences that are distributed.

Abstract: A method and apparatus for generating soft-decision output values for a set of transmitted spatial streams in a multiple-input multiple-output (MIMO) communication system are described. The apparatus includes a processor and memory with executable instructions. A plurality of constellation points for respective transmitted spatial streams are looped over to estimate values for other transmitted streams based at least in part on Reduced List Detection (RLD). The plurality of constellation points is a subset of all possible constellation points determined around a spatial stream where more constellation points are assigned to spatial streams with a weaker signal strength than for spatial streams with a stronger signal strength. A set of distance metrics as values of the plurality of constellation points for the respective transmitted spatial streams are determined. Soft-decision outputs for the respective transmitted streams based at least in part on the set of distance metrics are generated.

Abstract: Two decoding algorithms are introduced for the decoding of multi-level coded modulation and other types of coded modulation involving component codes and interleaving operations. An improved hard iterative decoding (IHID) algorithm is presented that improves upon a hard iteration decoding technique by adding a stopping criterion. Also, a list Viterbi hard iteration decoding (LV-IHID) algorithm is presented that employs list decoding in conjunction with the IHID algorithm. Both of these decoding algorithms improve upon conventional multi-stage decoding by reducing the effective error multiplicity that is observed at the lowest coding level. It is demonstrated that the LV-IHID algorithm performs close to soft iterative decoding. The computational and delay complexity of the proposed decoding algorithms compare favorably with soft iterative decoding strategies. Also, a novel labeling strategy for MLC design is presented.

Abstract: Distribution parameter mapping determines the bit error probability (BEP) of a burst transmitted from a base station to the mobile station using a modulation and coding scheme (MCS) specified in the EDGE standard. Depending on whether the multi-bit soft decisions of the burst most resemble a Gaussian or a Rician distribution, the statistical parameters ? and ? or A and u are determined. The ratio ?/? or A/? is mapped to an empirically determined BEP in a Gaussian or Rician lookup table, respectively. The BEPs are not influenced by the degree of code redundancy in the MCS. The BEPs for the four bursts in a radio block are then averaged, filtered and quantized according to the EDGE standard. The quantization level of the average BEP is reported to the base station so that subsequent radio blocks can be transmitted using an MCS that is appropriate for the estimated BEP.

Abstract: A method for searching for an input symbol string, includes receiving (B) an input symbol string, proceeding (C) in a trie data structure to a calculation point indicated by the next symbol, calculating (D) distances at the calculation point, selecting (E) repeatedly the next branch to follow (C) to the next calculation point to repeat the calculation (D). After the calculation (G), selecting the symbol string having the shortest distance to the input symbol string on the basis of the performed calculations. To minimize the number of calculations, not only the distances are calculated (D) at the calculation points, but also the smallest possible length difference corresponding to each distance, and on the basis of each distance and corresponding length difference a reference value is calculated, and the branch is selected (E) in such a manner that next the routine proceeds from the calculation point producing the lowest reference value.

Abstract: A communication method for estimating Doppler spread includes the following steps: transmitting a preamble signal to a receiver from a transmitter of a transmission terminal. The preamble signal is received by the receiver; followed by dividing the received samples in the preamble signal into a plurality of sets of samples. The plurality of sets of samples are introduced into a Doppler spread estimation algorithm to estimate Doppler spread.

Abstract: Various embodiments of the present invention provide systems and methods for data processing. For example, a data processing system is disclosed that includes a combination data decoder circuit. The combination data decoder circuit includes a first decoder circuit and a second decoder circuit. The first decoder circuit is operable to apply a first data decode algorithm to a decoder input to yield a decoded output. The second decoder circuit is operable to apply a second data decode algorithm to a subset of the decoded output to modify at least one element of the decoded output to yield a modified decoded output.

Abstract: A method of encoding a stream of data elements is provided which involves splitting the stream of data elements into a first stream and a second stream; encoding the first stream to produce a first encoded stream; performing a constellation mapping using a combination of the first encoded stream and a third stream which is based on the second stream. This may involve defining a signal constellation; defining a plurality of co-sets within the constellation such that a minimum distance between constellation points within each co-set is larger than a minimum distance between any constellation points within the signal constellation; performing said constellation mapping by using the first encoded stream to identify a sequence of co-sets of said plurality of co-sets, and by using the third stream to identify a sequence of constellation points within respective co-sets of the sequence of co-sets identified by said first encoded stream.

Abstract: Certain aspects of a method and system for a delay locked loop for a rake receiver are disclosed. Aspects of one method may include normalizing a signal power of a first control channel based on a threshold value. A sampling time associated with at least one or more of the following: the first control channel, a second control channel, an on-time control channel, and a data channel, may be adjusted based on a comparison between the normalized signal power of the first control channel and a signal power of the second control channel. The second control channel may be delayed with respect to the first control channel by a particular time period. The first and second control channels may be common pilot control channels (CPICHs). The combined signal power of the first control channel may be normalized based on said threshold value.

Abstract: A method and device is provided for detecting data symbols in a received radio signal. Each data symbol is allocated transmit-side a symbol value-specific PN sequence of successive PN chips in the chip clock, and the allocated PN sequences are offset QPSK modulated. The method for incoherent detection includes converting the received radio signal into a complex baseband signal sampled in the chip clock, generating a demodulated signal by differential demodulation of the complex baseband signal, calculating correlation results by correlating the demodulated signal with the derived sequences, and deriving the values of the data symbols by evaluating the correlation results. Each derived sequence is assigned to a PN sequence allocable transmit-side and includes derived chips, whose values correspond to a logic linking of particular PN chips of the PN sequence allocable transmit-side that is assigned the derived sequence. The invention relates furthermore to a corresponding receiving unit.

Abstract: The present invention provides an apparatus and method for estimating a frequency offset which are robust against non-Gaussian noise. In a frequency offset estimation method of an Orthogonal Frequency Division Multiplexing (OFDM) system using a training symbol, the method includes receiving a reception signal, setting a specific initial frequency offset corresponding to the reception signal, and calculating a log-likelihood function based on a Complex Isotropic Symmetric ? Stable (CIS?S) probability density function obtained by modeling non-Gaussian noise included in the reception signal and estimating an optimum frequency offset based on the log-likelihood function and the initial frequency offset through a Maximum Likelihood Estimator (MLE). Accordingly, in a non-Gaussian noise environment, frequency offset estimated performance can be improved as compared with a conventional method in which noise is assumed to be a normal distribution.

Abstract: An embodiment of a method for decoding is disclosed. For this embodiment of the method, a decoder is limited to a set number of iterations for a decoding sequence. The set number of iterations is selected to be less than an optimal number of iterations for an optimal bit error rate (“BER”) resulting in a BER penalty. Inner loop decoding operations are performed within the decoder for the set number of iterations. Reliability information is output from the decoder to a data slicer. A symbol stream is output from the data slicer responsive to the reliability information.

Abstract: In various aspects, the disclosure describes systems and methods for decoding of convolutionally encoded signals representing, for example, telecommunications signals such as command or content signals used in digital telecommunications. In various embodiments such aspects of the disclosure provide systems and methods for improving the efficiency, speed, and power consumption of such processes by providing architectures and methods for processing various parts of the encoded data records in parallel, using multiple and optionally specially-designed, dedicated memory registers and multiplexers.

Abstract: Effective management of a Hybrid-Automatic Repeat reQuest (HARQ) buffer in a wireless communication system is provided. A receiving terminal includes a first memory for storing Log Likelihood Ratio (LLR) values of at least one data block comprised in a received HARQ burst in a first memory, a channel decoder for decoding the at least one data block by using the LLR values, an error detection unit for detecting whether there are errors in the decoded at least one data block, and a second memory for storing at least one error-free data block in a decoded state among the data blocks in a second memory.

Abstract: In a multicarrier wireless communication system adopting forward error correction codes, a reception method adapted to a receiver 1 receiving wireless signals is constituted of an interference band detection process for selecting a sub-carrier having low reliability among a plurality of sub-carriers of desired waves as a specific sub-carrier, a weight coefficient generation process for generating weight coefficients for reducing reliability in sub-carriers with respect to the selected specific sub-carrier, a demodulation process for demodulating received wireless signals of sub-carriers, a weighted calculation process for performing weighted calculation applying weight coefficients to demodulated values of sub-carriers of wireless signals, and a decoding process for performing a decoding process for error correction on values calculated of sub-carriers.

Abstract: Methods, apparatuses, and computer program products are disclosed for facilitating decoding a communication received from a wireless terminal. Encoded bits are received from the wireless terminal via a shared uplink channel, and a plurality of acknowledgment tones are identified within the encoded bits. A correlation value is ascertained corresponding to a correlation between detected bits within the plurality of acknowledgment tones and valid bits corresponding to any of a plurality of valid acknowledgment codewords. A determination is then made as to whether the plurality of acknowledgment tones includes information corresponding to a discontinuous transmission by comparing the correlation value to a threshold value.

Abstract: Certain aspects of the present disclosure relate to a method for iterative decoding with re-transmissions of data and to a method for iterative decoding with soft decision directed channel estimation.

Abstract: A reproduction signal evaluation method evaluates the quality of a reproduction signal reproduced from an information recording medium based on a binary signal generated from the reproduction signal using a PRML signal processing system. A pattern extraction step extracts, from the binary signal, a specific state transition pattern which has the possibility of causing a bit error; a step computes a differential metric based on the binary signal; an extraction step extracts the differential metric which is not greater than a predetermined signal processing threshold; a step determines a mean value of the differential metrics which are not greater than the signal processing threshold and extracted in the extraction step; a standard deviation computing step determines a standard deviation which corresponds to an error rate predicted from the mean value; and an evaluation step evaluates a quality of the reproduction signal using the standard deviation.

Abstract: A method includes a first step of receiving a signal at a first receiver circuit on the basis of a mobile communications standard supporting multiple predefined modulation alphabets wherein the received signal includes first data dedicated to the first receiver circuit and second data dedicated to a second, different receiver circuit, a second step of determining a modulation alphabet of the multiple predefined modulation alphabets during an operation of the first receiver circuit and a third step of detecting data depending on the second data at the first receiver circuit on the basis of the determined modulation alphabet.

Abstract: The invention relates to a method of estimating symbols carried by a digital signal that is received by a receiver over a communication channel (5), said symbols being multiplexed or orthogonal frequency sub-carriers. The inventive method comprises the following steps in relation to each symbol carried by the digital signal, consisting in: performing at least two transforms towards the frequency domain (8,9) on a portion of the received signal essentially corresponding to the symbol, said transforms being performed with a determined time lag (10) therebetween: estimating the parameters (r0, r1, . . . , rn, r?0, r?1, . . . , r?n) of the communication channel from pre-determined binary information contained in the digital signal; and estimating the symbol from a combination of the result of each of the transforms performed and the estimated communication channel parameters.

Abstract: A method includes a first step of receiving a signal on the basis of a mobile communications standard supporting multiple predefined modulation alphabets and a second step of detecting data of the received signal on the basis of a modulation alphabet which includes modulation symbols of at least two of the multiple predefined modulation alphabets.

Abstract: In a receiver with a demodulator and a decoder performing iterative processing, a solution is provided for reducing the implementation cost of and improving the throughput of an interleaver and a deinterleaver. A receiver includes a symbol demapper outputting first extrinsic information by using one received symbol and a priori information, a check node decoder outputting second extrinsic information by using first extrinsic information and a priori information, a deinterleaver deinterleaving second extrinsic information, a variable node decoder outputting third extrinsic information by using deinterleaved second extrinsic information as a priori information, and an interleaver interleaving third extrinsic information output from the variable node decoder. The check node decoder outputs fourth extrinsic information by using interleaved third extrinsic information as a priori information and the fourth extrinsic information is used as a priori information by the symbol demapper.

Abstract: The device is used for decoding convolution-encoded reception symbols. In this context, transmission data are modulated with a modulation scheme to form symbols, which are encoded with a transmission filter to form convolution-encoded transmission symbols. A convolution-encoded transmission symbol contains components of several symbols arranged in time succession. These transmission symbols are transmitted via a transmission channel and received as reception symbols. The Viterbi decoder decodes the reception symbols by use of a modified Viterbi algorithm. Before running through the Viterbi decoder, the reception symbols are processed by a state-reduction device, which determines additional items of information relating to possible consequential states of the decoding independently of the decoding through the Viterbi decoder in every state of the decoding. The state-reduction device uses the additional items of information to restrict the decoding through the Viterbi decoder to given consequential states.

Abstract: A multi-channel sequential Viterbi decoder includes: an input buffer, a “Read Data from Input Buffer” signal driver, a processing unit selector, a decoder channel parameters registers unit, a processing unit for a “Reset Path Metrics” command, a processing unit for a “Set Path Metric Value for the Given Path Number” command, a processing unit for a “Get Single Bit from the Path with Given Number” command, a processing unit for a “Process Input Samples” command, a memory for storing decoding paths and path metrics, a unit for generating an address for the memory, and data buffers for decoder channels output.

Abstract: A first semiconductor die may comprise an interface circuit and a demodulation circuit. The interface circuit may be operable to receive an externally generated signal and recover decisions of a symbol de-mapper carried in the externally generated signal. The demodulation circuit may be operable to recover one or more transport streams based on the decisions of the symbol de-mapper. The first semiconductor die may comprise circuitry operable to combine a plurality of signals from a plurality of second semiconductor dice, where each of the plurality of signals comprises decisions of a respective one of a plurality of symbol de-mappers.