Abstract: Systems and methods are disclosed for detecting temporary high level impairments, such as noise or interference, for example, in a communications channel, and subsequently, mitigating the deleterious effects of the dynamic impairments. In one embodiment, the method not only performs dynamic characterization of channel fidelity against impairments, but also uses this dynamic characterization of the channel fidelity to adapt the receiver processing and to affect an improvement in the performance of the receiver. For example, in this embodiment, the method increases the accuracy of the estimation of the transmitted information, or similarly, increases the probability of making the correct estimates of the transmitted information, even in the presence of temporary severe levels of impairment. The channel fidelity history may also be stored and catalogued for use in, for example, future optimization of the transmit waveform.

Abstract: Systems and methods for decoding data using a hybrid decoder are provided. A data signal that includes a codeword is received. A signal quality indicator for the data signal is computed. One of a plurality of decoders is selected based on the computed signal quality indicator. Each of the plurality of decoders is configured to decode information based on a different decoding technique. The codeword included in the data signal is decoded using the selected one of the plurality of decoders.

Abstract: A multi-tone transceiver with a components forming a transmit path and a receive path configured to couple via a subscriber line to an opposing multi-tone transceiver for frequency division multiplexed multi-tone modulated communications therewith is disclosed. A noise margin channel identifier is configured to identify within a received tone set, discrete tones each associated with a corresponding one of at least two channels differing from one another in a relative noise margin of associated tones. A Viterbi decoder is responsive to the channel identification provided by the noise margin channel identifier to discretely decode each of the at least two channels; thereby improving the fidelity of the error correction provided by the Viterbi decoder by discretely processing the identified channels within the received set of tones.

Abstract: Methods and apparatus are disclosed related to a memory device, such as a flash memory device that includes an array of memory cells. One such method includes detecting values of charges stored in selected memory cells in the memory cell array. The method also includes processing the detected values in accordance with a Viterbi algorithm so as to determine data stored in the selected memory cells. In one embodiment, the flash memory cell array includes word lines and bit lines. Detecting the values of charges includes detecting values of charges stored in a selected row of memory cells by selecting one of the word lines. The Viterbi algorithm provides correct data where inter-signal interference between the cells affects the accuracy of read data. For example, the Viterbi algorithm can decode error correction codes (ECC).

Abstract: Methods, apparatuses, systems, and architectures for providing fast, independent, and reliable retrieval of system data (e.g., metadata) from a storage system, which enables minimal degradation in the reliability of user data. Methods generally include encoding the system data at least twice, at least once independently and at least once jointly along with user data. Methods can also include decoding the system data first, and upon a decoding failure, jointly decoding the system data and the user data.

Abstract: A method of estimating signal-to-noise ratio in a Viterbi decoder comprising: setting a threshold SNR value; determining a dependence on SNR of the average decoding path length; filling branch metrics matrix, minimal path metrics matrix, path metrics matrix and paths matrix with initial values; receiving packets from a communication channel; calculating the matrices that contains paths stored during operation of Viterbi algorithm in its rows, and a minimal path metrics matrix, including calculating an estimate of a decoding path length, where all the paths converge, based on the paths matrix; calculating current SNR estimate using an estimate of a decoding path length, based on results of previous steps; setting a decoder control signal to an active state if the current estimated SNR does not exceed the threshold, and to an inactive state otherwise; if the decoder control signal is in active state, the branch metrics matrix, the minimal path metrics matrix, the paths metrics matrix and the paths matrix are fi

Abstract: The disclosure provides a method and device for implementing Viterbi decoding. The method comprises the following steps: calculating branch path measurement values of received code words and reference code words; parallel accumulating the branch path measurement values and measurement values corresponding to states to obtain accumulated values according to a state transition diagram, selecting a maximum accumulated value as a new measurement value of a next state, and saving all survival path selection results until data for decoding ends; and starting traceback from a final state to obtain decoded data according to the survival path selection results. In the disclosure, by modifying the traditional serial or serial-parallel mixed mode for calculating accumulated path measurement values to a multi-path fully-parallel calculation mode, the throughput rate of the system data is improved, and the decoding delay is merely in us level.

Abstract: A first sequence of states associated with a surviving path and a second sequence of states associated with a non-surviving path are determined. A possible error event is determined based at least in part on the first sequence of states and the second sequence of states. The first sequence of states is replaced with the second sequence of states by applying the possible error event to the first sequence of states.

