471 results about "Generator matrix" patented technology

A system and a method are disclosed for synchronizing folders between one or more layers of folders. It includes selecting layers to link together, comparing folders in the selected layers using an immutable identifier, parsing the folders of each of the selected layers into fields, comparing the fields of parsed folders of the selected layers, and determining whether to synchronize the folders of the selected layers based on conflict rules triggered in response to the comparison of the fields of the parsed folders. Also disclosed is a system and method of merging two or more folders in a network into a single folder. It includes comparing entries between folders to identify duplicate entries, grouping the identified duplicate entries in each folder, generating a matrix from the duplicates grouping and assigning each matrix entry a value, and matching the matrix entries based on the assigned values to determine an extent to merge an identified duplicate entry.

A method for communicating binary data and a digital communication system are presented. According to one embodiment, the method includes encoding a message word by multiplying the message word with a generator matrix, wherein the generator matrix multiplied by the transpose of a parity check matrix for a low density parity check code yields a null set, and wherein the parity check matrix has a column weight of two. Additionally disclosed is an encoding scheme based on a three-tier Tanner graph having a girth of twelve.

The invention discloses a density evolution based polarization code constructing method and polarization code coding and decoding system. According to the invention, the code length N and the information bit length K of an information code to be processed are obtained, an expectation value set of a log-likelihood ratio probability density function of N bit channels, K bit channels are selected as the information bit channels according to the expectation value set and information bit information index vector quantity is generated; an information bit sequence and a fixed bit sequence are mixed and the mixed bit vector quantity is multiplied by a polarization code for generating a matrix so as to output an encoding sequence; the encoding sequence is modulated and input into a transmission channel and the sequence output by the transmission channel is subjected to decoding operation by adopting a polarization code decoding algorithm, bit error probability and frame error rate of the decoded code are calculated and a design signal to noise ratio is changed, the above operation is repeated until the bit error probability and frame error rate become the minimum. The method and system provided by the invention are suitable for general binary system memoryless channels, the bit error probability and frame error rate are low, the calculation complexity is low and the communication performance of a communication system is improved.

The Computationally Efficient Transfer Processing and Auditing Apparatuses, Methods and Systems (“CETPA”) transforms transaction record inputs via CETPA components into matrix and list tuple outputs for computationally efficient auditing. A blockchain transaction data auditing apparatus comprises a blockchain recordation component, a matrix Conversion component, and a bloom filter component. The blockchain recordation component receives a plurality of transaction records for each of a plurality of transactions, each transaction record comprising a source address, a destination address, a transaction amount and a timestamp of a transaction; the source address comprising a source wallet address corresponding to a source digital wallet, and the destination address comprising a destination wallet address corresponding to a destination virtual currency wallet; verifies that the transaction amount is available in the source virtual currency wallet; and when the transaction amount is available, cryptographically records the transaction in a blockchain comprising a plurality of hashes of transaction records. The Bloom Filter component receives the source address and the destination address, hashes the source address using a Bloom Filter to generate a source wallet address, and hashes the destination address using the Bloom Filter to generate a destination wallet address. The Matrix Conversion component adds the source wallet address as a first row and a column entry to a stored distance matrix representing the plurality of transactions, adds the destination wallet address as a second row and column entry to the stored distance matrix representing the plurality of transactions, adds the transaction amount and the timestamp as an entry to the row corresponding to the source wallet address and the column corresponding to the destination wallet address; and generate a list representation of the matrix, where each entry in the list comprises a tuple having the source wallet address, the destination wallet address, the transaction amount and the timestamp.

Disclosed is a method for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier. The method includes receiving a cell identifier, and generating a block code corresponding to the cell identifier using a predetermined block code generator matrix, and generating a first part sequence using the block code; selecting a second part sequence in accordance with the cell identifier; generating a reference signal of a frequency domain using the first part sequence and the second part sequence; converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform operation and transmitting the reference signal of the time domain in a predetermined reference signal transmission interval.

In a data decoder for decoding data from received symbols received over a channel from an encoder, wherein the received data can include erasures and include source symbols and repair symbols and wherein the decoder uses in decoding a generator matrix, any square submatrix of which is invertible, such that the decoder can perform decoding operations concurrently with the arrival of the source symbols and repair symbols, a method of decoding comprising representing in decoder memory a system of equations derived, at least in part, from the generator matrix, substituting received source symbols into the system of equations as the source symbols are received before receiving all source symbols, identifying, using decoder logic, repair equations to be used for solving the system of equations as repair symbols arrive, calculating, using decoder logic, vector values for equations as source symbols arrive, and converting the system of equations into an upper triangular form as repair symbols arrive at the decoder. Novel methods can be used for interleaving and specifying encoding structure for a large class of FEC codes, scheduling the sending of packets and the like.

