33 results about "Linear code" patented technology

The invention discloses a reciprocal calculation instruction sequence generation method oriented to a heterogeneous processor, and belongs to the field of compilation optimization and code generation. Aiming at the problems of instruction redundancy, weak precision control, poor hardware adaptation and high manual dependence of an existing method in a heterogeneous environment, characteristics of a reciprocal instruction and an operand are accurately identified by linearly scanning heterogeneous object codes (including vectorization, scalar and complex instruction sequences); in combination with hardware characteristics of RISC / SIMD / VLIW / DSP and the like, a multi-round iteration precision improvement and temporary register optimization allocation strategy is adopted, differential generation logic is formulated, and a high-precision low-redundancy instruction sequence is generated. The method comprises linear code scanning classification, reciprocal instruction and operand identification, cross-architecture generation logic rule formulation, instruction sequence generation and legality verification. Full-process automation is achieved, manual intervention is reduced, the execution efficiency and precision of reciprocal calculation of the heterogeneous processor are improved, and the method is suitable for embedded systems, high-performance calculation and other scenes.

A transmitter is provided that shapes uniformly-distributed bits into a non-uniformly distributed bits according to a parity check matrix of a linear code such that a product of the parity check matrix and the non-uniformly distributed bits equals the uniformly-distributed bits. Similarly, receiver is provided that recovers the uniformly-distributed bits from the non-uniformly distributed bits through a multiplication of the non-uniformly-distributed bits with the parity check matrix.

The invention provides a multi-keyword private information retrieval method and system based on inverted indexes, and belongs to the field of information security and privacy computing. The method comprises the following steps that: a server splits an original database into a reverse index part of a keyword-index set and a key value pair part of an index-data value; mapping the index set into an integer by utilizing Godel coding; processing the data by adopting probability batch coding and binary random linear coding and publishing a hash function; the client maps a multi-keyword query into a bucket by using a hash function to generate a query vector, and the query vector is sent to the server after being subjected to fully homomorphic encryption; the server performs homomorphic calculation on a matching result in a ciphertext state and returns the result; and the client obtains a matching index set after decryption verification, and then initiates a second round of query to obtain final data. According to the method, symmetric privacy protection of multi-keyword non-primary key query in a single-server environment is realized, leakage of query content and database information is effectively prevented, and private information retrieval security is improved.

The invention discloses a statistical linear coding active interference elimination method for f-OFDM (Frequency-Orthogonal Frequency Division Multiplexing). In order to solve the problems that in the prior art, CCs optimization solution needs to be carried out on each sending data symbol of a target sub-band once, the calculation complexity and the time delay are obviously higher than those of a linear calculation process, and an existing AIC algorithm is not suitable for scenes with limited calculation capacity and cruising capacity and sensitive to time delay. According to the method, active interference elimination is divided into an optimization solution part and a linear calculation part; by redesigning an AIC algorithm structure, an optimization solution process is moved out of a signal sending processing flow, and only one time of optimization solution of a linear coding matrix is needed in total. Each sending data symbol only needs to be multiplied by the linear coding matrix to obtain the CCs. Matrix multiplication belongs to linear calculation, and compared with nonlinear calculation of optimization solution, calculation complexity and time delay are greatly reduced.

The invention discloses a method for constructing a first-order elastic five-spectrum value function based on disjoint linear codes, which is characterized by comprising the following steps of: obtaining a group of disjoint linear codes according to the relation among related knowledge, set parameters and the set parameters of a finite field so as to divide the whole space; on the basis of a group of disjoint linear codes, resetting the value range of parameters, and generating one linear code and one linear code according to the generation principle of the disjoint linear codes; setting two sets to define a support set of a function; constructing a first-order elastic five-spectrum value function by using a one selection mode through giving two definition methods of the function; a truth table and a Walsh spectrum are given according to the defined first-order elastic five-spectrum value function to be depicted and verified, and therefore a Boolean function is constructed to be used for encryption. According to the method, a direct construction method of the first-order elastic five-spectrum value function is researched on the basis of the disjoint linear codes, starting from an existing Boolean function is not needed, application conditions and construction complexity are reduced, and construction efficiency can be improved.