Abstract: According to at least one embodiment, a signal processor apparatus includes a Viterbi decoder, a processor, and an adjustment module. The Viterbi decoder calculates a branch metric based on an input signal. The processor outputs a processing result correlated with a processing result of the Viterbi decoder. A latency of the processor for the input signal is lower than a latency of the Viterbi decoder. The adjustment module adjusts a first parameter for calculating the branch metric based on the processing result of the processor.

Abstract: A receiver includes a seed recovery module and a pseudo-random binary sequence generator. The seed recovery module is configured to receive a pseudo-random binary sequence and a signal including a seed value, recover the seed value from the signal using the pseudo-random binary sequence, and determine a likelihood that a bit of the seed value was recovered accurately. The pseudo-random binary sequence generator is configured to generate the pseudo-random binary sequence, and adjust the pseudo-random binary sequence based on the likelihood until the likelihood is greater than a threshold.

Abstract: A decoding method decodes N received branchwords produced by a convolutional encoder using a tail-biting convolutional code. N received branchwords are in memory. Viterbi updates are performed on a sequence of branchwords. A first encoder determines a state at the end of the third block most likely to have generated the final branchword in the sequence from the best path metric. A Viterbi traceback procedure is performed from that first encoder state at the end of the third block to determine a second encoder state at the start of the third block of branchwords. A Viterbi traceback procedure is performed from that second encoder state at the start of the third block to determine a third encoder state at the start of the second block of branchwords. A derived tail-biting path is output, if the second and third encoder states are identical.

Abstract: A system for adapting coefficients of a soft output Viterbi algorithm (SOVA) is disclosed. The system includes a receiver configured to select an output of an SOVA detector at least in part based on a criterion. The receiver is configured to store the selected output of the SOVA detector. The receiver is further configured to store a signal that corresponds to the stored selected output of the SOVA detector, wherein the input to the SOVA detector is derived from the signal. The receiver is further configured to adapt a plurality of coefficients of the SOVA detector at least in part based on the stored selected output of the SOVA detector, the stored signal, and a corresponding data pattern. The system includes an interface coupled to the receiver and configured to receive samples.

Abstract: The present application refers to a method for determining an extrinsic information input to an ECC decoder of a turbo equalizer. In one embodiment, a first loop-back signal is represented with a first number of bits, wherein the first loop-back signal comprises a signal looped back from an output of an ECC decoder. An output of a signal detector is represented with a second number of bits. An extrinsic information input to the ECC decoder is determined based at least in part on the first loop-back signal, the represented output of the signal detector, and at least one comparison with at least one predetermined threshold.

Abstract: An iterative error correction coding (ECC) decoder is configured to operate in a first higher-power and higher-performance operating mode. At least some part of a system that includes the iterative ECC decoder is monitored. It is determining whether to switch the iterative ECC decoder from the first higher-power and higher-performance operating mode to a second lower-power and lower-performance operating mode based at least in part on the monitoring. The iterative ECC decoder is configured to operate in the second lower-power and lower-performance operating mode in the event it is determined to switch operating modes.

Abstract: A soft symbol decoder for use in a multiple input multiple output (MIMO) and OFDM (orthogonal frequency division multiplexing) system. The decoder generates soft symbol values for a digital signal that represents a number of source bits. The source bits are transmitted as symbols in corresponding to points in a signaling constellation. Soft metrics are determined by searching for all possible multi-dimensional symbols that could have been transmitted. The method includes transmitting a sample of the multi-dimensional symbol using K transmit antennas. The multi-dimensional symbol is represent-able as a complex, K-dimensional vector x. Each vector component of vector x represents a signal transmitted with one of the K transmit antennas. After transmission through a communication channel, a sample corresponding to the transmitted sample is received. The received sample is represented by a complex, N-dimensional vector y, where N is the number of receive antennas in the MIMO system.

