Abstract: Disclosed is a method for selecting a design option for a Viterbi decoder model. In some embodiments, the method includes deriving a set of design options for a Viterbi decoder model by differentiating at least one design parameter, where the at least one design parameter comprises at least a first value for a look-ahead parameter. The method further includes performing an evaluation of each design option in the set of design options in a multi-dimensional design space and, based on the evaluation of each design option, selecting a design option in the set of design options that (i) satisfies a predetermined energy efficiency constraint and (ii) yields at least a second value for the look-ahead parameter, wherein the second value is greater than the first value and satisfies a predetermined area budget.

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: A digital television (DTV) transmitter includes a first randomizer randomizing enhanced data; a Reed-Solomon (RS) frame encoder generating an RS frame; a block processor encoding data in the RS frame, outputting data symbols, interleaving the data symbols, and converting the interleaved data symbols into data bytes; a group formatting unit mapping the data bytes into data groups; a deinterleaver deinterleaving data of the data groups; a packet formatter outputting enhanced data packets; a multiplexer multiplexing the enhanced data packets with main data packets; a second randomizer randomizing the multiplexed main data packets and MPEG header data in the multiplexed enhanced data packets; a Reed-Solomon (RS) encoder RS encoding the multiplexed enhanced data packets; an interleaver interleaving data of the RS-encoded data packets; and a trellis encoding unit trellis encoding the interleaved data.

Abstract: Minimal hardware implementation of non-parity and parity trellis. More than one type of trellis can be represented using a minimal amount of hardware. In magnetic recording systems and other communication systems types, there is oftentimes a need to switch between trellises which support parity and ones which do not. Rules are presented herein which will ensure joint representation of more than one trellis while requiring minimal additional hardware when compared to representing only one trellis. To represent the non-parity trellis, emanating states, resultant states, and one or more expansion states (if needed) are all that is required. Any expansion states may also need to have its path metric and path memory corresponded to one of the resultant states to ensure proper detection according to the non-parity trellis.

Abstract: An encoding device and decoding device for improving an error floor while taking advantage of the features of a convolutional code capable of encoding/decoding an information sequence with an arbitrary length are disclosed. An error correction encoding section is provided with an LDPC-CC encoder and an LDPC-BC encoder. The LDPC-CC encoder acquires an LDPC-CC code word sequence by applying LDPC-CC encoding to a transmission information sequence. The LDPC-BC encoder acquires a parity sequence by applying LDPC-BC encoding to the LDPC-CC code word sequence. The LDPC-CC encoder further applies the LDPC-CC encoding to the parity sequence.

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: Various embodiments of the present invention provide apparatuses, systems and methods for data detection in a detector with a pruning control system. For example, a data detector is disclosed that includes a first set of counters operable to distinguish prunable data from non-prunable data in the data detector, a second set of counters operable to generate initial values for the first set of counters, and a prune control signal generator operable to generate a prune control signal based on the first set of counters. The second set of counters is operable to generate the initial values at least in part before a syncmark is detected in a data sector. The initial values are used to initialize the first set of counters when the syncmark is detected in the data sector. The prune control signal controls whether the data detector is allowed to prune a trellis.

Abstract: Apparatus and methods store error recovery data in different dimensions of a memory array. For example, in one dimension, block error correction codes (ECC) are used, and in another dimension, supplemental error correction codes, such as convolutional codes, are used. By using separate dimensions, the likelihood that a defect affects both error recovery techniques is lessened, thereby increasing the probability that error recovery can be performed successfully. In one example, block error correction codes are used for data stored along rows, and this data is stored in one level of multiple-level cells of the array. Supplemental error correction codes are used for data stored along columns, such as along the cells of a string, and the supplemental error correction codes are stored in a different level than the error correction codes.

Abstract: According to one embodiment, a transmitting system includes: a randomizer for randomizing mobile service data; a processor for Serial Concatenated Convolutional Coding (SCCC) outer-encoding the randomized mobile service data; a first formatter for forming a first data group including the SCCC outer-encoded mobile service data; a deinterleaver for deinterleaving data of the first data group to output a second data group comprising data packets including a portion of the deinterleaved data, wherein the data packets are spaced at least one data packet apart; and a trellis encoder for trellis encoding the deinterleaved data.