The invention provides access error correction for content addressable memory. Examples of the disclosed technology provide a method for detecting and correcting errors (i.e., 'access' error correction) in a summed content addressable memory (sigma-CAM) when the sigma-CAM performs a compute task. The method involves adding redundant columns to a sigma-CAM for storing a task-driven matrix (i.e., a matrix having a value conforming to a computational task). Examples may utilize an encoder to calculate redundancy values for redundant columns such that the sigma-CAM stores codewords for linear codes (C) in each row. Examples also modify a linear code (C) used to calculate redundancy values. That is, examples modify the linear code (C) such that it includes an omni-vector. By this modification, the system of the present technology may detect and correct errors in the output vector from the sigma-CAM based on this modified / specific linear code (C).

This invention discloses a data encoding system and method based on simplicated complex homogeneous linear codes. The system includes: a parameter initialization module for initializing the construction parameters of an n-ary multivariable function F; a function definition module for generating the multivariable function F based on the construction parameters; and a definition set extraction module for constructing a definition set D. F ; Linear code generation module, used to generate linear codes according to the definition set D F This invention employs an inner product mapping to construct a basic p-ary linear code corresponding to the defined set; a homogenization processing module is used to homogenize the multivariable function F to obtain an (n+1)-ary homogeneous function; and a homogenized code generation module is used to generate a homogenized definition set based on the homogenized function, and then generate a homogenized p-ary linear code based on this set. This invention solves the problems of existing p-ary linear code construction techniques being complex in structure, having uncontrollable parameters, or being difficult to analyze weight distribution, leading to difficulties in efficient deployment in engineering.

The application discloses an image semantic segmentation method applied to an electronic device comprising an image semantic segmentation model, wherein the image semantic segmentation model comprises a down-sampling module and a sparse multi-layer perception module; the image semantic segmentation method comprises the following steps: acquiring an original image, extracting a down-sampled feature map of the original image by using the down-sampling module; performing linear coding on the down-sampled feature map to obtain a linear coding feature map; performing feature extraction on the linear coding feature map by using the sparse multi-layer perception module to obtain an output feature; training the image semantic segmentation model by using the output feature, and performing an image semantic segmentation task by using the trained image semantic segmentation model; and the application can balance the speed and accuracy of image semantic segmentation, so that the image semantic segmentation operation has a faster speed and higher accuracy. The application also discloses an image semantic segmentation device, an electronic device and a storage medium, which have the above beneficial effects.

The invention relates to an uplink passive multiple access method and system based on ODMA, and the method comprises the following steps: S1, at a user side, for each active user, coding data sent by the user according to the characteristics of uplink URA, the transmission characteristics of ODMA and the linear coding characteristics of polarization codes; and S2, decoding the received information at the base station by using a multi-user detection algorithm, an ODMA transmission mode codebook and a polarization code decoding criterion so as to obtain information source information. Simulation results show that compared with other uplink URA schemes based on ODMA, the system has better decoding performance and higher energy efficiency.

The embodiment of the invention relates to the field of artificial intelligence, and provides an epilepsy electroencephalogram signal detection method and device based on frequency attention and a pulse recurrent neural network and a storage medium, and the method comprises the steps: obtaining an epilepsy electroencephalogram signal to be detected; performing datum line following coding on the epilepsy electroencephalogram signal based on a grid search algorithm to obtain a coded epilepsy electroencephalogram signal; constructing a bidirectional pulse recurrent neural network model based on a preset adaptive pulse neuron model; the bidirectional pulse recurrent neural network model is used as a reference model, the reference model is adjusted based on a frequency attention mechanism and a pulse full-connection linear coding mechanism, and an improved model is constructed; and inputting the epilepsy electroencephalogram signal into the trained improved model to output a detection result associated with the epilepsy electroencephalogram signal. By adopting the method, the model calculation performance can be improved on the basis of reducing the energy consumption, and the detection effect on the epilepsy electroencephalogram signals is improved.

