38 results about "Polynomial matrix" patented technology

The invention relates to an encryption method for network and information security; the adopted packet length and key length are 128 bits, and a 128-bit system parameter is added; encryption algorithm comprises a plurality of rounds of round transform iteration consisting of mixed layers and diffusion layers, wherein the last round is incomplete round transformation, and the incomplete round transformation consists of the mixed layer; the mixed layer comprises key plus, S box portfolio transform and system parameter minus; the S box portfolio transform comprises 8-input 8-output reversible S box transform and inverse S box transform in the same number which are output by parity exchange; the diffusion layer can construct linear transformation with a reversible re-model polynomial matrix; an encryption round key is generated by an encryption key through encryption round transformation; and decryption algorithm is the inverse transformation of encryption algorithm. The encryption methodfor network and information security has the advantages of high diffusion speed, good security strength, hardware resource saving, and very high speed when being realized by hardware and on a software platform.

The invention discloses a blind identification method for punctured convolutional codes with a code rate of (n-1)/n. A mathematical model v(D)=m(D)G(D) for blind identification of the punctured convolutional codes is established at first, wherein, v(D) represents code output sequence; m(D) represents information sequence waiting for coding; G(D) represents generator polynomial matrix; on the ground that the code output sequence v(D), the generator polynomial matrix G(D) and a check polynomial matrix H(D) meet relational expressions G(D)H(D)<T>=0 and v(D)H(D)<T>=m(D)G(D)H(D)<T>=0, the check polynomial matrix H(D) is estimated by the v(D) at first and then the generator polynomial matrix G(D) is estimated, and finally the received code output sequence v(D) is combined and the information sequence m(D) is recovered. The blind identification method for the punctured convolutional codes with a code rate of (n-1)/n can identify the punctured convolutional codes more simply and more quickly and simultaneously solve the problem that initial place values of code words of the convolutional codes are fuzzy.

Systems and methods are described that facilitate reducing metamerism in a scanner or printer system by evaluating and manipulating unfiltered clear channel information. Using a four channel model to predict CIE XYZ tristimulus values from RGB and clear, a linear model is generated based on a polynomial matrix conversion. For example, one such model has coefficients weighting 1, R, G, B, W, R², G², B², W², RG, RB, RW, GB, GW, BW, and corresponding third order terms. The XYZ values predicted by the linear model are converted to L*a*b*, and compared with measured L*a*b* values. A statistic involving the difference between measured and computed L*a*b* values is used as a metric in a non-linear optimization to obtain the best values for the matrix elements. Once the matrix is optimized, it is employed for printer calibration, error detection, and the like.

The invention relates to a frequency domain saliency target detection method based on Gabor wavelets. The method includes the steps: S1, switching inputted color images into gray images and building a directional feature map; S2, building two color feature maps according to sensitivity of human eyes on different colors of the inputted color images; S3, building a gray feature map for the inputted color images; S4, building a polynomial matrix by the aid of the four feature maps; S5, performing Fourier transformation for the polynomial matrix comprising the four feature maps to obtain a frequency domain polynomial matrix and extracting a magnitude spectrum matrix; S6, performing Gaussian low-pass filter for the magnitude spectrum matrix by a plurality of scales and performing polynomial inverse Fourier transformation for a group of magnitude spectra to obtain a plurality of time domain polynomial matrixes; and S7, dividing the time domain polynomial matrixes into different time domain polynomials according to different scale factors, building a histogram for each time domain polynomial, calculating a one-dimensional entropy function and extracting a time domain saliency map corresponding to the minimum information entropy as a final detection result.

The invention discloses a rotational inertia determination method for a satellite attitude control system and relates to the technical field of satellite control. The method aims to determine the accurate change range of rotational inertia in the satellite attitude control system. The method is technically characterized by comprising the following steps of firstly, building a satellite attitude control system model containing indeterminacy; secondly, making a corresponding constraint index, and acquiring a proper H(u) infinity (/u) state feedback controller; finally, expressing the indeterminacy in a closed loop system as a form of a polynomial matrix cell, and solving the change range of the indeterminacy of the rotational inertia by using a linear matrix inequality method. According to the method, the change range of the rotational inertia of a satellite under the condition of state feedback is judged by using the stability conditions of the polynomial matrix cell. The indeterminacy is taken into consideration in the design stage of the controller, and the influence on output caused by the indeterminacy serves as a control index, and the indeterminacy in the closed loop system is expressed as the polynomial matrix cell.

The invention discloses a method for improving the on-schedule rate of the operation of a high-speed railway train by utilizing the robustness of a working diagram in the technical field of operation dispatching and control of high-speed trains. The method adopts a technical proposal that a preset working diagram is subject to formal representation; a polynomial matrix expression form of the working diagram is given to evaluate a feature value; then the perturbation of the working diagram is defined, and the ratio of the perturbation and the total delay time is utilized to weigh the robustness of the working diagram; a Petri network is utilized to simulate the operation of the train in a section, and the deviation of the arrival and departure time of the train and diagram-specified time produced during the simulation is fed back to the perturbation calculation; the robustness of the working diagram is calculated; according to the requirement of the robustness of the preset working diagram, the arrival and departure time of the train in the working diagram is adjusted, and then the operation simulation of the train and the robustness calculation are performed; and the circulation is performed until the robustness of the working diagram achieves the preset requirement. The method provides an evidence for establishing high-efficiency railway working diagrams and assuring the safe, punctual and high-speed operation of railways.