A system and a method are disclosed for synchronizing folders between one or more layers of folders. It includes selecting layers to link together, comparing folders in the selected layers using an immutable identifier, parsing the folders of each of the selected layers into fields, comparing the fields of parsed folders of the selected layers, and determining whether to synchronize the folders of the selected layers based on conflict rules triggered in response to the comparison of the fields of the parsed folders. Also disclosed is a system and method of merging two or more folders in a network into a single folder. It includes comparing entries between folders to identify duplicate entries, grouping the identified duplicate entries in each folder, generating a matrix from the duplicates grouping and assigning each matrix entry a value, and matching the matrix entries based on the assigned values to determine an extent to merge an identified duplicate entry.

A method and apparatus for providing a secure transmission based on a polar code are provided. A device generates an output bit sequence by applying a polar code generator matrix to an input bit sequence and transmits the output bit sequence to a target receiver. The input bit sequence includes first information bits, second information bits and third information bits. The first information bits correspond to gray bit channels for the target receiver and bad bit channels for an eavesdropper. The third information bits correspond to good bit channels for the target receiver and gray bit channels for the eavesdropper.

A data processing system-implemented method or data processing system readable medium can be used to model operating parameter(s) for a vendor. Detailed analysis of the impact of prices or other variables, on the demand of each item, is performed. These allow us to prune large numbers of prices or other variables which have little or no impact on a given item. After determining which prices and other variables are significantly related to an item, a more in-depth examination of that small list of variables may be performed. This in-depth examination will result in a set of final weighing factors, quantifying the effect of each on the item. The weighing factors for all other variables can be assigned a value of zero. By limiting the number of non-zero weighing factors, the time needed to generate all the weighing factors for a matrix (or matrices) is reduced.

In a data decoder for decoding data from received symbols received over a channel from an encoder, a method for decoding data wherein the received data includes erasures and includes source symbols and repair symbols organized into one or more source blocks. The decoder uses a generator matrix, any square submatrix of which is invertible, such that the decoder performs decoding operations concurrently with the arrival of the source symbols and repair symbols that are a part of a source block. Novel methods for interleaving and specifying encoding structure for a large class of FEC codes, scheduling the sending of packets and the like, are also applied in conjunction with the method for decoding data.

A code computing apparatus with an error detection code (CRC) generating function and an elliptic curve cryptography (ECC) function, comprising a matrix element computation part 30 for generating matrix elements from parameter values set in first and second registers 201 and 202, a matrix element register 51 for holding the matrix elements generated by the matrix element computation part, and an inner product calculation part 40 for executing inner product calculation between the matrix elements held by the matrix element register and data set in a third register. The matrix element computation part selectively generates matrix elements for error detection and matrix elements for encryption by changing the parameters to be set in the first and second registers, and the inner product calculation part is shared to error control code generation and data encryption by altering the matrix elements to be held in the matrix element register.

A method for sparse channel estimation in MIMO OFDM systems with a plurality of subchannels having the same sparsity structure is presented. The inventive method comprises initializing a plurality of residual vectors and observation generating matrices modeling the channel, sending a pilot signal for each subcarrier, converting the pilot signals to tap positions, detecting an optimal tap position, updating the residual vectors by removing the one residual vector having the optimal tap position, updating the generating matrices in accordance with the optimal residual vector, calculating weighted residuals based on the updated residual vectors, and repeating the steps, except initializing, until a stopping condition is met, wherein the updated observation matrices estimate the sparse channel. In one embodiment, the observation generating matrices are omitted. In one embodiment, multiple vectors are removed during one iteration. Pilot placement and pilot allocation techniques are presented to optimize the method.

A method for communicating binary data and a digital communication system are presented. According to one embodiment, the method includes encoding a message word by multiplying the message word with a generator matrix, wherein the generator matrix multiplied by the transpose of a parity check matrix for a low density parity check code yields a null set, and wherein the parity check matrix has a column weight of two. Additionally disclosed is an encoding scheme based on a three-tier Tanner graph having a girth of twelve.

