608 results about "Sparse matrix" patented technology

The invention discloses a big language model reasoning optimization method and system based on dynamic video memory compression and memory isomerism, and intelligent management of video memory resources is realized by integrating a dynamic compression strategy of KV Cache and a memory parallel architecture. The method comprises the following steps: 1) analyzing the spatial-temporal characteristics of the KV Cache in real time, adaptively selecting a quantization compression algorithm, a rarefaction algorithm or a low-rank decomposition algorithm, performing hierarchical storage based on attention head importance scores, keeping high precision of a core head, and implementing low-bit quantization on a secondary head; (2) the compressed inactive data are divided into a plurality of data blocks to be stored in a system memory, a parallel data channel group is established according to the number of physical channels, the compressed blocks are concurrently read through multiple channels during loading, and parallel decompression of a sparse matrix is accelerated through a GPU tensor core; and 3) constructing a KV Cache multiplexing mechanism and a parallel channel, and parallelizing a compression / decompression process and model calculation by adopting a hardware acceleration compression and asynchronous pipeline mechanism.

The invention discloses an APT attack path reconstruction method based on time sequence diagram comparison clustering and a medium. A security event standardized data set is obtained; mapping each security event into a multi-modal node through a heterogeneous time sequence diagram set construction method, and generating a directed edge to construct and complete a heterogeneous time sequence diagram set; a stage embedding time sequence diagram set is obtained through the joint attack stage set; outputting a time sequence diagram similarity matrix by adopting a multi-scale diagram similarity algorithm of time alignment perception; generating an event semantic sparse matrix based on the threat intelligence knowledge graph; obtaining an image clustering result set; uncertain samples in the graph clustering result set are obtained and processed, and an APT attack path reconstruction result is obtained. The problem that an APT attack path reconstruction method mainly depends on rule matching, single-dimensional feature comparison and manual analysis of security logs or alarm streams is solved, the interpretability of APT traceability is greatly enhanced, and subjective errors of manual research and judgment are reduced.

The invention relates to the technical field of audio processing, and discloses an audio processing method and system for speech spectrum reconstruction, and the method comprises the steps: carrying out the preprocessing of an original speech signal collected by a vehicle-mounted microphone, and obtaining a speech signal time-frequency matrix; performing singular value decomposition on the voice signal time-frequency matrix to obtain a sparse matrix representing voice components and a low-rank matrix representing noise components, and establishing a frequency band characteristic incidence matrix through a mutual information entropy calculation method; inputting the sparse matrix into a selection forgetting extreme learning machine for voice feature prediction to obtain predicted voice feature data; and based on the predicted voice feature data and the frequency band feature incidence matrix, performing voice probability calculation and feature interpolation on each time frequency point by adopting a logarithmic frequency spectrum amplitude calculation method to obtain reconstructed frequency spectrum data, thereby improving the accuracy of voice recognition and meeting the requirement of real-time processing in a vehicle-mounted environment at the same time.

The invention relates to a matrix double linked list compression storage computing device which comprises a definition module used for defining a plurality of register variables to represent double linked list compression storage of a matrix; the matrix data element processing module is used for deleting, inserting and / or covering matrix data elements in the Jacobian matrix; the matrix operation module is used for executing multiplication calculation of the Jacobian matrix and the column vector when the Jacobian matrix is a sparse matrix; and the matrix block resource allocation calculation module is used for calculating a product result component based on the matrix blocks of the Jacobian matrix when the Jacobian matrix is a non-sparse matrix, and the product result component is a result obtained by dividing a product result of the Jacobian matrix and the column vector according to row blocks. According to the method, the matrix operation speed during load flow calculation can be increased, consumption of storage resources on a chip is reduced, and the matrix calculation efficiency and the resource utilization rate are improved.

The invention provides an all-silicon carbide double-sided heat dissipation module packaging method based on gradient thermal resistance optimization, and belongs to the technical field of electronic component packaging. Establishing a thermal resistance characteristic curve, and calculating a gradient thermal resistance vector to determine a heat flow path; constructing a heat dissipation temperature distribution matrix; obtaining thermal diffusion data; heat dissipation path thermal resistance is calculated by combining the thermal diffusion matrix and the temperature distribution matrix, and a thermal resistance sparse matrix is established and is dimensionally reduced into a thermal resistance low-dimensional matrix; calculating an optimal heat dissipation path parameter set; inputting the parameter set into a thermal resistance prediction deep attention network model for verification and fine tuning, and generating a final thermal resistance distribution scheme; a module structure and a material ratio are designed according to the scheme to form a sandwich structure; a silver paste sintering process is adopted to realize low thermal resistance connection and complete packaging, and the technical problems of non-uniform thermal resistance distribution and difficulty in optimizing a heat flow path in a double-sided heat dissipation structure of a silicon carbide power module in the prior art are solved.

