Abstract: A cyclo-stationary characteristic of a communications channel and/or storage media is determined. The cyclo-stationary characteristic has K-cycles, K>1. Markov transition probabilities are determined that depend on a discrete phase ?=t mod K, wherein t is a discrete time value. An encoder to optimize the Markov transition probabilities for encoding data sent through the communications channel and/or stored on the storage media. The optimized Markov transition probabilities are used to decode the data from the communication channel and/or read from the storage media.

Abstract: Provided is a signal modulation apparatus configured to modulate an input signal into a multidimensional QAM signal using multidimensional QAM, in which Multidimensional QAM is QAM in which two-dimensional QAM is configured in a multidimensional manner using a plurality of consecutive time slots, a constellation for multidimensional QAM is part of a combination of a constellation of first two-dimensional QAM, and a constellation of second two-dimensional QAM.

Abstract: A receiver includes an error correction module. A syndrome value, calculated based on received signals, may be used to enable the error correction module. The error correction module includes an error generator, a Nyquist error estimator, and a decoder. The decoder uses error estimation generated by the Nyquist error estimator to correct the decoded data. There are other embodiments as well.

Abstract: A decoder that is a decoding apparatus includes an error-correction decoder that executes error correction decoding processing of iteratively performing decoding processing with a window size and the number of decoding iterations indicated by decoding parameters, on received data converted into a spatially coupled low-density parity-check code, and a decoding parameter control unit that updates the decoding parameters on the basis of a decoding result obtained by the iteratively executed decoding processing.

Abstract: Methods, systems, and apparatuses include receiving a codeword stored in a memory device. The codeword is error corrected for a first number of iterations. The error correction includes traversing the codeword according to a first order. The codeword is error corrected for a second number of the iterations. The error correction of the codeword during a second iteration from the second number of iterations includes traversing the codeword according to a second order that is different from the first order.

Abstract: A data processing method is provided. The method includes receiving a single aggregated data stream from a data aggregation device. The aggregated data stream includes multiple data packets captured by multiple video capture devices respectively, and each data packet has an identifier of the video capture device that captures the data packet. The method further includes determining multiple videos associated with the multiple video capture devices from the aggregated data stream based on the identifiers. Each video includes data packets with the same identifier.

Abstract: According to one embodiment, a magnetic disk device includes a disk, a head that writes data to the disk and reads data from the disk, and a controller that corrects a first signal into a first likelihood value by machine learning based on a correct learning signal set with a likelihood other than 1 and an incorrect learning signal set with a likelihood other than 0 and executes error correction processing based on a second likelihood value according to the first signal and the first likelihood value.

Abstract: A memory controller is provided for reading and writing to and from a memory module. The memory controller implements an error correction algorithm, which calculates error correction code for message data to be written to the memory module and checks the error correction code against the message data when the data is read out of the memory module. The memory controller spreads each codeword over at least four different beats sent over the interface with the memory module, with each beat comprising a symbol of error correction code. Bits of a particular symbol of message data occupy the same positions in different beats. Since the bits of the symbols occupy the same positions in different beat, the number of bits affected by a hardware error is minimised. With four symbols of error correction code available for use in the codeword.

Abstract: The present invention relates to a system for demodulating or blind searching the characteristics of digital telecommunication signals, characterized in that it comprises at least one hardware architecture or hardware and firmware comprising memories and one or more processing units for implementing a network of specific computation blocks connected together, including a first specialized block of the network estimating at least one filter for acquiring the blind signal, and a second block subsequently producing at least one module for estimating the amplification of the observed signals in order to subsequently assess the other characteristics of the signals observed by the other computation blocks of the network, at least a third specialized computation block producing a decision-making module for computing an error signal and back-propagating the computed errors to each of the preceding residual blocks (“propagate”, “update”).