Abstract: The present disclosure describes a method, performed by a data processor comprising a cyclic redundancy check (CRC) module configured for calculating CRC remainders for encoded data and a comparator comprising a shift register, for making a cyclic redundancy check of an encoded data record of bit length L, in which at least A bits of the record represent content data and at least B bits represent check data. A system for performing a cyclic redundancy check is also described.

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 digital television (DTV) transmitter/receiver and a method of processing data in the DTV transmitter/receiver are disclosed. In the DTV transmitter, a pre-processor pre-processes the enhanced data by coding the enhanced data for forward error correction (FEC) and expanding the FEC-coded enhanced data. A data formatter generates enhanced data packets including the pre-processed enhanced data and inserts known data to at least one of the enhanced data packets. A first multiplexer multiplexes the enhanced data packets with main data packets including the main data. And, an RS encoder RS-codes the multiplexed main and enhanced data packets, the RS encoder adding systematic parity data to each main data packet and adding RS parity place holders to each enhanced data packet. Herein, the RS encoder may insert non-systematic RS parity data or null data into the RS parity place holders included in each enhanced data packet.

Abstract: Various embodiments of the present invention provide apparatuses, systems and methods for data detection in a detector with soft pruning. For example, a data detector is disclosed that includes a branch metric calculator operable to calculate branch metrics for transitions between states in a trellis for the data detector, and a branch metric offset circuit operable to apply branch metric offsets to the branch metrics to yield soft pruned branch metrics. The branch metric offsets comprise a range of probability values from zero percent to one hundred percent.

Abstract: Provided is a terrestrial digital broadcasting transmitter. The terrestrial digital broadcasting transmitter may include a Reed-Solomon (RS) encoder to RS-encode an inputted broadcast signal, a forward error correction (FEC) encoder to channel-encode an inputted additional signal associated with the broadcast signal, a selector to select the RS-encoded broadcast signal or the channel-encoded additional signal, and a vestigial side band (VSB) transmitting part to transmit, to a receiver via a transmitting antenna, the selected signal, the selected signal being the RS-encoded broadcast signal or the channel-encoded additional signal selected by the selector.

Abstract: A system and method for the quantization of channel state vectors is provided. A method for communications node operation includes measuring a communications channel between the communications node and a controller, generating channel state information based on the measurement, computing a bit representation of the channel state information, transmitting the bit representation to the controller, and receiving a transmission from the controller. The computing makes use of tail-biting trellis decoding, and the transmission makes use of the channel state information transmitted by the communications node.

Abstract: Techniques for generating soft values for parity bits in a convolutional decoding process are disclosed. An exemplary method comprises, for each of at least one iteration in at least one soft-input soft-output decoder, calculating intermediate probability values for each possible transition between a first plurality of candidate decoder states at a first time and a second plurality of candidate decoder states at a second time. Two or more partial sums are then computed from the intermediate probability values, wherein the partial sums correspond to possible combinations of two or more systematic bits, two or more parity bits, or at least one systematic bit and at least one parity bit. Soft values, such as log-likelihood values, are then estimated for each of at least one systematic bit and at least one parity bit of the received communications data corresponding to the interval between the first and second times, based on the partial sums.

Abstract: When a change in sub-channel selection is made after a mobile/handheld (M/H) Frame is begun, an M/H receiver is for some time unable to correct byte errors by transverse Reed-Solomon (TRS) decoding of turbo decoding results. Despite this, later stages of the M/H receiver are supplied data that cyclic-redundancy-check (CRC) decoding of Internet protocol (IP) packets does not find to be in error. Some of the IP packets comprise Service Map Table (SMT)-mobile/handheld (MH) data used to update SMT determining how the M/H receiver is operated. SMT-MH data that have not been subjected to TRS byte-error correction are kept from updating the SMT until those SMT-MH data are verified by later SMT-MH data subjected to TRS byte-error correction. Transmitting total number of Groups (TNOG) information for the currently received M/H Frame in all its sub-frames speeds up acquisition of Fast Information Channel updates by the M/H receiver.