The invention relates to an accelerator and an acceleration method based on Top-K sparse moment vector multiplication. The accelerator comprises a first acceleration unit and a second acceleration unit. The first acceleration unit is used for data preprocessing and sparse matrix coding, and the second acceleration unit is used for executing Top-K sparse matrix vector multiplication so as to solve the process of the first K results with the maximum values in the operation results of multiplication of a sparse matrix and a dense vector; wherein the first acceleration unit comprises a preprocessing module and a coding module; the data preprocessing step of the preprocessing module comprises quantization, sparse reconstruction and shuffling; the broadband demand of data transmission is reduced based on the quantization step of the sparse matrix; pruning non-zero elements which have small influence on sorting based on a sparse reconstruction algorithm; carrying out shuffling operation on the sparse matrix after sparse reconstruction so as to avoid a Top-K aggregation phenomenon; and the coding module is used for recoding the preprocessed sparse matrix. The method has the remarkable effects that the end-to-end performance is improved by 153.3 times, 2.5 times and 3.4 times respectively.

The invention relates to the technical field of geophysical exploration, and particularly provides a three-dimensional finite element transient electromagnetic forward modeling calculation method based on an iterative solution method.The method comprises the steps that tetrahedron space discretization is carried out based on a vector finite element method, and an electric field is given to six edges of a space tetrahedron; constructing a back-pushing Euler finite element equation set, and assembling a linear system formed by a large sparse matrix based on the equation set; performing iterative solution on the linear system based on an FGMRES algorithm to obtain an electric field value corresponding to a spatial tetrahedron unit edge; optimizing a spatial tetrahedral mesh based on a quadratic nesting method, and optimizing a time step length based on a third-order backward Euler difference format; a grid pre-encryption method is adopted, the calculation error of iterative solution is reduced, a region decomposition method is used for achieving parallel calculation, and the calculation efficiency is greatly improved. According to the method, the requirements of high precision and high efficiency in three-dimensional transient electromagnetic forward modeling calculation can be met, and an advanced calculation tool is provided for resource exploration in a complex geological environment.

The invention provides an efficient privacy set intersection method and device based on bucket coding, and the method comprises the steps: obtaining an input set and a target value set, the input set comprises a private set of a sender and a private set of a receiver, and the target value set is generated based on the private set of the receiver; encoding the private set of the receiver into a sparse matrix composed of a plurality of buckets through a hash function; determining a linear system of the sparse matrix; performing ascending sorting and re-labeling on the linear system according to the initial bit position set to obtain a target linear system; according to a bucket-based Gaussian elimination algorithm, based on a target linear system, through exclusive-or operation, determining oblivious key value pairs for storage; an intersection of the private set of the sender and the private set of the receiver is determined based on the oblivious key-value pair storage according to an oblivious linear evaluation protocol. According to the invention, communication resources required by privacy set intersection in an actual production environment can be further reduced.

The invention belongs to the technical field of geophysics. According to the truncation model space three-dimensional magnetotelluric inversion method and system, a three-dimensional inversion objective function is constructed according to an inversion initial model, the inversion objective function is optimized by adopting a Gaussian-Newton method, and a Gaussian-Newton increment equation is obtained, a sensitivity matrix in the Gaussian-Newton increment equation is a sparse matrix which is obtained after truncation is carried out by adopting a distance truncation threshold value and a sensitivity amplitude truncation threshold value, the Gaussian-Newton increment equation is converted into an unconstrained least square form, and an inversion updating direction is determined according to the least square form; and performing iterative optimization according to the initial inversion model, the inversion updating direction and the model updating step length to obtain an updated inversion model. According to the invention, units with small contribution to inversion updating are effectively cut, and the model space corresponding to each piece of data is reduced.