Abstract: A method for data retrieval includes receiving a set of probability metrics. A set of probability metrics is received for each one of a plurality of read values, and each probability metric of the set of probability metrics corresponds to a statistical likelihood that the read value is representative of one of a number of symbols. The symbols define a set of allowed transitions between a number of states, and a series of successive allowed transitions between states define allowed paths between the states. The method further includes determining a survival path between the states. The survival path is based on an accumulation of probability metrics corresponding to the statistical likelihood that successive ones of the plurality of read values are representative of successive ones of the symbols defining each transition in the survival path. The method further includes decoding a symbol stream based on the survival path.

Abstract: A Viterbi Equalizer having a limited number of stages is disclosed. In some embodiments, the Viterbi Equalizer may have only four stages. The Viterbi Equalizer produces soft decisions, which comprise a final decision and reliability information related to that final decision. The Viterbi Equalizer is able to provide reliability information even if all paths do not converge on the final decision at the last stage. The reliability information is calculated based on if and when the paths in the trellis converge on a final decision. This reliability information can be used downstream, such as by another Viterbi Algorithm block to perform forward error correction. The use of soft decision provides gains of up to several dB in performance. Additionally, the Viterbi Equalizer is low cost and readily implemented in hardware or software.

Abstract: An optical communication system is provided in which a serial/parallel converting unit outputs bit sequences of sequence groups a number of which is determined by a logarithmic value and a bit sequence of a highest-order sequence group, a converting unit converts the bit sequence of the sequence group input to the converting unit into a bit sequence for which a probability of occurrence of 0 or a probability of occurrence of 1 is a predetermined probability of occurrence, a selecting unit acquires a bit sequence for which the probability of occurrence is converted by a converting unit higher in order than the converting unit for the selecting unit, and selects an order of output of a symbol to other selecting units in the sequence groups higher in order than the selecting unit in accordance with the acquired bit sequence, a multiplication unit multiplies a value representing the symbol selected by a highest-order selecting unit, by a number in accordance with the bit sequence of the highest order sequence gro

Abstract: A device includes a data path, a first interface connected to the data path and configured to receive a request from a processor package to write a data value to a memory address, and a controller connected to the data path and configured to receive the request to write the data value to the memory address and to calculate a Hamming code of the data value. The controller is configured to transmit the data value and the Hamming code on the data path. The device includes an external memory interleave connected to the data path. The external memory interleave is configured to receive the data value and calculate a test Hamming code of the data value and to determine whether to send the data value to an external memory interface to be written to the memory address based on a comparison of the Hamming code and the test Hamming code.

Abstract: A decoding apparatus includes a multi-input branch metric calculation unit configured to calculate, by using a branch label corresponding to a path extending toward a state S at a time point N in a trellis diagram and a plurality of reception signal sequences, a branch metric in the state S, a path metric calculation unit configured to calculate a path metric in the state S at the time point N, and a surviving path list memory configured to store path labels corresponding to L path metrics among a plurality of calculated path metrics. The path metric calculation unit generates a path label in the state S at the time point N by combining the branch label with a path label in each of the states at the time point N?1 and the surviving path list memory outputs path labels corresponding to L path metrics.

Abstract: The present invention discloses a Trellis-Coded-Modulation (TCM) decoder applied in a receiver, wherein the TCM decoder includes a branch metric unit, a path metric unit, a trace-back length selection circuit and a survival path management circuit. In operations of the TCM decoder, the branch metric unit is configured to receive multiple input codes to generate multiple sets of branch information. The path metric unit is configured to calculate multiple survival paths according to the multiple sets of branch information. The trace-back length selection circuit is configured to select a trace-back length, wherein the trace-back length is determined according to a signal quality of the receiver. The survival path management circuit is configured to return the multiple survival paths for the trace-back length in order to generate an output code.

Abstract: The method whereby user equipment receives a downlink signal in a wireless communication system, according to one embodiment of the present invention, comprises: receiving, from a base station, information on the length of a cyclic redundancy check (CRC) sequence to be added to information bits; receiving a downlink signal; and decoding the downlink signal by using a CRC sequence in the downlink signal on the basis of the information on the length of the CRC sequence, wherein the information on the length of the CRC sequence indicates a first length added for list decoding or a total CRC length obtained by adding the first length.