Abstract: A reception apparatus including: a detection unit detecting extrinsic information based on a tentative symbol decision signal, a channel estimation signal, a noise variance estimation signal, and a received signal that are obtained from a previous iteration process; a Cyclic Redundancy Check (CRC) aided channel decoding unit outputting an interleaved bit or a posteriori information thereof based on the extrinsic information; a tentative symbol decision unit determining a tentative transmission symbol based on an output of the CRC aided channel decoding unit; a channel estimation unit estimating a channel based on an output of the tentative symbol decision unit; and a noise variance estimation unit estimating a noise variance based on the output of the tentative symbol decision unit and an output of the channel estimation unit is provided.

Abstract: A memory system includes: a memory controller including an error correction decoder. The error correction decoder includes: a demultiplexer adapted to receive data and demultiplex the data into a first set of data and a second set of data; first and second buffer memories for storing the first and second sets of data, respectively; an error detector; an error corrector; and a multiplexer adapted to multiplex the first set of data and the second set of data and to provide the multiplexed data to the error corrector. While the error corrector corrects errors in the first set of data, the error detector detects errors in the second set of data stored in the second buffer memory.

Abstract: Various embodiments of the present invention provide systems and methods for data processing.

Abstract: Apparatus and methods are disclosed for decoding data stored on a data storage medium. A disclosed decoding method and decoder include a radial incoherence (RI) detector that increases the probability of detecting RI and improves the decoding performance in terms of the bit error rate of the decoded signal. RI is detected by comparing an input signal to the decoder against a RI threshold value and generating a RI-type signal. The RI detector may include a filter for filtering out noise and error in the RI-type signal, an adaptive threshold unit that adjusts the RI threshold value based upon the RI-type signal, a transition-based threshold unit that adjusts the RI threshold value based upon each transition in the input signal, or a path-based threshold unit that adjusts the RI threshold value based upon a best surviving path corresponding to the input signal, in combination or alone.

Abstract: A method for communication includes receiving a communication signal conveying multiple encoded bits of an Error Correction Code (ECC). Respective N-bit soft decoding metrics are computed with respect to the bits of the ECC. A scaling factor is computed based on at least one characteristic of the N-bit soft decoding metrics and on at least one property of the received communication signal. The N-bit soft decoding metrics are scaled by the scaling factor. The scaled N-bit soft decoding metrics are quantized to produce respective K-bit metrics, K<N. The ECC is decoded using the scaled and quantized soft decoding metrics.

Abstract: Various embodiments of the present invention provide systems and methods for variable iteration data processing.

Abstract: The invention relates to an iterative decoding method of the message-passing type for decoding an error correcting code susceptible of representation by a bipartite graph including a plurality of variable nodes and a plurality of control nodes, said messages being expressed in terms of a log likelihood ratio. At each iteration of a plurality of decoding iterations, for each pair consisting of a variable node and a control node, a change is detected in the sign of the extrinsic information intended to be transmitted (?mntemp) as a message by said variable node to said control node relative to that transmitted (?mn) at the previous iteration, and in the event of a sign change, said extrinsic information is subjected to an amplitude reduction operation (Fred) before it is transmitted to the control node.

Abstract: A method for a decoding device to decode a codeword matrix of a product code includes: generating a first extended parity check matrix for a vertical code; decoding a horizontal codeword of a plurality of rows in the codeword matrix to thus perform a first decoding process; generating a second extended parity check matrix by removing a column corresponding to a row of the first decoding-succeeded horizontal codeword from the first extended parity check matrix; and decoding the first decoding-failed horizontal codeword by using the second extended parity check matrix to thus perform a second decoding process. Therefore, the simple and reliable product code decoding method is provided.

Abstract: Embodiments of the present invention provide a read channel including a front end to receive an optical image, convert the optical image into multi-bit soft information, and to serially transmit the multi-bit soft information to other components of the read channel. Other embodiments may be described and claimed.

Abstract: Various embodiments of the present invention provide systems and methods for media defect detection. For example, a data transfer system is disclosed that includes a data detector, a defect detector and a gating circuit. The data detector provides a soft output, and the defect detector is operable to receive the soft output and the data signal, and to assert a defect indication based at least in part on the soft output and the data signal. The gating circuit is operable to modify the soft output of the detector whenever the defect indication is asserted.