The invention provides a multi-source constraint gridding atmospheric pollutant and greenhouse gas emission estimation method, and relates to the technical field of environmental information processing, and the method comprises the steps: constructing a hierarchical grid structure of an urban core domain and a peripheral background domain based on a unified data basic set, forming a gridding baseline emission list through unified activity data and emission factors, establishing a multi-source scale coordination mechanism, fusing ground monitoring and satellite observation information, and generating an observation data set; according to the method, an SMOKE sparse matrix processing chain is embedded to construct a joint estimation model, parameter inversion and consistency constraint optimization are implemented, boundary flux coordination is carried out between a core domain and a background domain, and finally an emission list which has cross-atmospheric pollutant and greenhouse gas consistency and can be used for refined emission inversion is formed. According to the method, the problem of unstable data fusion caused by scale mismatching between the multi-source observation data and the emission model in the prior art is solved.

The disclosure describes hardware compression of sparse matrix content. One embodiment provides a graphics processor, the graphics processor comprising: a base die, the base die comprising a plurality of chiplet slots; and a plurality of chiplets, the plurality of chiplets being coupled with the plurality of chiplet slots. At least one chiplet of the plurality of chiplets comprises: a graphical core cluster comprising a plurality of processing elements; a shared local memory coupled with the plurality of processing elements; a plurality of matrix engines coupled to the shared local memory; and codec circuitry coupled with the shared local memory and the plurality of matrix engines. Codec circuitry is configured to decode matrix data stored in a first format in a shared local memory into a second format for consumption by a plurality of matrix engines.

The invention discloses a sparse matrix processing method and device in an image recognition process, equipment and a medium, and relates to the field of computer image processing, and the method comprises the steps: inputting a feature image into a convolutional neural network; if the convolution kernel meets a preset sparse matrix condition, performing structured sparseness on the convolution kernel to obtain a sparse matrix, compressing the sparse matrix by using an improved compression sparse row format to obtain a compression matrix, and constructing an index matrix of the compression matrix; storing the feature image, the compression matrix, the index matrix and the preset bias matrix in a global memory, activating a target thread bundle in the computing core, and distributing the target thread bundle to a target data processing channel; loading the compression matrix and the index matrix to a shared memory corresponding to the target data processing channel by using the target thread bundle, and loading the feature image and a preset bias matrix to a register file; and executing the operation instruction to read the current matrix operation data from the shared memory and the register file to the matrix calculation unit to complete the matrix multiplication and addition operation.

The invention relates to the technical field of computing resource scheduling, and discloses a computing resource allocation method, device and equipment and a medium, and the method comprises the steps: constructing a global data set in a long-tail scene; a high-dimensional sparse matrix is constructed based on the global data set, the high-dimensional sparse matrix comprises a plurality of data dimensions, feature dimension reduction is performed based on the data dimensions to obtain a feature matrix after dimension reduction, and a feature sub-matrix is generated based on the feature matrix after dimension reduction; evaluating the feature sub-matrix, and determining the priority of the feature sub-matrix in the current scene based on an evaluation result; allocation of computing resources is adjusted based on the priority. According to the method, the vehicle-mounted system can preferentially process high-priority long-tail scenes under the condition that resources are limited, the processing efficiency is high, resource waste and processing delay are avoided, and the efficiency of the whole data processing chain can be optimized, so that the vehicle-mounted system has certain flexibility and coping capacity when facing complex and rare long-tail scenes.

Aspects of the disclosure are directed to hardware acceleration of structured sparse workloads with block quantization. A hardware accelerator can receive compressed input matrices, for example as part of a workload for training or processing a machine learning model. The hardware accelerator can multiply the compressed input matrix with a gains matrix loaded in one or more matrix multiply units (MXUs) of the hardware accelerator. The input matrices can be further provided in a block data type format, in which blocks of mantissas are represented with a single shared scaling factor. An MXU can multiply the block data, shift or cast the block data according to a shared scaling factor to generate an output product. To that end, block data type matrices exhibiting structured sparsity patterns can be accelerated without affecting the overall accuracy or quality of the output to the workload being processed.

The invention relates to a hierarchical optimization pruning method and device for electric power multi-modal defect detection and a medium, and the method comprises the steps: collecting multi-modal data in the defect detection of electric power equipment, inputting the multi-modal data into a pre-training defect detection model, carrying out the feature vector extraction of each modal, and carrying out the perception strategy based on a Hessian matrix, and obtaining the weight importance of each modal; calculating the L1 norm of each channel weight in the pre-trained defect detection model, evaluating the channel importance of the defect detection model, determining a redundant channel according to the L1 norm and cutting off the redundant channel, comparing the weight importance with a preset threshold, marking the weight importance lower than the preset threshold as a pruning object, generating a pruning mask matrix, and performing pruning on the pruning object; performing pruning operation on the pre-trained defect detection model through the pruning mask matrix; and sparse matrix representation optimization is carried out on the pruned model, and retraining is carried out. Compared with the prior art, the method has the advantages of enhanced adaptability, enhanced stability, high resource utilization rate and the like.