The invention discloses an information physical control system spoofing attack detection method based on linear coding, and the method comprises the steps: building an information physical control system model for deploying multiple types of sensors, and enabling the system to carry out the data collection through an intelligent sensor; establishing an attack detection enhancement scheme of linear coding, and introducing a spoofing attack model; establishing an optimization problem for balancing the detection performance and the estimation performance; solving an optimal linear coding operator based on a convex optimization theory; and a detection statistic is selected, and a detection threshold and an alarm strategy are set, so that the spoofing attack is detected. According to the spoofing attack detection scheme based on optimization of the cyber-physical control system, the correlation between data is amplified through linear coding, so that high-performance detection of the spoofing attack is realized. On the basis of the optimized coding design, the detection performance is ensured, meanwhile, the influence on the system estimation performance is reduced, and the problems that an existing spoofing attack detection method has certain limitation and is poor in applicability are effectively solved.

Provided is a transmitter that shapes uniformly distributed bits into non-uniformly distributed bits according to a parity check matrix of a linear code such that a product of the parity check matrix and the non-uniformly distributed bits is equal to the uniformly distributed bits. Similarly, a receiver is provided that restores uniformly distributed bits from non-uniformly distributed bits by multiplication of the non-uniformly distributed bits with a parity check matrix.

Processing systems and methods using adjustable code-based masking are disclosed. A processing system configured to execute a processing function f (x) in response to receiving an input information word x comprising k information symbols, comprising: a protection device configured to protect execution of the processing function; and a processing unit for performing a processing function by decomposing its execution into one or more base operations, the base operations including one or more base operations, the base operations including at least a component-by-component multiplication operation, the processing unit including a multiplier performing the multiplication operation. The protection device determines an encoding matrix A from an information code that is linear and is randomly determined and a masking code, and the processing device comprises an encoder configured to encode an input information word x and each operand of a base operation using the encoding matrix A prior to execution thereof. The multiplication performed by the multiplier is further masked using a pseudo-inverse matrix A-1 of the coding matrix A and a pseudo-inverse matrix A-T of the coding matrix A such that (AT)-1 = (A-1) T.

The application relates to a design method of a nonlinear corrector of a true random number generator. A kind of n input m output corrector function is constructed, and the technical scheme is: a group of bases of a finite field is selected, and an isomorphic mapping from to an [n-m, m, t] equidistant linear code is established. Component functions of the corrector are constructed so that each component function is cascaded by 2 m n-m element affine functions, the coefficients of the affine functions are one-to-one corresponding to 2 m vectors in the [n-m, m, t] equidistant linear code, and the constant term of each n-m element affine function cascaded by the i th component function is equal to the value of the i th input symbol. By using the design method, the algebraic degree of the obtained nonlinear corrector is m+1, the flexibility order is t-1, the correction order is currently optimal t, and the correction order is greater than the function flexibility order. The corrector obtained by the application has the ability to resist linear attack, correlation attack and algebraic attack, and has wide application prospects in cryptography and random simulation.

One or more methods, devices, and / or systems can provide techniques for linear encoding channel state information (CSI) compression for multi-transmission / reception point (mTRP). This can provide improvements to wireless communication systems, for example, by improving resilience against transmission errors and mismatches, joint or separate compression of channel matrices from different TRPs, and / or fallback to legacy CSI reporting operations in mTRP CSI compression.

The invention relates to a digital signature method based on coding, and belongs to the technical field of information security. A trusted center generates a public key and a private key and sends the public key and the private key to a signer, and then the signer signs a message. Except a legal signer, the generated signature is difficult to counterfeit by any other person, but any person can verify the validity of the signature. Besides, the problem of difficulty in decoding of random linear codes in a coding theory is combined with digital signature, quantum computing attacks can be effectively resisted, the robustness of a signature scheme in a noise channel is improved, and the storage and transmission overhead of signature results is reduced.