A method for increasing coding reliability includes generating a generator matrix for an extended polar code including a standard polar code part and an additional frozen part. The standard polar code part has N bit-channels, including K information bit-channels and N−K frozen bit-channels. The additional frozen part has q additional frozen bit-channels. Among the K information bit-channels, q information bit-channels are re-polarized using the q additional frozen bit-channels. The method further includes receiving an input vector including K information bits and N+q−K frozen bits, and transforming, using the generator matrix, the input vector to an output vector including N+q encoded bits. The K information bits are allocated to the K information bit-channels, and the N+q−K frozen bits are allocated to the N−K frozen bit-channels and the q additional frozen bit-channels.

A memory system comprising a qubit array configured to store therein and read one or more entangled qubit states encoded using a quantum stabilizer code. The quantum-memory system further comprises a quantum-state-refresh module configured to change an entangled qubit state in the qubit array when an error is detected therein. The quantum-state-refresh module is configured to detect an error by performing a redundant measurement of a set of syndrome values corresponding to the quantum stabilizer code, with the redundant measurement being based on a block error-correction code. In one embodiment, the block error-correction code is a low-density generator-matrix code or a low-density parity-check code constructed using an EXIT-function optimization method.

The encoder chip of the present invention uses LDPC codes to encode input message data at a transmitting end, thereby generating a series of codewords. The encoder chip implements two low-density parity-check (LDPC) codes. The first LDPC code is a (4088,3360) code (4K) which is shortened from a (4095,3367) cyclic code. The second LDPC code is a quasi-cyclic (8158,7136) code (8K). The message data and the generated codewords are transmitted to a receiving end where the received codewords are decoded and checked for errors. To generate the codewords, the encoder applies a generator matrix G to the input message data. The G matrix is generated by first defining an H matrix. An H matrix is initially defined as 16×2 array of right-circulant sub-matrices. The G matrix is formed by manipulating the H matrix according to a 4-step algorithm. A randomizer and a synchronization marker are also included within the encoder.

A CRC calculation method and system for generating a CRC from a message is provided while improving the process time and simple to implement. A linear mapping matrix is used for the operation of the LFSR to generate the CRC and the maximum value of the non-zero entries in the mapping matrix is reduced by applying one or more raw operations to the linear mapping matrix in advance before the computation of mapping the input message to the CRC result. Flip-flops are additionally inserted before the generator matrix to obtain a pipeline architecture so as to further improving the operation speed thereof.

This invention provides improved security of the McEliece Public Key encryption system adding features which make full use of random number generation for given message and cryptogram parameters. Different embodiments of the invention are described which enable the level of security to be traded-off against cryptogram size and complexity. Message vectors are encoded with a scrambled generator matrix, using matrix multiplication to form codeword vectors. Shortened corrupted codewords are generated by corrupting each codeword vector and omitting a predefined number of bits, whereby a cryptogram is formed from the shortened corrupted codewords. Measures are included to defeat attacks based on information set decoding. A number of different applications are given.

A multiple spot x-ray generator is provided that includes a plurality of electron generators. Each electron generator includes an emitter element to emit an electron beam, a meshed grid adjacent each emitter element to enhance an electric field at a surface of the emitter element, and a focusing element positioned to receive the electron beam from each of the emitter elements and focus the electron beam to form a focal spot on a shielded target anode, the shielded target anode structure producing an array of x-ray focal spots when impinged by electron beams generated by the plurality of electron generators. The plurality of electron generators are arranged to form an electron generator matrix that includes activation connections electrically connected to the plurality of electron generators, wherein each electron generator is connected to a pair of the activation connections to receive an electric potential therefrom.

A retransmission control method comprising: generating N parity check matrices; generating a generator matrix containing a check symbol generator matrix contained in the first parity check matrix; transmitting the codeword generated by using the generator matrix to another communications device; generating, when the communications device receives a NAK in response to the codeword, a first additional parity by using the second parity check matrix; and retransmitting the first additional parity to the another communications device.