Abstract: A cable having good flammability performance and reduced smoke emission is provided.

Abstract: Methods, apparatuses, and systems for implementing error-correction in communication systems, particularly wireless communication systems, are provided. A Polar code-based encoding method combines first and second pluralities of information bits and error-correcting code bits, and a plurality of frozen bits, into an input vector. The input vector is encoded according to a Polar code to produce a first codeword, which improves the probability of successfully transmitting and receiving the codeword over a physical channel in the communication system.

Abstract: In accordance with an example embodiment of the present invention, disclosed is a method and an apparatus thereof for removing jitter introduced by a packet switched network. Each received audio frame comprises a primary portion and a redundancy portion. The redundancy portion comprises a partial redundant copy of a previous frame that is offset by k frames. If a frame n is lost, a frame n+k that comprises the partial redundant copy of the lost frame n, is located in a jitter buffer. Based on the frame n+k, a substitute frame n? substituting the lost frame n is created and a substitution indicator of the substitute frame n? is set to indicate that the redundancy portion of the substitute fame n? should be used in decoding.

Abstract: A method of arrangement of an algorithm to calculate cyclic redundancy check (CRC) independent of the length of a polynomial generator and data stream which can be realized in digital implementation with a calculation latency of once clock cycle. The method allows a sequence of information and the corresponding polynomial generator be arranged into a transformation table.

Abstract: An embodiment encoder device for encoding an information word c=[c0, c1, . . . , cK-1] having K information bits, ci, includes an encoder for a tail biting convolutional code having a constraint length, L, where K<L?1; the encoder being configured to receive the K information bits; and encode the K information bits so as to provide an encoded code word. An embodiment decoder device for determining an information word c=[c0, c1, . . . , cK-1], having K information bits, ci, includes a decoder for a tail biting convolutional code having a constraint length, L, where K<L?1; the decoder being configured to: receive an input sequence; compute at least one reliability parameter based on the received input sequence; and determine an information word c based on the at least one reliability parameter.

Abstract: Certain aspects of the present disclosure relate to techniques and apparatus for increasing decoding performance and/or reducing decoding complexity. An exemplary method generally includes receiving, via a wireless medium, a codeword encoded using a tailless convolutional code (TLCC) with a known start state, evaluating a set of decoding candidate paths through a trellis decoder that originate at the known start state of the TLCC, performing, for each of a plurality of the decoding candidate paths, a back trace from a respective end state to the known start state, and selecting one of the decoding candidate paths based, at least in part, on path metrics generated while performing the back trace. Other aspects, embodiments, and features are also claimed and described.

Abstract: Control logic determines when a network condition has changed by evaluating network condition data. Based on a detected network condition change, the control logic reorders an encoder parameter controller execution sequence of a plurality of encoder parameter controllers. The control logic configures the plurality of reordered encoder parameter controllers so that an encoder parameter determination from a prior encoder parameter controller is used as a decision input for a subsequent encoder parameter controller. An encoder encodes data, such as audio data, video data or other type of data using the generated encoder control parameters from the reordered plurality of encoder parameter controllers. A related method is also disclosed.

Abstract: A processing device includes a processor core and a number of calculation modules that each is configurable to perform any one of operations for a convolutional neuron network system. A first set of the calculation modules are configured to perform convolution operations, a second set of the calculation modules are reconfigured to perform averaging operations, and a third set of the calculation modules are reconfigured to perform dot product operations.

Abstract: A controller for controlling a system includes a non-transitory computer-readable memory storing data for an operation and a control of the system and at least one processor operatively connected to the memory for determining a control signal transitioning a state of the system from a current state to a next state. At least two instances of the data are stored in the memory with different precisions defined by numbers of bits storing the instance in the memory. The processor determines the control signal using the instances of the data with the different precisions.