Examples of the presently disclosed technology provide a methodology for detecting and correcting errors in a summing content-addressable memory (Σ-CAM) while the Σ-CAM is performing a computational task (i.e., “on-access” error correction). The methodology involves adding redundancy columns to a Σ-CAM used to store a task-driven matrix (i.e., a matrix having values comporting with a computational task). Examples can leverage an encoder to compute redundancy values for the redundancy columns such that the Σ-CAM stores a codeword of a linear code (C) in each row. Examples also modify the linear code (C) used to compute redundancy values. Namely, examples modify the linear code (C) so that it includes the all-one vector. With this modification, a system of the presently disclosed technology can detect and correct errors in an output vector from a Σ-CAM based on this modified / particularized linear code (C).

Examples of the presently disclosed technique provide a methodology for detecting and correcting errors in a summing content-addressable memory (Σ-CAM) while the Σ-CAM is performing a computational task (i.e., on-access error correction). The method includes adding redundancy columns to a Σ-CAM used to store a task-driven matrix (i.e., a matrix with values ​​corresponding to a computational task). In examples, an encoder may be used to calculate redundancy values ​​for the redundancy columns so that the Σ-CAM stores a codeword of a linear code (C) in each row. In examples, the linear code (C) used to calculate the redundancy values ​​is also modified. For example, in examples, the linear code (C) is modified to include the all-one vector.With this modification, a system of the presently disclosed technique can detect and correct errors in an output vector from a Σ-CAM based on this modified / particularized linear code (C).

The invention relates to a method for optimizing a function (F), the function (F) being a linear code with which a control matrix is associated, the function (F) comprising parameters that are the elements of the control matrix, the parameters taking their values from a set (E) of discrete values, the method using another function (L), referred to as a loss function, the method, which is implemented by a data processing device (100), comprising: executing a gradient descent step on the loss function (L) in order to obtain a parameter value (V1, V2, V3), the obtained values optimizing the function (F).

The invention discloses a customs commodity classification method and system based on multiple features of a table, and relates to the technical field of customs commodity classification. Comprising the steps that tabular customs commodity declaration data are acquired, and the data comprise numerical features, category features and text features; piecewise linear coding PLE is adopted for numerical value features, integer mapping is adopted for category features to be combined with an embedded layer, and RoBERTa pre-training model is adopted for text features to be combined with a linear transformation layer to be processed; stacking the three types of feature embedding vectors into an embedding matrix, and inputting the embedding matrix into a model based on a Transform architecture to complete multi-feature deep fusion; generating an adversarial sample, constructing a positive and negative sample pair, and combining cross entropy loss and contrast loss to train a model; and inputting to-be-classified tabular customs commodity declaration data into the trained model, and outputting a coordination system code corresponding to the commodity. According to the invention, the time cost and labor cost of manual auditing can be reduced, the error rate of manual classification can be effectively reduced, and the fairness and rationality of tax collection are ensured.

The invention discloses a secret sharing method based on a linear code general access structure. The method comprises the following steps: a sender selects and publishes security parameters of a secret sharing scheme; the security parameters comprise a parameter r in a finite field range and a bivariate one-way function, and the secret s is in the finite field range; the distributor selects a linear code, a generation matrix and a check matrix based on the number of users; the distributor randomly selects a vector and multiplies the vector by a generated matrix to obtain a corresponding character code, and the secret is equal to the vector multiplied by the first column of the generated matrix; any user selects a corresponding sub-secret and the sub-secret is checked by the distributor, so that the sub-secrets meet the condition that every two sub-secrets are relatively prime and are larger than the selected finite field; the distributor executes a secret distribution algorithm to calculate and obtain a general solution X meeting the congruence equation set, and the X is disclosed; and the authorized user cooperates with the bivariate one-way function according to the general solution X to reconstruct and recover the secret. According to the method, multiple times of use of the sub-secret is realized, and malicious behaviors of dishonest users are effectively resisted.