Abstract: Systems and methods for encoding user information and decoding signal vectors using fractional encoding/decoding and set partitioning. A fractional encoder can select a coset for transmitting or storing user information based on one or more deterministic bits and on encoded user information. The deterministic bits limit the encoder to using only a subset of the available signal vectors in a modulation scheme. A fractional decoder can receive a signal vector, and can find at least two nearest neighbors in each dimension. The fractional decoder can form a set of potential signal vectors using only the at least two nearest neighbors. The decoder may determine which of these potential signal vectors are valid within the fractional signaling scheme, and can decode the received signal vector based on the valid potential signal vectors.

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: Aspects of a method and system for UMTS HSDPA Shared Control Channel processing may include calculating at a receiver, for each one of a plurality of control channels, a quality metric based at least one Viterbi Decoder state metric. A control channel may be selected on the basis of the quality metrics, where the quality metric is selected that provides maximum confidence. The selected control channel may be chosen if its corresponding 3GPP metric is greater than a specified threshold, where the threshold is a design parameter. A validity of a selected control channel may be determined based on consistency and a CRC, where the CRC may be derived from decoding a sub-frame. The calculating and selecting may be done for a first slot of a sub-frame for High-Speed Shared Control Channels.

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: Data to be more robustly transmitted within 8VSB broadcast DTV signals are turbo coded using parallel concatenated convolutional coding (PCCC) and incorporated within the segments of data fields, the bytes of which are convolutionally interleaved before trellis coding and 8VSB symbol mapping. Packing the PCCC into payload fields of MPEG-2-compatible null data packets and Reed-Solomon coding the packets to generate the segments of data fields, the bytes of which are convolutionally interleaved, conditions legacy DTV receivers to disregard PCCC components not useful to them. Transversal packing turbo-coded Reed-Solomon codewords into the payload fields of MPEG-2-compatible null data packets increases the capability of those turbo-coded Reed-Solomon codewords to overcome burst errors. Repeated transmissions of the transversally packed turbo-coded Reed-Solomon codewords in whole or in part allows them to overcome protracted deep fades encountered during mobile reception of 8VSB DTV signals.

Abstract: A method and apparatus for increasing the data rate and providing antenna diversity using multiple transmit antennas is disclosed. A set of bits of a digital signal are used to generate a codeword. Codewords are provided according to a channel code. Delay elements may be provided in antenna output channels, or with suitable code construction delay may be omitted. n signals represent n symbols of a codeword are transmitted with n different transmit antennas. At the receiver MLSE or other decoding is used to decode the noisy received sequence. The parallel transmission and channel coding enables an increase the data rate over previous techniques, and recovery even under fading conditions. The channel coding may be concatenated with error correction codes under appropriate conditions.

Abstract: A detector recovers servo data from a servo signal generated by a read-write head, and determines the head-connection polarity from the recovered servo data. Such a detector allows a servo circuit to compensate for a reversed-connected read-write head, and thus allows a manufacturer to forego time-consuming and costly testing to determine whether the head is correctly connected to the servo circuit.

Abstract: A survivor path memory is provided for a Viterbi detector. The survivor path memory comprises a plurality of columns, each associated with a different time step, and an input processor. Each column comprises a flip flop for storing one bit or portion of a bit sequence associated with a Viterbi state; and a multiplexer for each state controlled by a case signal indicating a time step, the multiplexer selecting a state from a previous time step, wherein an output of the multiplexer of a given state is connected to at least one data input of a flip flop of the given state. The input processor generates a control signal that exchanges one or more pointers based on a trellis structure, wherein each of the pointers points to one of the flip flops.

Abstract: Some demonstrative embodiments include devices, systems and/or methods of turbo decoding. For example, a device may include a turbo decoder to decode a turbo-encoded input according to a turbo code, the turbo-encoded input including a plurality of soft-decision information-bit values and a plurality of soft-decision parity-bit values corresponding to the soft-decision information bit values, wherein the turbo decoder is to output a plurality of extrinsic soft-decision parity-bit values corresponding to the plurality soft-decision parity-bit values. Other embodiments are described and claimed.