Abstract: A mobile communication device may include a radio transceiver configured to transmit and receive communication signals, and a baseband modem circuit configured to determine a decoded information field of a first encoded system information packet, set one or more bits of the decoded information field as an initial encoder state of a convolutional decoder for decoding the first encoded system information packet, decode the first encoded system information packet with the initial encoder state to obtain a first decoded system information packet, and use the decoded system information packet to transmit or receive data with one or more network cells.

Abstract: An intelligent multi-level resource discovery and analysis system and method identify and characterize physical, logical and virtual resources of a multi-vendor, multi-class, multi-layer network by automatically generating and sending discovery commands that query resources as to their addresses, identities, characteristics and operational states, and by analyzing responses to the commands to identify continuously and in real time resource vendors, types, operating states, configurations of resources and network topology, and changes to resource and network conditions. Externally entered or dynamically discovered discovery parameters define the types and level of detail of information discovered and analyzed.

Abstract: A Bluetooth Low Energy (BLE) device, having a demodulator configured to translate in-phase and quadrature components of a received BLE signal into a differential phase signal; an estimator configured to estimate a frequency offset of the differential phase signal; and a detector configured to detect information in the differential phase signal corrected by the estimated frequency offset.

Abstract: A method of decoding a signal that has been encoded by a tail-biting code based on at least one encoding parameter is disclosed. The at least one encoding parameter may be a trellis size or a quantity of aggregated encoding elements or a code rate. The method is suitable for use in a communication device and comprises receiving the signal, performing a first decoding attempt of the signal based on a first set of starting state metrics and a first encoding parameter hypothesis, the first decoding attempt resulting in a first set of ending state metrics. The method further comprises performing, if the first decoding attempt fails, a second decoding attempt of the signal based on a second set of starting state metrics based on the first set of ending state metrics and a second encoding parameter hypothesis different from the first encoding parameter hypothesis.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for decoding parameters for Viterbi search are disclosed. In one aspect, a method includes the actions of receiving lattice data that defines a plurality of lattices. The actions include for each defined lattice determining a particular path that traverses the lattice; determining a node cost of a path from the start node to the frame node; determining a beam size for each frame; determining a beam cost width for each frame; determining a maximum beam size from the beam sizes determined for frames; and determining a maximum beam cost width from the beam cost widths determine for the frames. The actions include selecting a particular beam size and a particular beam cost width. The actions include determining paths for additional lattices using the pruning parameters of the particular beam size and the particular beam cost width.

Abstract: A communication device is configured to communicate coded information to other communication device(s). The communication device uses NCPs to indicate locations of codewords within signal(s) transmitted to the other communication device(s). The communication device is configured to encode NCP(s) using an FEC code to generate coded NCP(s) and also to encode the NCP(s) using a cyclic redundancy check (CRC) code to generate NCP CRC bits. The communication device is also configured to encode the NCP CRC bits using the FEC code to generate coded NCP CRC bits. The communication device is then configured to generate OFDM or OFDMA symbol(s) include the coded NCP(s) and the coded NCP CRC bits to indicate beginnings of codeword(s) within at least one of the OFDM symbol(s) and/or additional OFDM symbol(s). The communication device is also configured to transmit the OFDM or OFDMA symbols to another communication device via a communication interface of the communication device.

Abstract: A method and system for soft output multiple-input-multiple-output (MIMO) decoding may include generating a tree-graph based on: MIMO rank, number of bits per layer, and type of modulation, wherein the tree-graph comprises a root node, leaf nodes, nodes, and branches connecting the nodes; performing sphere decoding by determining a radius covering a subset of nodes within said tree-graph; managing, based on the sphere decoding, tables comprising metrics and counter metrics usable for log likelihood ratio (LLR) generation; predicting, based on a specified prediction scheme, counter metrics for paths in the tree-graph that comprise nodes and branches out of the determined radius; and updating the tables comprising the counter metrics with the predicted counter metric, in a case that the predicted counter metrics are better in maximum likelihood terms than the determined counter metrics.