Abstract: A method for detecting validity of downlink control information in telecommunication user equipment and a decoder and baseband receiver to perform the method are provided. The object of avoiding falsely detecting payload data and misinterpreting them is achieved by reverse encoding a bit output sequence of a Viterbi decoder; determining hard bits from a soft-bit input sequence of the decoder; determining a bit count of real received bits; comparing the reverse encoded bit stream to the determined hard bit stream and counting the number of mismatches to obtain an error count; comparing a bit error rate which is defined as a quotient of the error count and the bit count against a predefined threshold value; and rejecting the payload as invalid if said bit error rate is above said threshold value, even if a cyclic redundancy check of the payload gives a correct result.

Abstract: An improved mapping policy, signal mapper, transmitter, receiver, and communication system are introduced. The improved signal mapping policy alternates between standard and inverted bit mapping functions at selected phase states to reduce the error coefficient of MSK and other types of CPFSK signals. The proposed policy can more generally be applied to other types of signals with memory as well. Simulations show that the mapping policy can significantly improve performance particularly at lower to moderate SNR values.

Abstract: Various embodiments of the present invention provide systems and methods for selecting between pre-coding and non-pre-coding. As an example, a data processing circuit is disclosed that includes: a first data detector circuit, a second data detector circuit, a first comparator circuit, a second comparator circuit, and a pre-code selection circuit. The first data detector circuit is selectably configurable to operate in a pre-coded state, and operable to apply a data detection algorithm on a data input to yield a first detected output. The second data detector circuit operable to apply the data detection algorithm to the data input to yield a second detected output without compensating for pre-coding. The first comparator circuit operable to compare the first detected output against a known input to yield a first comparison value, and the second comparator circuit operable to compare the second detected output against the known input to yield a second comparison value.