Abstract: A receiver of a digital signal equipped with an N-state weighted-decision trellis Viterbi decoder, the signal received including a series of symbols, is provided. The receiver comprises a programmable logic circuit that includes a source memory A and a destination memory B each comprising N rows and M+L columns respectively allocated to M fixed fields for describing the trellis, and to L variable fields, and an operator able to calculate the variable fields of a memory as a function of the fixed fields of the said memory, of the symbols received and of the variable fields of the other memory and able to reverse the role of the source memory and destination memory.

Abstract: A trellis encoder for trellis encoding a dual transmission stream. A first multiplexer selectively outputs one of a predetermined first bit of the dual transmission stream and a value stored in a first memory according to an external control signal. A first adder adds the value output from the first multiplexer to the value stored in the first memory, outputs the added value, and stores the added value in the first memory. A second multiplexer selectively outputs one of a predetermined second bit of the dual transmission stream and a value stored in a second memory according to the external control signal. A second adder adds the value output from the second multiplexer to the value stored in the second memory and stores the added value in a third memory. Thus, an initialization is effectively performed before trellis encoding is performed.

Abstract: A digital broadcast transmitting/receiving system and a method for processing data are disclosed. The method for processing data may enhance the receiving performance of the receiving system by performing additional coding and multiplexing processes on the traffic information data and transmitting the processed data. Thus, robustness is provided to the traffic information data, thereby enabling the data to respond strongly against the channel environment which is always under constant and vast change.

Abstract: A method and apparatus for increasing the data rate and providing antenna diversity using multiple transmit antennas is disclosed. A set of bits of a digital signal are used to generate a codeword. Codewords are provided according to a channel code. Delay elements may be provided in antenna output channels, or with suitable code construction delay may be omitted. n signals represent n symbols of a codeword are transmitted with n different transmit antennas. At the receiver MSLE or other decoding is used to decode the noisy received sequence. The parallel transmission and channel coding enables an increase the data rate over previous techniques, and recovery even under fading conditions. The channel coding may be concatenated with error correction codes under appropriate conditions.

Abstract: A method for low-density parity-check hard decision decoding includes computing, for every decoding iteration, a discrepancy of extrinsic messages responsive to channel inputs of a receiver, performing a flipping of the channel inputs responsive to a comparison of the discrepancy of extrinsic messages to a flipping threshold, the flipping threshold for each decoding iteration being determined based on a threshold computation responsive to a channel error probability estimation in a first iteration of a decoding of the channel inputs, and check node decoding responsive to the flipping of channel inputs.

Abstract: Good transmission characteristics are achieved in the presence of fading with a transmitter that employs a trellis coder followed by a block coder. Correspondingly, the receiver comprises a Viterbi decoder followed by a block decoder. Advantageously, the block coder and decoder employ time-space diversity coding which, illustratively, employs two transmitter antennas and one receiver antenna.

Abstract: A digital broadcasting system for transmitting/receiving a digital broadcasting signal and a data processing method are disclosed. First program table information and second program table information, which has an identifier different from an identifier of the first program information, are multiplexed and transmitted. The first program table information describes main service data through fixed reception channel, while the second program information described mobile service data through mobile reception channel. Thus, a broadcast receiving system can receive and output the mobile service data by parsing the second program table information.

Abstract: A method is provided for quantizing an input signal. The number of equal quantized values during a period of time is counted thereby obtaining said number of counts. The counts exceeding a count threshold being defined as reliable counts, the counts lower than or equal to the count threshold being defined as unreliable counts. Two unreliable counts are calculated using a lower and a higher value for a first parameter in an extrapolating function. The first parameter is considered equivalent to the lower value if the two unreliable counts differ less than or equal to a count difference. The invention further discloses a corresponding tail extrapolator.