Abstract: A Viterbi decoding device to decode a signal produced by a convolutional encoder is described. The device may include: an analog-to-digital conversion unit to extract a soft symbol S=(S0, S1) from the signal, the soft symbol including a first sample value S0 and a second sample value S1; and a digital processing unit to compute, for each of the N states, a branch metric value of BM—0_K in dependence on the soft symbol S, K being an index identifying the respective state. The digital processing unit may store the soft symbol S as a complex number S=S0+J*S1 in a complex number format; and compute a complex branch metric value BM—0_(K, K?)=BM—0_K+J*BM—0_K? in a complex number format on the basis of the soft symbol S, with K different from K?.

Abstract: A communication system having a receiver with a linear path and a nonlinear path. As the receiver receives a data signal, it adaptively equalizes the received signal, and amplitude-limits the equalized signal in the nonlinear path using a saturable amplifier limiter or the like. A slicer extracts data from the limited equalized received signal. In the linear path, a clock recovery circuit generates a clock signal from the equalized received signal. A delay circuit in the linear path at least partially compensates for propagation delay in the limiter. Having the clock recovery occur in other than the nonlinear path, a low jitter clock is generated. The limiter enhances the vertical opening of the data eye by increasing the rise and fall times of the limited signal, providing more noise margin for the slicer to operate with and a greater timing margin in which to sample the sliced data.

Abstract: Methods and apparatus are disclosed for detecting a control channel message transmitted on one of a plurality of shared control channels and targeted to a wireless receiver. In an exemplary method, messages transmitted over a plurality of shared control channels are decoded, and at least one likelihood metric is determined for each of the decoded messages. A best candidate is selected from the decoded messages, based on the likelihood metrics, and the at least one likelihood metric for the best candidate is compared to corresponding likelihood metrics for the messages other than the best candidate to determine whether the best candidate is a valid message. Wireless communication receivers configured correspondingly are also disclosed.

Abstract: A communication system and a noise predictive calibration method are disclosed. The communication system includes a decoder configured to decode an input signal, wherein the decoder produces one of: a converged data output when the decoder decodes the input signal successfully, and a non-converged data output when the decoder decodes the input signal unsuccessfully. The communication system also includes a convergence monitor configured to determine a calibration procedure based on at least one of: a number of times where the decoder decodes successfully, and a number of times where the decoder decodes unsuccessfully. A noise predictive calibration circuit is configured to utilize output produced by the decoder without qualification when the convergence monitor indicates utilization of a first calibration procedure.

Abstract: An optical system may include a digital signal processor (DSP) to receive first samples of a digital signal. The first samples may be Hamming encoded. The DSP may correlate the first samples to multiple groups of second samples to determine multiple correlation values. Each of the multiple groups of second samples may correspond to respective code words. Each of the multiple correlation values may correspond to a correlation measurement between the first samples and each of the multiple groups of second samples. The DSP may determine a particular code word, of the multiple code words, corresponding to one of the correlation values of the multiple correlation values; determine output bits based on bits of the particular code word and the one of the correlation values; and provide the output bits. The output bits may include data associated with the digital signal.

Abstract: A computerized system and method for identifying one or more cryptographic operations from software code, comprising: performing processing associated with identifying, one or more cryptographic operations in the software code, the software code being run on a processor; and performing processing associated with identifying a boundary for each cryptographic operation in the software code.

Abstract: Systems and method relating generally to data processing, and more particularly to systems and methods for data synchronization and detection.

Abstract: In iterative decoding, a data recovery scheme corrects for corrupted or defective data by determining reliability metrics for blocks of decoded data. Block or windowed detectors generate block reliability metrics for data blocks (rather than individual bits) of decoded data using soft information from the regular decoding mode or from new iterative decoding iterations performed during error recovery mode. An error recovery system triggers corrective decoding of selected data blocks based on the block reliability metrics, by for example, comparing the block reliability metrics to a threshold or by selecting an adjustable number of the least reliable data blocks.