The present invention discloses a hyperspectral image denoising method based on non-convex low rank matrix decomposition. The method comprises the following steps: 1. dividing a hyperspectral image; 2. generating a matrix; 3. carrying out nonconvex low rank matrix decomposition; 4. restoring the sub-block; and 5. restoring the hyperspectral image, and finally obtaining the denoised hyperspectral image. According to the method disclosed by the present invention, a method for efficiently and quickly removing multiple kinds of noises is provided for the remote sensing hyperspectral image denoising.

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 secret sharing apparatus according to the present invention is based on a (k,n)-threshold scheme with a threshold of at least 4. The secret sharing apparatus generates a generator matrix (G) of GF(2) in which any k of n column vectors are at a full rank, divides secret information into n−1 pieces to generate divided secret data (K(1), . . . , K(n−1)), generates random data (U(0,1), . . . , U(k−2,n−1)), calculates the product of matrixes of the divided secret data, the random data, and the generator matrix (G), assigns the j×(n−1)+ith column of the calculation result to sharing partial data (D(j,i)) to calculate sharing partial data (D(j,1)), generates header information (H(j)), and individually distributes n pieces of sharing information (D(0), . . . , D(n−1)) made up of the header information (H(j)) and sharing partial data (D(j,i)) to n storage apparatuses.

A retransmission control method comprising: generating N parity check matrices; generating a generator matrix containing a check symbol generator matrix contained in the first parity check matrix; transmitting the codeword generated by using the generator matrix to another communications device; generating, when the communications device receives a NAK in response to the codeword, a first additional parity by using the second parity check matrix; and retransmitting the first additional parity to the another communications device.

The invention discloses a method for classifying multi-spectral remote sensing data land use based on semi-supervisor manifold learning, relating to a land use classification method. The method comprises the following steps of: taking the multi-spectral remote sensing data as a sample data set according to a wave band generator matrix of the data; selecting a part of sample data from the sample data set, marking sample class labels according to priori knowledge, and randomly selecting a part of sample data as unmarked data from the sample data set; establishing a similarity graph and a difference graph to measure the similarity and the difference of data points, and calculating a weight matrix; calculating according to an optimal target function to obtain a projection matrix; projecting the whole multi-spectral remote sensing data; and executing the land use classification by using a K-adjacent classification algorithm. The invention adds the randomly selected unmarked sample data by utilizing a semi-supervisor manifold learning method, calculates the projection matrix by the optimal target function so as to increase the precision of the land use classification and effectively saves the cost of marking the training sample classes at the same time.

A re-transmission control method for a transmitting device that transmits a codeword generated based on a first parity-check matrix to a receiving device, and re-transmits a k-th additional parity generated based on a k-th parity-check matrix to the receiving device when receiving a NAK for the codeword or a (k−1)-th additional parity, comprising: generating a (k+1)-th parity-check matrix based on a k-th parity-check matrix; generating a generator matrix based on the (k+1)-th parity-check matrix; and generating the k-th additional parity based on the generator matrix.

Described is an error control method for multilevel memory cells operating with a variable number of storage levels. The method includes: receiving a first information word having k input symbols each in a first base; converting the first information word into a second base by converting the input symbols into input symbols in the second base; encoding the converted first information word into a first codeword having k+n coded symbols in the second base; and writing the first codeword into the multilevel memory cells. The encoding step may include generating a generating matrix and multiplying the first information word by the generating matrix to produce the first codeword.

System and method for Slepian-Wolf coding using channel code partitioning. A generator matrix is partitioned to generate multiple sub-matrices corresponding respectively to multiple correlated data sources. The partitioning is in accordance with a rate allocation among the correlated data sources. Corresponding parity matrices may be generated respectively from the sub-matrices, where each parity matrix is useable to encode correlated data for a respective correlated data source, resulting in respective syndromes, e.g., in the form of binary vectors. A common receiver may receive the syndromes and expand them to a common length by inserting zeros appropriately. The expanded syndromes may be vector summed (e.g., modulo 2), and a single channel decoding applied to determine a closest codeword, portions of whose systematic part may be multiplied by respective submatrices of the generator matrix, which products may be added to the respective expanded syndromes to produce estimates of the source data.

Sets of encryption keys useful by devices for decrypting encrypted content are defined using an error-correcting code such as a Reed-Solomon code to define vectors of length “n” over an alphabet of (0, . . . , N−1), wherein “n” is the number of columns in a key matrix and “N” is the number of rows in the matrix. Each vector represents a set of keys that can be assigned to a device. With this invention, overlap between sets of keys can be minimized to minimize the possibility that the key set of an innocent device might be inadvertently revoked when the key set of a compromised device is revoked. Also, only the generating matrix of the error-correcting code and the index of one set of keys need be stored in memory, since all previously defined key sets can be regenerated if need be from just the generating matrix and index.