The invention provides a multi-LoRA large language model deployment system based on a cloud computing platform. A cloud computing AI platform layer trains a LoRA adapter matched with a basic large language model for a reasoning process; the multi-LoRA dynamic loading layer dynamically switches LoRA adapters needing to be mounted according to the request parameters, GPU optimization configuration is carried out according to service priorities in the request parameters, a basic large language model is loaded, and a plurality of LoRA adapters stacked in a sparse matrix form are mounted; and the resource scheduling optimization layer responds to the resource scheduling application, and outputs the request parameters subjected to priority management and hardware sensing optimization to the LoRA dynamic loading layer based on the container arrangement platform. According to the method, LoRA and container arrangement are deeply fused, and an automatic assembly line of training and reasoning is achieved. A video memory sharing mechanism enables a plurality of service scenes to share the same basic large language model, a LoRA adapter is loaded as required, and video memory occupation is greatly reduced. Full-life-cycle management from data preparation to model service is supported, and the large model deployment cost is remarkably reduced.

Embodiments are provided for converting a bit mask from a compressed format to an extended format. The bit mask is stored in a storage register in a compressed format. The compressed format does not include placeholder bits. The compressed format includes a single bit defining each element of a vector. The sizes of the elements can vary according to data types, for example, each element has 4, 8 and 16 bytes. In a single microoperation, the bitmask of the compressed format is converted to an extended format. The extended bit mask may be written to a predicate register. The extended bit mask includes a plurality of placeholder bits (the placeholder bits are not used in computation). The size of the extended bit mask corresponds to the size of the definition vector, including a plurality of elements of the data type. The extended bit mask may be used to execute an instruction. For example, a vector processor multiplies a sparse matrix with the vector using the extended bit mask.

The invention provides a sparse triangle solution parallel optimization method and system based on a GPU, and relates to the technical field of high-performance parallel computing. Obtaining a to-be-solved linear equation set; decomposing a sparse coefficient matrix in the system of linear equations to obtain a triangular sparse matrix; based on the triangular sparse matrix, sparse triangular parallel solving is carried out, and a final solution is obtained; wherein the sparse triangle parallel solution is characterized in that the hierarchy of each non-zero element is determined according to the dependency relationship among the non-zero elements, sub-tasks executed in sequence are divided based on the hierarchy, parallel solution is carried out by adopting the non-zero elements in the same hierarchy in a single sub-task, and synchronous solution is carried out among blocks among different hierarchies; obtaining a final solution through the kernel of the GPU; according to the method, the multi-thread parallelism of sparse triangle solution on the GPU can be further improved, and the problems of load imbalance and low resource utilization rate can be effectively avoided.

The invention discloses a high-speed imaging method, system and device based on an SPAD array and a time counting circuit. The method comprises the following steps: acquiring original data of a photon event to obtain an original photon counting matrix of each frame; performing statistical modeling based on the original photon counting matrix to obtain a dynamic threshold matrix; performing threshold filtering based on the dynamic threshold matrix in combination with the original photon counting matrix to obtain a sparse matrix; and performing accumulation and image reconstruction based on the multi-frame original photon counting matrix to output a final image. The high time resolution of the SPAD array and the TCSPC is combined with the BNQSA algorithm, the noise problem of high frame rate imaging under extremely low illumination is solved, the system has the characteristics of high sensitivity, real-time performance and low power consumption, and a breakthrough solution is provided for a weak light scene.

A honeycomb-shaped active power distribution network topological structure selection and optimization method based on a graph theory comprises the following steps: taking line impedance and rated apparent power as constraints, constructing a multi-target weight factor, adopting an improved spectral clustering algorithm to cluster and distribute power grid nodes, and transiting a micro-grid group after cluster division into a honeycomb-shaped active power distribution network; abstracting each micro-grid as a honeycomb distribution network single node, constructing a connection relation mathematical representation of the HSPH and the micro-grid, and realizing sparse matrix method modeling of the honeycomb active power distribution network; optimizing a site selection strategy of the HSPH by taking a maximized HSPH return on investment index and a system stability index as a target function; and optimizing the energy storage capacity of the HSPH based on the net load time sequence data of the micro-grid group, and finally generating an optimal topological structure of the honeycomb-shaped active power distribution network. And through honeycomb topology and HSPH addressing and sizing optimization, the new energy consumption capability of the power distribution network is improved, and the economy, reliability and flexibility of the power distribution network are improved.