Abstract: Systems and methods for processing and decoding TCM/BCM-coded signal vectors. A multi-dimensional signal vector is received by, for example, a TCM or BCM decoder. The TCM/BCM decoder identifies the closest signal points in the signal constellation set, or “nearest neighbors,” for each dimension of the received signal vector. The TCM/BCM decoder then forms a test set that includes a plurality of multi-dimensional test vectors, where each dimension of each test vector is based on an identified nearest neighbor. In particular, each test point in the test set is based on a different combination of the nearest neighbors. The TCM/BCM decoder can compute branch metrics based on only the test points in the test set, and can make detection decisions using the computed branch metrics.

Abstract: The present techniques provide systems and methods for decoding an optical data signal returned from an optical disc to retrieve source information. The decoding method is based on a 16 state trellis diagram, and may decode an optical data signal encoded through a modulation code where the input-to-output relationship is not convolutional, such as the 17 Parity Preserve/Prohibit (17pp) modulation code. A trellis diagram may enable non-convolutional trellis-modulated data to be more efficiently decoded. Further, the 16 state trellis diagram of the present techniques provides a unique path for each input-to-output bit pair, such that no information about input bits may be lost on parallel paths in a trellis diagram.

Abstract: A vestigial sideband (VSB) modulation transmission system and a method for encoding an input signal in the system are disclosed. According to the present invention, the VSB transmission system includes a convolutional encoder for encoding an input signal, a trellis-coded modulation (TCM) encoder for encoding the convolutionally encoded signal, and a signal mapper mapping the trellis-coded signal to generate a corresponding output signal. Different types of the convolutional encoders are explored, and the experimental results showing the performances of the VSB systems incorporating each type of encoders reveals that a reliable data transmission can be achieved even at a lower input signal to noise ratio when a convolutional encoder is used as an error-correcting encoder in a VSB system.

Abstract: Systems and methods are provided for generating error events for decoded bits using a Soft output Viterbi algorithm (SOYA). A winning path through a trellis can be determined and decoded information can be generated. Path metric differences can be computed within the trellis based on the winning path. A plurality of error event masks and error event metrics can be generated based on the decoded information and the path metric differences.

Abstract: A digital broadcast transmitting system and a signal processing method thereof that improves the receiving performance of the system. A digital broadcast transmitter includes a randomizer to receive and randomize a transport stream into a specified position of which stuff bytes are inserted, a replacement sequence generator to generate known data including a predefined sequence, a stuff-byte exchange unit to insert the known data into the specified position of the transport stream into which stuff bytes are inserted, an encoder to encode the transport stream output from the stuff-byte exchange unit for an error correction, and a transmission unit to modulate the encoded transport stream, RF-convert the modulated transport stream and transmit the RF-converted data. The digital broadcast receiving performance is improved even in an inferior multi-path channel by detecting the known data from the received transmission and using the known data for synchronization and equalization.

Abstract: A method of processing broadcast data in a broadcast transmitter includes performing, by a Reed-Solomon (RS) encoder, RS encoding and Cyclic Redundancy Check (CRC) encoding on mobile service data and building at least primary RS frames belonging to a primary ensemble or secondary RS frames belonging to a secondary ensemble depending on RS frame mode information that indicates a single frame mode or a dual frame mode; mapping each of the built at least primary or secondary RS frames into groups, wherein each of the groups includes known data sequences, a fast information channel (FIC) segment, and transmission parameter channel (TPC) data; and transmitting a transmission frame containing the groups.

Abstract: A Low Density Parity Check (LDPC) encoding apparatus and method are provided. The LDPC encoding apparatus includes a controller for determining a number of zeros b to be inserted in an input information vector when a length of the input information vector is less than a length of a use information vector of a parity-check matrix, for selecting b stopping sets Sd using the parity-check matrix, for selecting one variable node from each of the b stopping sets Sd using a selection scheme, and for determining positions corresponding to the selected variable node from each of the b stopping sets Sd as positions where zeros are to be inserted.