The invention discloses a noiseless fully homomorphic public key encryption method based on a binary truncated polynomial ring and is used for solving the technical problem that in the prior art, keys and ciphertexts are too long and the ciphertext homomorphic computation efficiency is low. The method comprises the realization steps that a user sets parameters, obtaining a decryption private key, an encryption public key and a ciphertext homomorphic computation public key, establishes the binary truncated polynomial ring, carries out probability encryption on a plaintext through adoption of the encryption public key to obtain the ciphertext belonging to the binary truncated polynomial ring, and decrypts the ciphertext through adoption of the decryption private key to obtain the plaintext corresponding to the ciphertext; a cloud server carries out homomorphic computation on the ciphertext through adoption of the ciphertext homomorphic computation public key, thereby obtaining the homomorphic ciphertext belonging to the binary truncated polynomial ring; and the user decrypts the homomorphic ciphertext through adoption of the decryption private key, thereby obtaining a result obtained by carrying out the same computation on the corresponding ciphertexts. According to the method, the lengths of the ciphertexts and the keys are normal levels and the homomorphic computation efficiency is high.

The invention discloses a parameterization BCH (broadcast channel) error-correcting code parallel encoding method and device. The method comprises the following steps of determining three variable parameters such as the error-correctable bits t, bit width p of the parallel encoding and length k of data information bit, solving a generation polynomial matrix, wherein the number of times of the generation polynomial matrix g(X) is (n-k); carrying out the logic operation for a temporary variable of a check bit and the generation polynomial matrix, and finally outputting a complete encoding module described through a verilog HDL (hardware description language) language. The generated encoding module is high in encoding speed and less in occupied resource. The encoding module utilizes one generation matrix to realize the parallel encoding function and is finally solved through a series of operation according to the generation polynomial of the BCH code. The method and the device are applicable to the application with long code word, high encoding speed and capability for continuously enhancing the error correcting capacity of the error-correcting code.

The invention relates to a LDPC convolutional code construction method, comprising the steps of generating all elements over a finite field GF(q), FORMULA, wherein q is an prime number or a power of the prime number, and alpha is a basic element over the GF(q); forming a m*n base matrix W by using the elements alpha<0> = 1, alpha, ..., alpha<q-2> of the finite field GF(q); and obtaining a time-invariant LDPC convolutional code polynomial matrix H(D) via the base matrix W. Compared with the existing skills, the LDPC convolutional code construction method provided by the invention has the characteristic of rapid coding, can obtain the code with the maximal achievable code memory, and has the lower error floor and good coding performance under the small constraint length.

The invention relates to a configurable parallel BCH error correction coding method, and the method comprises the steps: determining the coding configuration: an information bit k, a check bit r, a code word length n, an error correction bit t, and a primitive polynomial f (x); Calculating parameters: generating a polynomial g (x); Generating a polynomial matrix Tg, and verifying the calculation matrix Tg (p-1); Generating and calculating processing circuit. Performing coding calculation, including: inputting information bit data in parallel; Calculating check bit data; And judging whether theinput is finished or not, if so, outputting information bit data M (x), and if not, outputting check bit data S (x). According to the coding method, parallel input and output of data are realized, the time consumption of the processing flow is reduced in equal proportion, and the coding processing efficiency is remarkably improved.

The invention discloses a low-memory-occupancy implementation technology based on a post quantum cryptography Saber algorithm. The low-memory-occupancy implementation technology comprises a key generation method and system, an encryption method and system and a decryption method and system. The vector multiplication of the polynomial matrix is calculated by adopting the immediate generation of the matrix, and the memory space occupied by the polynomial matrix is reduced to the memory size occupied by a single element, so that the memory occupation of the Saber scheme is remarkably reduced, and the deployment of the Saber scheme in the Internet of Things equipment is facilitated.

In an arrangement of the disclosed systems, devices, and methods, a codeword encoded with a first number of check symbols is received and asymmetrically processed according to a second number of check symbols, where the second number of check symbols is less than the first number of check symbols, to produce an error locator polynomial and an error evaluator polynomial. A derivative of the error locator polynomial is produced by outputting a first polynomial term and a second polynomial term, wherein the second polynomial term is a constant. The derivative of the error locator polynomial is produced using a variable finite-field multiplier and without use of a divider.

The invention provides an automatic color correction matrix algorithm based on the least square method. The algorithm performs sampling statistics on two images with differences, outputs respective standard color correction matrixes, and fits a polynomial matrix satisfying the difference of sensors according to the basic principle of the least square method. The problem of visual error caused by insufficient precision of the sensor, the optical filter, the lens and other hardware, and such factors as sensitometric curve discreteness is solved.

Data signals transmitted by a plurality of transmitting antennas over a radio channel are demodulated. The method comprises receiving (202) on a plurality of receiving antennas, a data signal and a reference signal, the contents of the reference signal being known a priori to the receiver. The contents of the reference signal are used for calculating (204) an estimated polynomial channel matrix. A polynomial pre-filter matrix is calculated (206, 208) by a decomposition of the estimated polynomial channel matrix into a product of a paraunitary polynomial matrix and an upper triangular polynomial matrix with minimum phase filters on its main diagonal, where the polynomial pre-filter matrix is obtained by calculating the paraconjugate of the paraunitary polynomial matrix. The received data signal is demodulated (212) where the received data signal is multiplied with the calculated polynomial pre-filter matrix.