Provided are a distributed parallel computing based graph computing method, a distributed parallel computing system and a computer readable medium. A graph computing method comprises: obtaining data of a graph to be computed, the graph comprising a plurality of vertices and edges; storing the graph according to a compressed sparse row format, and storing the graph in a sparse matrix form, wherein all adjacent edges having a same vertex are continuously stored, and an offset array is used to support an index function thereof; and for subgraphs in which the degrees of both source vertices and target vertices are greater than a predetermined threshold, in forward graphs, performing segmentation according to target vertices, i.e., the column of a matrix, and in reverse graphs, performing segmentation according to source vertices, i.e., the row of the matrix, and further dividing the subgraph into a plurality of segmented subgraph (SSG) components, so that a target vertex in each SSG is limited within a preset range. According to the SSG method of the embodiment for a high-degree vertex, the conventional problem that the space-time locality of accessing data of an adjacent vertex is poor due to a large vertex range of a single large graph is avoided or relieved.

The invention relates to a risk control method for cross-border trade data. Cross-border trade behaviors are divided into three levels, namely a system type layer of national system / policy triggered transaction, a business type layer of a process chain and an execution type layer of data submission / customs clearance / payment behaviors. Modeling a behavior stability mapping relation among the three hierarchies through sparse matrix reconstruction and adversarial noise regression; introducing an interlayer fluctuation tension coefficient for each transaction to measure offset appearing in a behavior chain; when the tension peak value exceeds a training threshold value, even if single-point data is not abnormal, the event is marked as a potential risk transition event; according to the method, cross-border transaction behaviors are divided into a system type layer, a business type layer and an execution type layer, and an interlayer fluctuation tension coefficient is introduced, so that a cross-level collaborative imbalance phenomenon in a transaction chain is effectively captured. Even under the condition that no obvious field anomaly exists, the pseudo-legal transaction mode caused by behavior chain structure mutation can be recognized, and early warning of non-dominant structure anomaly is achieved.

The invention relates to a fault arc-caused fire early warning method based on multi-sensor fusion, and belongs to the field of fault arc fire. The method comprises the following steps: establishing an arc electrical fire cause fault simulation test platform, selecting a typical single load and a combined load to perform a test before normal operation of a line and the occurrence of an arc cause fire, and establishing a fault arc waveform database and an arc fire database; the power-on detection method for the fault arc detection device is based on dictionary learning, current characteristics are represented through a sparse matrix, and fault classification is carried out in combination with an SVM. The fluctuation range of a plurality of characteristic quantities of the line in a normal state and when a fault arc occurs is analyzed, a threshold value is determined according to the periodic increase ratio of the characteristic quantities in different states, a final combined load detection threshold value is formed by complementation of a plurality of threshold values, and fault arc detection is realized; and based on the arc fire database, training a double-layer LSTM model under Bayesian optimization, and identifying multi-sensor signals in a time window to realize fire early warning.

The invention relates to the technical field of image analysis, in particular to a metal composite material surface defect intelligent detection method based on machine vision, which comprises the following steps: acquiring an original image and converting the original image into an observation matrix; decomposing the matrix into a low-rank matrix and a sparse matrix through a robust principal component analysis algorithm; utilizing a nuclear norm constraint low-rank matrix to establish a background statistical model, and utilizing a norm constraint sparse matrix; positioning a defect area in the sparse matrix and extracting a gray level co-occurrence matrix feature vector; performing connected domain analysis on the sparse matrix, calculating geometrical morphology parameters and evaluating a stress concentration coefficient; and establishing a self-adaptive decision model to carry out fusion judgment so as to judge the physical damage. According to the method, through low-rank sparse matrix decoupling and multi-dimensional statistical geometric feature fusion analysis, accurate stripping of weak defects and quantitative evaluation of physical damage attributes under a complex background are realized.