Abstract: Various aspects of a method for minimum mean square error soft interference cancellation (MMSE-SIC) based sub-optimal maximum likelihood (ML) detection for a multiple input multiple output (MIMO) wireless system may comprise selecting at least one constellation point in a constellation map based on at least one of a plurality of received symbols. A number of the at least one constellation point may be less than or equal to a number of previously selected constellation points in a previous constellation map. At least one of the plurality of received symbols may be decoded based on the selected at least one constellation point.

Abstract: A system and method for non-uniform bit allocation in the quantization of channel state vectors is provided. A method for communications node operation includes receiving a bit-allocation profile for use in quantizing channel state information, measuring a communications channel between the communications node and a controller, generating channel state information based on the measurement, computing a bit representation of the channel state information, transmitting the bit representation to the controller, and receiving a transmission from the controller. The computing makes use of quasi-tail-biting trellis decoding, and the computing is based on the bit-allocation policy. The transmission makes use of the channel state information transmitted by the communications node.

Abstract: A Viterbi pack instruction is disclosed that masks the contents of a first predicate register with a first masking value and masks the contents of a second predicate register with a second masking value. The resulting masked data is written to a destination register. The Viterbi pack instruction may be implemented in hardware, firmware, software, or any combination thereof.

Abstract: Certain embodiments of the present invention are improved turbo-equalization methods for decoding encoded codewords. In one embodiment, in global decoding iteration i, the magnitude values of all decoder-input LLR values (Lch) are adjusted based on the number b of unsatisfied check nodes in the decoded codeword produced by global iteration i?1. The improved turbo-equalization methods can be used as the sole turbo-equalization method for a given global decoding session, or interleaved with other turbo-equalization methods.

Abstract: A method and system for storing data in a multi-level cell (MLC) flash memory device are described. The method includes receiving data for storage in the flash memory device, the flash memory device comprising an array of MLC flash memory cells, and encoding the received data into non-binary symbols according to a trellis-coded modulation scheme. The method further includes writing each of the non-binary symbols to a respective flash memory cell set, wherein each flash memory cell set comprises a plurality of MLC flash memory cells.

Abstract: Techniques for generating soft values for parity bits in a convolutional decoding process are disclosed. An exemplary method comprises, for each of at least one iteration in at least one soft-input soft-output decoder, calculating intermediate probability values for each possible transition between a first plurality of candidate decoder states at a first time and a second plurality of candidate decoder states at a second time. Two or more partial sums are then computed from the intermediate probability values, wherein the partial sums correspond to possible combinations of two or more systematic bits, two or more parity bits, or at least one systematic bit and at least one parity bit. Soft values, such as log-likelihood values, are then estimated for each of at least one systematic bit and at least one parity bit of the received communications data corresponding to the interval between the first and second times, based on the partial sums.

Abstract: A baseband processing module of a wireless terminal includes a Turbo decoding module. The Turbo decoding module decodes a Turbo code word to produce one or more Media Access Control (MAC) packet(s) carried by the turbo decode word. Each MAC packet includes a MAC packet header and the MAC packet payload, which carries one or more Radio Link Control (RLC) Packet Data Units (PDUs). The Turbo decoding module decodes the MAC packet header to determine boundaries of the PDUs carried in the MAC packet payload. The Turbo decoding module decodes RLC PDU headers and RLC PDU payloads of the RLC PDUs. The Turbo decoding module writes the decoded MAC packet header, the decoded RLC PDU headers, and the decoded RLC PDU payloads to memory in a word-aligned format. The Turbo decoding module may also operate in various other Turbo decoding modes.

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: Provided is a system and method for terrestrial digital broadcasting service using a single frequency network without additional equipment. The system and method synchronizes input signals into transmitting stations by inserting a transmission synchronization signal into a header of TS periodically, and solves the problematic ambiguity of the trellis encoder by including a trellis encoder switching unit separately and initializing a memory of the trellis encoder. The terrestrial digital broadcasting system includes: a broadcasting station for multiplexing video, voice and additional signals into transport stream (TS) and transmitting the TS to the transmitting stations and a transmitting stations for receiving the TS and broadcast the TS to receiving stations through a single frequency network.