Abstract:
A transmitting apparatus and method, and a receiving apparatus and method are provided. The transmitting apparatus includes: an encoder configured to perform encoding on data including information bits; and a bit interleaver configured to perform interleaving on the information bits and parity bits generated by the encoding, wherein the bit interleaver is configured to classify the generated parity bits into a plurality of groups and write the information bits and the generated parity bits in a plurality of columns in a column direction such that parity bits included in a predetermined group among the plurality of groups are arranged in predetermined positions in the plurality of columns, to perform the interleaving.
Abstract:
A method of cryptographically processing a block of data, the method comprising: receiving an encoded version of the block of data, wherein the encoded version of the block of data comprises the block of data encoded, at least in part, using an error control code; and processing the encoded version of the block of data using a predetermined function to generate an output, wherein the predetermined function is arranged so that the result of processing, with the predetermined function, a quantity of data encoded, at least in part, using the error control code equals the result of encoding, at least in part, with the error control code the result of performing encryption or decryption of the quantity of data according to the Advanced Encryption Standard, AES.
Abstract:
An improved technique involves assigning a different generator matrix to each data stripe of the redundant disk array such that all of the different generator matrices represent the same code. For example, when a k x n generator matrix G represents a linear code C , k being the block length and n the code length, then for any invertible k x k matrix P , the matrix G' = PG is also a generator that represents C . When C is a systematic code, then G consists of a k x k identity matrix representing payload data concatenated with a k x (n-k) parity matrix representing parity data. Certain matrices P represent row operations on G , meaning that the matrix G may have the columns of the identity matrix in G to different locations in G' .
Abstract:
Methods and apparatus for use in communication systems using recursive modulation schemes with a Low Density Generator Matrix code (including an irregular repeat accumulate (IRA) code) are described that have reduced complexity and thus reduced cost compared to prior art systems. A communication system is described in which the transmitter concatenates a low density generator matrix code with an accumulator followed by a recursive modulator in order to eliminate the use of an interleaver, and in which the receiver combines the decoder for the accumulator and the soft demodulator into a single joint decoder in order reduce the number of components and complexity. Another variation is also described in which the transmitter is further simplified by eliminated the accumulator altogether, and in which the receiver is further simplified by replacing the joint decoder with a soft demodulator prior to the LDGM soft decoder.
Abstract:
Systems and methods for decoding block and concatenated codes are provided. These include advanced iterative decoding techniques based on belief propagation algorithms, with particular advantages when applied to codes having higher density parity check matrices. During iterations of the belief propagation, variable-to-check messages may be calculated. According to some embodiments, a scaling factor may be calculated based on the smallest absolute values in a set of variable-to-check messages, and may be used to scale the messages passed during the belief propagation. According to other embodiments, the positive or negative signs of the variable-to-check messages may be compared and used to generate a modified variable-to-check message. According to other embodiments, sparse parity check matrices may be generated and used to produce updated log-likelihood ratios with soft-input soft-output message passing. These and other improvements enhance the decoding of H/M/LDPC codes, including Reed-Solomon codes which may be used in HD Radio systems.
Abstract:
A method and apparatus that improves the performance of TCP (and other protocols) in a data network by segmenting the TCP path and implementing a proprietary protocol (DPR™) over the network. The DPR™ protocol provides a multiplexed tunnel for a multiplicity of TCP sessions from a client to a cloud proxy. DPR™ implements congestion management, flow control, reliability, and link monitoring. Other network protocols (such as UDP) are supported with a reliability protocol based upon network coding that improves the transmission reliability. A network and a method for transmitting processes in a network are disclosed, using deterministic coefficients for encoding packets based on network coding principles. Disclosed is a method and implementation for using deterministic coefficients for encoding packets based on network coding principles. The use of deterministic coefficients reduces the need for extra information to be transmitted to recover the lost packets and results in significantly reduced overhead and increased performance, security and reliability.
Abstract:
A method of searching for candidate codewords for a telecommunications system, the method comprising receiving a sequence of constellation points, producing a received FEC vector comprised of bits from the received constellation points, comparing the received FEC vector with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, and terminating the search when a candidate codeword from among the plurality of candidate codewords is found residing within a predetermined range of a specified distance of the received FEC vector.