The invention discloses a linear coding caching method and device based on a non-semi-sum intersection set and a medium, and relates to the technical field of information processing. The linear coding caching method based on the non-semi-sum intersection set comprises the steps that the non-semi-sum intersection set is determined according to the number of users in a network, and the non-semi-sum intersection set comprises a block; generating a placement distribution array based on the non-semi-sum intersection set, wherein the type of the element in the placement distribution array is determined by the relationship between the block and the position of the element in the placement distribution array; transmitting the placement distribution array to a user side to determine file block information cached by a user from a server; and transmitting the placement distribution array to a server side to determine coding information broadcasted by the server. According to the technical scheme of the invention, the dimension for placing the distribution array can be associated with the number of users and the number of blocks of the file, so that the practicability and flexibility of the coding caching technology can be improved in the information caching process of the users and the information broadcasting process of the server.

There is provided a processing system (1) configured to execute a processing function f(x) in response to the receipt of an input information word x comprising k information symbols, the processing system comprising a protection device (10) configured to protect the execution of the processing function using a tweakable code-based masking, and a processing unit (11) to execute the processing function, by decomposing its execution into one or more basis operations comprising one or more elementary operations comprising at least a component-wise multiplication operation, the processing unit (11) comprising a multiplier (105) configured to perform the multiplication operation. The protection device (10) determines an encoding matrix A from an information code and a masking code, being linear codes and being determined randomly, the processing device comprising an encoder (102) configured to encode the input information word x, and each operand of an elementary operation, prior to its execution using the encoding matrix A. The multiplication operation performed by said multiplier (105) is further masked using the pseudo-inverse matrix A -1 of the encoding matrix A, and the pseudo-inverse transpose matrix A -T of the encoding matrix A, such that (AT)-1 = (A-1)T.

The invention provides a data object semantic identification generation method, which is characterized in that an original RQVAE linear codebook organization form is adjusted into a tree structure based on a method of combining a tree structure and an RQVAE (Residual Quantitative Variation Autoencoder), so that each data object has a respective independent semantic representation space when semantic identification construction is carried out, and the semantic identification of each data object can be realized. Meanwhile, according to different data semantic distribution, the size of each level codebook and the level corresponding relation can be flexibly adjusted. The obtained semantic identification is used for representing the data, particularly from the perspective of classification, the prefixes of the semantic identification id of the data objects of the same category are the same or similar, so that subsequent classification organization, retrieval, recommendation and the like of the data objects are facilitated, and during retrieval, the corresponding semantic identification id can be obtained through the semantics of the text for quick retrieval.

A processing system executes a processing function in response to receipt of an input information word including information symbols, including a protection device to protect execution of the processing function using a tweakable code-based masking, and a processing unit to execute the processing function, by decomposing its execution into basis operations including elementary operations including at least a component-wise multiplication operation. The processing unit includes a multiplier. The protection device determines an encoding matrix A from an information code and a masking code, being linear codes and determined randomly, the processing device including an encoder to encode the input information word, and each operand of an elementary operation, prior to execution using encoding matrix A. The multiplication operation performed by multiplier is masked using the pseudo-inverse matrix A−1 of the encoding matrix A, and a pseudo-inverse transpose matrix A−T of the encoding matrix A, such that (AT)−1=(A−1)T.

Some examples of the techniques described herein may address one or more issues for some non-linear channel codes (e.g., for artificial intelligence-based channel codes that are non-linear or that generate codes in the set of real numbers). Some of the techniques described herein, using a non-linear code with unequal error probabilities among codewords, may reduce error probability differences (e.g., may provide equal or approximately equal error probabilities) regardless of the messages to be transmitted while maintaining reduced average error probability. In some examples, scrambling may be performed to achieve reduced error probability differences among codewords for a non-linear code. Other scrambling approaches may be used to randomize inter-cell interference or to avoid biases in the generated codewords. In some approaches, scrambling may be performed after channel coding. Some examples of the techniques described herein may include performing scrambling before channel coding.

