34 results about "Reed–Muller code" patented technology

An unequal error protection Reed-Muller code and method for designing a generator matrix and decoder. A conventional RM code is concatenated with the combination of itself and a subcode of itself. The new generator matrix is decomposed to include empty submatrices. The resulting generator matrix allows parallel decoding of separate portions of the received code word vectors.

A system for soft-decoding of Reed-Muller coded information has one or more rows of decoding blocks, each decoding block having a soft-output device and a Reed-Muller message passing device. A first soft-output device of a first decoding block processes a coded signal and a zero value probability vector. Each subsequent soft-output device processes the coded information and a non-zero value probability vector. The system for soft-decoding Reed-Muller coded information decodes a code-bit reliability vector from a soft-output device to generate an updated codeword reliability vector, which is used by a next decoding block in a sequence of decoding blocks to reprocess the coded information using the updated reliability vector. The reliability vector is updated through processing in each decoding block to optimize the reliability vector for extraction of the transmitted information from the received information.

Soft decision decoding of a codeword of a Reed-Muller (RM) code by

selecting an optimal decomposition variable i using a likelihood calculation. A code RM(r, m) is expressed as {(u, uv)|uεRM(r, m−1) and vεRM(r−1, m−1)) where uv denotes a component-wise multiplication of u and v, and (u, uv)=(r¹, r²). A receive codeword is separated into r¹=u and r²=uv based on the optimal decomposition variable, and r² is decoded according to the optimal decomposition variable, using a RM(r−1, m−1) decoder to obtain a decoded v and a first set of decoded bits. The decoded v is combined with r¹ using (r¹+r²v)/2, and

(r¹+r²V)/2 is decoded using a RM(r, m−1) decoder to obtain a decoded u and a second set of decoded bits.

Various methods and devices are provided to address the need for reduced compression complexity in the area of compressive sensing. In one method, a vector x is compressed to obtain a vector y according to y=Φ_RDx, where Φ_RD=UΦ_RM·Φ_RM is a compressive sensing matrix constructed using a second-order Reed-Muller code or a subcode of a second-order Reed-Muller code and U is a unitary matrix from the real or complex Clifford group G. In another method, vector y is decompressed to obtain vector x also according to y=Φ_RDx. In some embodiments, decompression may involve computing y′=U⁻¹y and then determining the vector x using the computed y′.

A apparatus for generating (2^k-2^t) first order Reed-Muller codes from 2^k first order Reed-Muller codes based on k input information bits. The apparatus includes a code generator configured to generate (2^k-2^t) bits first order Reed-Muller codes, and an encoder for multiplying the k input information bits with the (2^k-2^t) bits first order Reed-Muller codes. The encoding apparatus also includes a memory for storing a number of first order Reed-Muller codes.

A method and apparatus for encoding and decoding Reed-Muller codes are provided. In exemplary embodiments, a method comprises receiving a code-word encoded with a Reed-Muller code, generating a pattern to retrieve voting bits, decoding the code-word based on the voting bits and, and providing the decoded code-word.

A method for protecting signalling information in a frame to be transmitted to a receiver in a communication system, comprising: encoding frame signalling information of the frame to protect the frame signalling information; and encoding Forward Error Correaction FEC block signalling information of FEC blocks in the frame by using Reed-Muller codes to protect the FEC block signaling information.

The invention discloses a method for generating (2k-1 -2t, k) optimum code by using first order Reed-Muller code in digital communication system. (2k-1, k) is generated by combining the (2k-1, k-1) basic sequence composed of k-1 radixes of first order Walsh code is length of 2k-1 with the column sequence of all ones (2k-1, 1) in length 2k-1. Based on optimal punching mode, removing 2t rows from 2k-1 rows generates (2k-1 -2t, k) code. The invention discloses a simple generating method for optimal punching mode, method for coding (2k-1-2t, k) code, and decoding method as well as encoding and decoding devices.

The invention discloses a judgment method for carrying out affine equivalence on two Boolean functions of any variable and belongs to the field of digital integrated circuits and cryptography. The method includes the first step of determining the Boolean functions Fm, the second step of obtaining a corresponding variable value matrix for any two Boolean functions, the third step of calculating rank (Af) and rank (Ag), and the fourth step of judging whether rank (Af) is the same with rank (Ag) or not and whether representation elements are the same or not, if yes, the affine f and the affine g are equivalent, or the affine f and the affine g are not equivalent. The judgment method can be applied to combinational logic circuits, programmable logic units of an FPGA, and Reed-Muller codes.