The invention relates to the technical field of signal processing, and discloses a multichannel data acquisition system and method based on an FPGA (Field Programmable Gate Array), an acquisition module drives a global counter by using a global synchronous clock, writes acquired data into an annular buffer area with a physical address and a counter value in a linear mapping relationship, and establishes implicit time index storage. When a trigger event occurs, the system broadcasts the locked global trigger timestamp, and the acquisition module backtracks and reads historical data according to the global trigger timestamp, and packages the historical data into a sparse matrix type data packet in combination with the channel validity mask. And after receiving the data packet, the data processing module directly calculates a memory mapping address by using global time information in the data packet, and writes a data load into a corresponding position of the waveform reconstruction buffer area. According to the method, through strict binding of the physical address and the absolute time, independent time label redundancy is eliminated, high-precision synchronization of distributed multiple channels is ensured, and out-of-order automatic in-situ recombination and efficient waveform reconstruction of data of a receiving end are achieved.

The invention discloses a pulse thermal imaging sequence key frame extraction method based on robust principal component analysis, and the method comprises the steps: firstly calculating a difference image between adjacent images of an original thermal image sequence, solving the L1 norm of a difference result, and determining a starting frame of pulse excitation according to the maximum value of the L1 norm; decomposing the thermal image sequence by using robust principal component analysis, and extracting a key frame according to the sparsity of a sparse matrix; and finally, extracting a sample region in the thermal image by using a local maximum entropy threshold segmentation method to obtain a thermal image key frame sequence containing the sample region. According to the method, manual key frame screening and ROI clipping in the prior art can be perfectly replaced, the space-time distribution characteristics of the thermal imaging sequence are fully utilized, a complete and efficient pulse thermal imaging sequence key frame automatic extraction algorithm framework is developed, and the defect recognition efficiency and the automation level are improved in practical application.

The invention discloses an aircraft simulation method, device and equipment based on parallel block sparse matrix incomplete LU decomposition and a medium, and relates to the technical field of simulation, and the method comprises the steps: building a block sparse matrix comprising a plurality of zero sub-blocks and non-zero sub-blocks based on the topological relation of each grid point in an aircraft grid and simulation physical parameters, determining dependency pairs respectively corresponding to a plurality of non-zero sub-blocks from the non-zero sub-blocks, and storing the dependency pairs by adopting a preset data structure; wherein the dependent pair comprises a pair of matched non-zero sub-blocks; respectively distributing the plurality of non-zero sub-blocks to a plurality of GPU thread bundles for parallel processing so as to update the corresponding non-zero sub-blocks based on the updated dependency pairs after the GPU thread bundles complete updating on the dependency pairs corresponding to the corresponding non-zero sub-blocks; and after the plurality of non-zero sub-blocks are updated, updating the block sparse matrix based on the plurality of updated non-zero sub-blocks, and determining an incomplete LU decomposition result according to the updated block sparse matrix so as to perform aircraft simulation.

One embodiment provides a graphics processor comprising a base die including a plurality of chiplet sockets and a plurality of chiplets coupled with the plurality of chiplet sockets. At least one of the plurality of chiplets include a graphics core cluster including a plurality of processing elements, a shared local memory coupled with the plurality of processing elements, a plurality of matrix engines coupled with the shared local memory, and codec circuitry coupled with the shared local memory and the plurality of matrix engines. The codec circuitry is configured to decode matrix data stored in the shared local memory in a first format into a second format for consumption by the plurality of matrix engines.

The invention discloses a dynamic compression coding method, which is applied to a sparse matrix, and comprises the following steps: S1, obtaining the sparse matrix, and generating a bitmap with the same dimension as the sparse matrix, a value in the bitmap being used for indicating whether an element at a corresponding position in the sparse matrix is zero; s2, a mark sequence is generated according to the bitmap, and each mark corresponds to multiple continuous elements in the sparse matrix and is used for representing whether each element in the multiple elements is zero or not; s3, extracting non-zero elements in the sparse matrix according to the mark sequence; and S4, combining the flag sequence with the non-zero elements to form a data stream after compression coding. The invention also discloses a dynamic compression coding system, a storage medium and a device. According to the dynamic compression coding method, the index storage cost can be reduced, the data access efficiency can be improved, the storage and bandwidth occupation can be reduced by supporting parallel coding and decoding, and finally the calculation throughput can be improved.

There is described an improved method of ordered statistics decoding where a decoder generates a sparse matrix having a rank of r based on input stabilizer data and error probability weights. The sparse matrix includes a first sub-matrix defined as the r linearly independent columns of the sparse matrix. A transformation matrix, having the same size as the first sub-matrix, is initialized and updated with one or more linear transformations generated based on a transformation vector determined as a dot product of the transformation matrix and a non-zero column of the sparse matrix. An estimated error, which can be utilized to perform error correction, is determined based on the updated transformation matrix.