Examples of the presently disclosed technology provide a methodology for detecting and correcting errors in a summing content-addressable memory (Σ-CAM) while the Σ-CAM is performing a computational task (i.e., “on-access” error correction). The methodology involves adding redundancy columns to a Σ-CAM used to store a task-driven matrix (i.e., a matrix having values comporting with a computational task). Examples can leverage an encoder to compute redundancy values for the redundancy columns such that the Σ-CAM stores a codeword of a linear code (C) in each row. Examples also modify the linear code (C) used to compute redundancy values. Namely, examples modify the linear code (C) so that it includes the all-one vector. With this modification, a system of the presently disclosed technology can detect and correct errors in an output vector from a Σ-CAM based on this modified / particularized linear code (C).

The invention discloses a linear coding active interference elimination method for f-OFDM (Frequency-Orthogonal Frequency Division Multiplexing). In order to solve the problems that nonlinear coding is adopted in the prior art, CCs and data subcarriers are nonlinear, the correlation is relatively weak, and the form is more complex. According to the method, linear coding is introduced into an active interference elimination process, and the method specifically comprises the following steps: optimization solution of a linear mapping matrix, design of an optimization model by taking a linear coding matrix # imgabs0 # as a decision variable, solution after model conversion, multiplication of the linear coding matrix # imgabs1 # in an instantaneous mode, multiplication of the linear coding matrix # imgabs2 # and a data subcarrier vector # imgabs3 #, and optimization of the linear mapping matrix # imgabs0 # and the data subcarrier vector # imgabs3 #. And obtaining a CCs vector # imgabs4 # CCs deployment, and deploying the CCs on the edge subcarrier of the ith sub-band. By redesigning an AIC algorithm structure, a linear coding scheme is introduced into the AIC algorithm. The data subcarrier only needs to be multiplied by a linear matrix to obtain the CCs, the expression form is more intuitive and simpler, and the correlation between the CCs and the data subcarrier is stronger.

The invention provides a near-field dynamics neighborhood construction method and device. The neighborhood construction efficiency of particles can be improved. The method comprises the following steps: determining space coordinates of all particles in a preset simulation model; dividing a computational domain into a grid unit set according to the space coordinates; performing linearization processing on each grid unit in the grid unit set to obtain a unique linear code corresponding to each grid unit in the grid unit set; counting and recording the number of particles and the number of particles in each grid unit, and respectively establishing a corresponding relationship between the number of particles and the number of particles in each grid unit and the unique linear code; determining potential neighborhood particles of each first particle in all the particles according to the corresponding relation; and constructing a neighborhood particle set of each first particle according to the potential neighborhood particles of each first particle.

The invention discloses a space-time fusion-based information physical control system spoofing attack detection method, which comprises the following steps of: establishing an information physical control system model for deploying multiple types of sensors, and performing data acquisition by the system through an intelligent sensor; establishing an attack detection enhancement scheme of linear coding based on space-time fusion, and introducing a spoofing attack model; on the basis of system performance evolution analysis, an optimization problem for balancing detection performance and estimation performance is established; solving an optimal linear coding operator based on a numerical optimization tool; and a detection statistic is selected, and a detection threshold and an alarm strategy are set, so that the spoofing attack is detected. Potential correlation of the time sequence is enhanced through space-time fusion coding coupling, so that high-performance detection of spoofing attacks is realized. On the basis of the optimized space-time fusion coding design, the influence on the system estimation performance is reduced while the detection performance is ensured, and the problems that an existing spoofing attack detection method has certain limitation and is poor in applicability are effectively solved.