Decoding apparatus comprises EX-OR circuit exclusive ORing the Reed-Muller code and exclusive Ored value of mask symbol candidate pattern and the information data corresponding to the pattern, first decoder calculating checksum of the EX-OR circuit output and majority-judging the checksum to decode a part of the second portion of the information data, second decoder exclusive ORing the EX-OR circuit output and a product of the part of the second portion and the orthogonal codes and majority-judging the exclusive OR result to decode a remaining part of the second portion, Reed-Muller encoder encoding the information data, and minimum detector detecting the minimum of Euclidean distance between an output from the Reed-Muller encoder and the Reed-Muller code supplied to the arithmetic operation unit while a plurality of candidate patterns of the mask symbols are supplied to the arithmetic operation unit.

An RM code soft decision decoding method using decision by majority comprises: (a) performing multiplication on a bit group of a codeword, and calculating an information bit's estimate group; (b) summating elements of the group and obtaining a final estimate of the degree's information bit to perform decision by majority; (c) using the final estimate to generate a codeword corresponding to each degree's information bit final estimate, and removing the generated codeword from the codeword of (a); (d) repeating the step (c) for the final estimates of the remaining degrees' information bits other than zero-order information bit; and (e) summating elements of codewords of results performed on the final estimates of the first-order information bit in (d) to estimate the zero-order information bit's final estimate.

Disclosed is an apparatus for encoding k consecutive inputs indicating a TFCI (Transport Format Combination Indicator) of each of successively transmitted frames into a sequence of m symbols in an NB-TDD (Narrowband-Time Division Duplex) mobile communication system. An encoder encodes the k input bits into a sequence of at least 2ⁿ symbols where 2ⁿ>m, using an extended Reed-Muller code from a Kasami sequence. A puncturer performs puncturing on the sequence of 2ⁿ symbols from the encoder so as to output a sequence of m symbols.

The invention provides an electric power big-data cloud storage system achieving N-3 storage medium failure tolerance. The electric power big-data cloud storage system comprises a cloud storage control management unit, wherein the cloud storage control management unit is connected with a [ 32, 16 and 8] Reed-Muller code coding processing unit of an electric power big-data block, a writing-in communication transmission channel, a storage medium array with a rows and 32 lines, a reading-out communication transmission channel and a [32,16 and 8] Reed-Muller code decoding processing unit of the electric power big-data block, and the [ 32, 16 and 8] Reed-Muller code coding processing unit, the writing-in communication transmission channel, the storage medium array, the reading-out communication transmission channel and the [32,16 and 8] Reed-Muller code decoding processing unit are sequentially connected. According to the electric power big-data cloud storage system, the Reed-Muller code coding and decoding technique and the hash function abstract technique are adopted, any storage medium failures with the number equal to or less than 3 can be allowed to occur simultaneously, the N-3 failure tolerance is achieved, balance and optimization of the storage capacity, the failure tolerance capacity and expansibility of the electric power big-data cloud storage system is achieved, data safety is guaranteed, it is guaranteed that data have definite privacy and integrity, and therefore construction and development of the electric power big-data cloud storage system are prompted.

The present invention provides a method for transmitting TFCI data and a TD-SCDMA trunking communication system, wherein the method is completed in such a way that: a transmitting terminal obtains TFCI data to be used, corrects and encodes the TFCI data, encodes the TFCI data already corrected and encoded by using second order Reed Muller code, and maps the encoded TFCI data to a radio frame and then transmits it out; and a receiving terminal receives the TFCI data sent by the transmitting terminal, decodes the TFCI data by using the second order Reed Muller code and then corrects and decodesthe TFCI data. The method for transmitting the TFCI data of the invention can enhance the reliability of TFCI in the TD-SCDMA trunking communication system.

A method for transmitting information data by using a Reed-Muller coding scheme in a wireless communication system is disclosed. The method includes the steps of configuring a number of resource elements for transmitting the information data; generating coded information data having a specific bit size by applying RM coding to the information data; performing rate matching to the coded information data so that the rate-matched information data can correspond to the configured resource elements; and transmitting the rate-matched information data by using the configured number of resource elements, wherein a minimum value Q' min for the number of resource elements is defined based upon a bit size ( O ) of the information data and based upon a bit size per symbol ( Q m ) in accordance with a modulation order.