Abstract: A decoding device allowing a high-speed decoding operation. In a decoding section (215), if a degree of a check equation by a check matrix is D and the relationship between the check equation of the j+first row of the check matrix and the cheek equation of the jth row is shifted by n-bit, row processing operation sections (405#1 to 405#3) and column processing operation sections (410#1 to 410#3) perform the operation of a protograph in which the columns of the check matrix are delimited for each “(D+1)×N (N: natural number),” and the rows of the check matrix are delimited for each “(D+1)×N/n,” and formed as the processing unit of the row processing operation and column processing operation.

Abstract: Methods, software, circuits and systems involving a low complexity, tailbiting decoder. In various embodiments, the method relates to concatenating an initial and/or terminal subblock of the serial data block and outputting decoded data from an internal block of the modified data block. The circuitry generally includes a buffer, logic configured to concatenate an initial and/or terminal subblock to the serial data block, and a decoder configured to decode the data block, estimate starting and ending states for the data block, and output an internal portion of the serial data block and the one or more sequences as decoded data. The invention advantageously reduces the complexity of a suboptimal convolutional decoder, ensures smooth transitions at the beginning and end of the serial data block during decoding, and increases the reliability of the starting and ending states, without adding overhead to the transmitted data block.

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: A user equipment (UE) comprising at least one component configured to decode a tail-biting convolution code (TBCC) by calculating a plurality of paths that correspond to a plurality of encoder starting states and trace back at least one of the calculated paths per at least one iteration until a trace-back convergence check (TCC) condition fails, wherein the TCC condition fails if a starting state of a first traced back path among the calculated paths is not equal to a starting state of a subsequent traced back path.

Abstract: A pattern-dependent error correction method and system for a code group alignment finite state machine (FSM) are disclosed. A state corrector generates a start-of-stream delimiter (SSD) detected signal to the FSM when the FSM is in an idle state and at least one condition due to a lost SSD signal is met; and the state corrector generates an idle detected signal to the FSM when at least one condition due to a lost idle signal is met. A pattern corrector generates a corrected code pattern {J,K} to FSM when the FSM is in an idle state and at least one condition due to a false idle state is met; and the pattern corrector generates a corrected code pattern {T,R} to the FSM when the FSM is in a data state, a start of stream state or a data error state, and at least one condition due to a false packet end is met.

Abstract: Low latency and computationally efficient techniques may be employed to account for errors in data such as low bit-width, oversampled data. In some aspects these techniques may be employed to mitigate audio artifacts associated with sigma-delta modulated audio data. In some aspects an error may be detected in a set of encoded data based on an outcome of a channel decoding process. Upon determining that a set of data may contain at least one error, the set of data may be replaced with another set of data that is based on one or more neighboring data sets. For example, in some aspects a set of data including at least one bit in error may be replaced with data that is generated by applying a cross-fading operation to neighboring data sets. In some aspects a given data bit may be flipped as a result of a linear prediction operation that is applied to PCM equivalent data that is associated with the given data bit and its neighboring data bits.

Abstract: A decompression method for communication network is provided, in which such fields as an SN are compressed by using an ROHC scheme. The ROHC uses a WLSB algorithm to compress some fields which change regularly, and decodes by using the decompressor's context through transmitting the low significant bits in these fields. In order to avoid using the inefficient ergodic method and the incorrect direct replacing method in low bits, based on the mathematical characteristics of the definition of interpretation intervals, decoding is performed such that the low bits is determined by the received k significant bits while the high bits is determined jointly by the local storage information and these k significant bits. Its decoding method can be used for decompression of an SN, a TS and an IP-ID in an ROHC compression.

Abstract: Schemes for creating a surplus of decoding iterations in a decoder are described. The surplus can be used to augment the decoding of signal blocks. The option of using an idle decoder to decode blocks marked as unproductive for decoding is also described.

Abstract: A channel decoder including an amplifier configured to amplify a signal; a first summer configured to generate an output signal based on the signal amplified by the amplifier; and a Viterbi detector module configured to, based on the output signal, generate a first estimate signal and a second estimate signal, wherein the first estimate signal and the second estimate signal respectively indicate an estimate of data in the signal. The channel decoder further includes a second summer configured to generate a first error signal indicating a first gradient based on the first estimate signal; and a third summer configured to generate a second error signal indicating a second error gradient based on the second estimate signal. The first summer is configured to generate the output signal based on (i) the first error signal and (ii) the second error signal.

Abstract: A data storage device is disclosed that receives a read command from a host, wherein the read command comprises a read logical block address (LBA_R). A target data sector is read in response to the LBA_R to generate a read signal. The read signal is processed to detect user data and redundancy data using a soft-output detector that outputs quality metrics for the user data and redundancy data. A high quality metric is assigned to the LBA_R, and errors are corrected in the user data using an error correction code (ECC) decoder in response to the quality metrics output by the soft-output detector and the quality metrics assigned to the LBA_R.

Abstract: Methods and circuits comprising a reliability measurement unit (RMU) for generating log-likelihood ratio (LLR) values corresponding to 1T for use in a soft output Viterbi algorithm (“SOVA”) decoder. The RMU operates with an nT clock signal. 1T signals generated by an add, compare, select circuit (ACS) of the SOVA generates 1T decision data and a path equivalency detector generates 1T path equivalency information for 1T SOVA decoding and applies the 1T data to the RMU operating with an nT clock frequency (1/n'th that of the 1T clock signal). The nT RMU receives a plurality of 1T inputs on each nT clock signal pulse and generates 1T LLR information for use by the SOVA decoder. Other components of the SOVA may also operate using the nT clock signal pulse or may operate using a 1T clock signal.

Abstract: A Viterbi decoder includes a survival memory unit, for storing a plurality of survivor metric into a writing column of a writing bank of a plurality of banks in alternating intervals of a clock according to a writing bank order and a writing column order, and a trace back unit, for reading a reading column of each bank not performing storing operations according to a reading bank order and a reading column order in every interval of the clock.

Abstract: Methods and apparatus are provided for performing SOVA detection at higher data rates than achievable with conventional designs. A received signal is processed by (i) determining at least three selection signals that define a plurality of paths through a multiple-step trellis into a given state, wherein a first of the plurality of paths is a winning path for each single-step-trellis period of a multiple-step-trellis cycle, a second path is a winning path for a first single-step-trellis period and is a losing path for a second single-step-trellis period of a multiple-step-trellis cycle and a third path is a losing path for a first single-step-trellis period and is a winning path for a second single-step-trellis period of a multiple-step-trellis cycle; and (ii) determining at least one reliability value (such as a reliability value for a bit decision associated with a maximum-likelihood path through the multiple-step trellis or a plurality of reliability values for each multiple-step-trellis cycle).

Abstract: Provided is a method and apparatus for receiving a signal for a MIMO system. The receiving apparatus includes: a QR decomposer for calculating a unitary matrix Q, an upper triangle matrix R, and a vector size for a received signal; a multiple dimension detector for calculating a first LLR for an output of the QR decomposer through multiple dimension detection; an inverse matrix and weight calculator for calculating an inverse matrix for the upper triangle matrix R and a weight; an interference remover for regenerating a symbol for a demodulated data stream using the fist LLR and removing interference from an output vector of the QR decomposer using the regenerated symbol; and a weight zero forcing unit for performing zero forcing on the interference removed output vector from the interference remover using the inverse matrix of the upper triangle matrix R and the weight and calculating a second LLR.

Abstract: A method and system for processing LLRs, in a receiver, of transmissions over a wireless telecommunication system, the method including receiving multiple soft symbols, selecting a set of appropriate instructions for LLR calculation for the soft symbols, arranging the soft symbols in a register of a processor according to the selected instructions, selecting an appropriate single instruction from the set of instructions to be implemented by the processor using the soft symbols in the register as operands, and calculating, by a computation unit, multiple LLR values for the multiple soft symbols, in parallel, by means of the selected instruction.

Abstract: A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

Abstract: A chunk of branch metric computation bits is generated including bits that correspond to transition bits of a possible chunk of transition bits that could have been generated by a state transition of a convolutional encoder of a transmitter. The bits of the chunk of branch metric computation bits are scrambled. A branch metric for the received chunk of soft scrambled code bits is calculated as a function of the scrambled bits of the chunk of branch metric computation bits and the soft scrambled code bits of the received chunk of soft scrambled code bits. The branch metric is indicative of the probability that the received chunk of soft scrambled code bits was originally generated by the convolutional encoder as the chunk of transition bits corresponding to the generated chunk of branch metric computation bits.

Abstract: Method and apparatus for generating a set of generator polynomials for use as a tail biting convolutional code to operate on data transmitted over a channel comprises: (0) specifying a constraint and a low code rate for a tail biting convolutional code, where the low rate code is lower than 1/n (n being an integer greater than 4); (1) selecting valid combinations of generator polynomials to include in a pool of potential codes, each valid combination being a potential code of the low rate code; (2) determining first lines of a weight spectrum for each potential code in the pool and including potential codes of the pool having best first lines in a candidate set; (3) determining best codes of the candidate set based on the first L number of lines in the weight spectrum; (4) selecting an optimum code(s) from the best codes; and (5) configuring a circuit(s) of a data transceiver to implement the optimum code(s).

Abstract: A decoding method and apparatus of a retransmission communication system are provided. In the decoding method and apparatus, weights are applied to error data and retransmitted data, and the resulting error data and the resulting retransmitted data are chase-combined. Therefore, it is possible to reduce the coding rate of combined data and enhance the reliability of decoding.

Abstract: A method and apparatus for decoding encoded data bits of a wireless communication transmission are provided. A set of a-priori bit values corresponding to known bit values of the encoded data bits may be generated. Decoding paths that correspond to decoded data bits that are inconsistent with the a-priori bit values may be removed from the possible decoding paths to consider, and decoding the encoded data bits by selecting a decoding path from remaining decoding paths of the possible decoding paths that were not removed. A-priori bit values may be extracted from various messages, such as DL-MAP, UL-MAP, RNG-REQ, and BW-REQ messages.

Abstract: One embodiment of the present includes a heterogenous, high-performance, scalable processor having at least one W-type sub-processor capable of processing W bits in parallel, W being an integer value, at least one N-type sub-processor capable of processing N bits in parallel, N being an integer value smaller than W by a factor of two. The processor further includes a shared bus coupling the at least one W-type sub-processor and at least one N-type sub-processor and memory shared coupled to the at least one W-type sub-processor and the at least one N-type sub-processor, wherein the W-type sub-processor rearranges memory to accommodate execution of applications allowing for fast operations.

Abstract: A receiving apparatus and method of a Maximum Likelihood (ML) scheme in a Single-Carrier (SC) system are provided. The apparatus includes at least two antennas, at least two Orthogonal Frequency Division Multiplexing (OFDM) demodulators, at least two subcarrier mappers, at least two OFDM modulators, and a detector. The antennas receive signals. The OFDM demodulators convert the signals into frequency domain signals. The subcarrier mappers confirm signals mapped to frequency domain subcarriers. The OFDM modulators convert the signals into time domain signals. The detector constructs at least one set for candidate transmission symbols and detects receive signals through ML detection using the set.