Abstract: It is decided whether to adjust data associated with a decoder. In the event it is decided to adjust the data associated with the decoder, the data is adjusted to obtain adjusted data and decoding is performed on the adjusted data. In the event it is decided to not adjust the data associated with the decoder, decoding is performed on the data associated with the decoder.

Abstract: A data storage device is disclosed comprising a non-volatile memory (NVM), wherein data is read from the NVM to generate a two dimension matrix of signal samples, including a first dimension and a second dimension. The matrix of signal samples is first equalized to reduce intersymbol interference (ISI) in the first dimension to generate second dimension signal samples, and second equalized to reduce ISI in the second dimension to generate first dimension signal samples. A first data sequence is detected in response to the first dimension signal samples, and a second data sequence is detected in response to the second dimension signal samples.

Abstract: Generating error data associated with decoding data is disclosed, including: processing an input sequence of samples associated with data stored on media using a detector and a decoder during a global iteration; and generating one or more error values based at least in part on one or more decision bits output by the detector or the decoder and the input sequence of samples.

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: Methods for programming memory cells. One such method for programming memory cells includes generating an encoded stream using a data stream and programming the memory cells using the encoded stream to represent the data stream. A particular bit position of the encoded stream has a first voltage level when the particular bit position of the data stream has a particular logical state, and the particular bit position of the encoded stream has either a second voltage level or a third voltage level when the particular bit position of the data stream has a logical state other than the particular logical state.

Abstract: The present invention includes generating a tie-breaking metric via a comparative tie-breaking metric training process, monitoring an output of a channel detector in order to identify a tie condition between a first log-likelihood ratio (LLR) value and a second LLR value of a symbol, and upon identifying a tie condition between the first LLR value and the second LLR value of the symbol, applying the generated tie-breaking metric to the symbol in order to assign a hard decision to the symbol.

Abstract: Systems and methods for computing sign disagreement between signals may implement one or more operations including, but not limited to: receiving an extrinsic log likelihood ratio (LLR) value; incrementing a sign-disagreement counter according to a sign disagreement between the extrinsic LLR value and an a priori LLR value; providing a value of the sign-disagreement counter to a binary short media defect (SMD) detector; and detecting one or more consecutive sign disagreements between an extrinsic output of a detector and an extrinsic output of a decoder.

Abstract: Certain aspects of the present disclosure relate to techniques for generating likely demodulation candidates using Vector Candidate Sampling (VCS). VCS is used to generate high likelihood candidates for Multiple Input Multiple Output (MIMO) demodulation that approaches optimal maximum a posteriori (MAP) performance with reasonable complexity. A receive data vector is recorded corresponding to a signal received at a MIMO receiver. A plurality of likely candidates are determined for MIMO demodulation via VCS, based at least on the receive data vector. Determining the likely candidates may include perturbing the receive data vector for each candidate based on a pre-determined perturb vector, and estimating a corresponding transmit data vector based at least on the perturbed receive data vector for the candidate and an estimator matrix, wherein the likely candidate comprises the estimated data vector.

Abstract: A channel decoder includes a demodulator, a filter, a detector module, and first and second circuits. The demodulator receives an input signal based on data read from a storage medium, and demodulates the input signal to generate a data signal. The filter generates equalized data based on the data signal. The detector module executes a Viterbi algorithm based on the equalized data to generate estimates of data originally stored in the storage medium, and based on the execution of the Viterbi algorithm, generates a first and second sets of depths. The first set of depths includes depths larger than depths in the second set of depths. The first circuit generates a first error signal based on the first set of depths. The second circuit generates a second error signal based on the second set of depths. The filter generates the equalized data based on the first and second error signals.

Abstract: A decoding apparatus has an on-chip buffer, an external buffer interface, and a turbo decoder. The on-chip buffer is arranged for buffering each code block to be decoded. The external buffer interface is arranged for accessing an off-chip buffer. The turbo decoder is arranged for decoding a specific code block read from the on-chip buffer. The specific code block is not transmitted from the on-chip buffer to the off-chip buffer via the external buffer interface unless decoding fail of the specific code block is identified.