81 results about "Code word" patented technology

The present application relates to the technical field of satellite communication, in particular to a CSI feedback method based on MIMO low-orbit satellite communication, an electronic device and a medium.The CSI feedback method comprises: at the user end: extracting features of a channel matrix as downlink CSI by a BlockCsiNet encoder and compressing the channel matrix into a code word; the BlockCsiNet encoder comprises a first convolutional layer with a convolution kernel of 7*7 and 5*5; in the feature extraction process, the 7*7 and 5*5 convolution kernels of the first convolutional layer present a 11*11 receptive field, so as to extract the encoding features of the downlink CSI from the block sparse characteristics of the channel matrix of the downlink CSI; quantizing the code word into a bit stream; and returning the bit stream to a base station side BlockCsiNet decoder through a feedback link.The present application is beneficial to extracting the features of the block sparse channel matrix of low-orbit satellite communication, and effectively improves the reconstruction performance and reconstruction accuracy of the downlink CSI.

The application provides a low-density parity-check code decoding method and device based on a graph neural network, which comprises the following steps: step 1, constructing a factor graph comprising variable nodes, check nodes and edge relationships, and mapping log-likelihood ratio information of a received signal to initial embedding of the variable nodes; step 2, generating message features according to node embedding, node degree and iteration step length, and constructing attention weights for each edge to measure the importance of the message; step 3, inputting the message features and the attention weights into a gated recurrent unit to update the residual of the edge weight, and feeding back the updated edge weight to the graph structure; step 4, weighting and aggregating the messages from the adjacent nodes according to the edge weight, calculating the updated embedding of the variable nodes and the check nodes, and performing gated modulation combined with the check result; step 5, repeating steps 2 to 4 until a preset iteration number or a decoding convergence condition is reached, and mapping the final variable node embedding to a decoding result to realize LDPC code word recovery. By introducing the attention mechanism and the gated residual update into the message passing process, the application realizes adaptive modeling of the contribution degree of different edge messages, dynamically remembers the historical state, thereby improving the decoding performance and the convergence speed; meanwhile, the application can effectively reduce the bit error rate and is suitable for high-speed reliable data transmission scenarios in a 5G / 6G wireless communication system.

The application discloses a physical layer key generation method and system based on Gray-CDF quantization and adaptive LDPC syndrome negotiation. The legal communication parties acquire channel characteristic sequences in reciprocal wireless channels, determine multi-level equal probability quantization thresholds according to empirical cumulative distribution functions of local channel characteristics, and adopt Gray codes to map adjacent quantization intervals into code words with only one different bit, so as to generate original key sequences; subsequently, LDPC syndrome lengths are adaptively determined according to current channel quality or initial bit inconsistency rate estimation values, the syndromes are disclosed through a public channel to complete key error correction, and retry or discard processing is performed on decoding failure frames; after successful negotiation, privacy amplification is performed according to disclosed leakage, and a consistent key is obtained. The application can improve original key generation rate, reduce negotiation disclosure, and improve the reliability of physical layer key generation and the available key rate.

Provided are a method, system, and computer program product in whichdata is encoded for a plurality of tracks of a tape of a tape drive, by using an error correction code (ECC) scheme that applies a single code with code word symbols that are at least 10 bits. The code word symbols are interleaved along and across parallel tracks of the tape in the tape drive.

The present application belongs to the technical field of information security and coding theory, and provides a minimal linear code construction method, a secret sharing method and a secret sharing system, comprising: first defining a trace function in a finite field, constructing a two-to-one mapping, a vector Boolean function with a finite discrete value of Walsh spectrum, and then defining a code word set based on the function, embedding the output of the trace function into a linear code generation expression to generate a minimal linear code with a weight set and a support without strict inclusion; then using the dual code to establish a one-to-one correspondence between the participants and the dual code coordinates, the minimal code word support and the minimum access structure, embed the secret generation share distribution, and the participants meeting the conditions restore the secret through linear combination. The system contains four functional modules, which are suitable for distributed storage, blockchain key management and other scenes, and realize safe, efficient and expandable secret sharing. The present application can improve the security, efficiency and flexibility of secret sharing, and is suitable for multiple scenes and easy to expand.

The application discloses a wireless communication security transmission method, and belongs to the field of wireless communication security. The method comprises the following steps: an information sender encodes information to be sent to each legal receiver into a code word on a fine lattice by using a nested lattice code, wherein a secret message and an auxiliary message are generated for each information, the auxiliary message is a lattice point randomly selected from a coarse lattice, and the secret message is formed by mapping a mapping function to a coset of the coarse lattice; a precoding technology is used to isolate the information to be sent to each legal receiver, and a final sending signal is generated; and a legal receiver decodes the received signal to obtain the message to be sent by the information sender. The method uses a nested lattice code encoding scheme to minimize the information leakage rate of an eavesdropper, so that strong security of a communication system is achieved. Meanwhile, the secret message transmission between legal channels is realized by using a multi-user precoding technology, and the data security transmission between each point in a communication network is realized.

The application discloses a large language model weight compression method, an inference operation method, a system and a medium, and belongs to the technical field of large language model weight compression and inference operation optimization. The method comprises the following steps: acquiring a weight matrix of a large language model and constructing an exponential high-frequency window and a benchmark value, classifying and encoding each weight data into a fixed-length code word and splitting the fixed-length code word into an independent bitmap, synchronously generating a compact value stream and a rollback value stream, and packing the compact value stream and the rollback value stream into weight compression data; loading the weight compression data, generating a state mask and a channel prefix mask in a register based on the bitmap, calculating a reading offset by using a population count instruction, reading a compressed data segment from a corresponding data stream, reconstructing weight data in the register in combination with the code word, and finally directly inputting the weight data into a matrix multiplication unit for operation; therefore, by implementing the application, the problem of efficiency reduction caused by control flow divergence and redundant memory access in GPU inference of existing variable-length encoding can be solved, and the model inference efficiency under lossless compression can be improved.

The application provides a multimodal large model compression method and device based on sparse codebook quantization, and relates to the technical field of computer vision, wherein the method comprises the following steps: optimizing a visual encoder to make the weight significance distribution of an arbitrary large-scale visual-language model more concentrated; evaluating the influence of each layer weight of the optimized language model on the output through second-order information, and dynamically allocating the code word quantity of each weight group according to the significance; determining the optimal sparse combination from a large-scale codebook by adopting a two-stage strategy of high-level candidate search and low-level subset refinement; and completing model quantization by combining the combination and sparse coefficients, so as to balance the compression and inference performance. The dynamic code word allocation and hierarchical search method based on sparse coding does not need additional training, can adaptively allocate the optimal sparse code word combination, can keep the model expression ability under extremely low bits, and can improve the quantization compression efficiency and inference performance.

The application provides a decoding method, an encoding method, a device, a chip and a computing device. The method comprises the following steps: a decoding device acquires a first matrix, and then decodes a first code word vector according to the first matrix to obtain a decoding result. The first matrix is a 0-1 matrix representing elements in a second matrix on a polynomial ring. The second matrix is a check matrix on a finite field 2q, and the number of rows is r and the number of columns is n. A first polynomial corresponding to the polynomial ring is a q-th irreducible polynomial on a binary field. The number of 1s in the first matrix is less than the number of 1s in the 0-1 matrix representation of the second matrix. The first code word vector comprises k information code elements and r check code elements, and n=k+r. Each code element comprises q data units, and each data unit comprises at least one bit. The scheme can effectively reduce the hardware implementation complexity and cost of RS encoding and decoding.

The present application relates to the technical field of digital watermarking, and proposes an encryption video watermark embedding and extraction method based on deep learning, wherein after H.264 compressed video code stream is parsed, a selective encryption operation based on code word is performed to generate encrypted compressed domain video; in response to a video download request of a user, a unique watermark sequence is generated, the encryption state of the video is maintained, the watermark is embedded into the encrypted video, and the encrypted video containing the watermark is sent to the user; a to-be-detected video is acquired, and based on multiple video frames in which watermarks have been embedded, multiple multi-dimensional sparse syntax feature tensors are constructed from the compressed domain; based on the tensors, an anti-recompression watermark extraction network is used to decode the multiple video frames in which watermarks have been embedded, so that a prediction result of a watermark bit sequence carried by each video frame in which a watermark has been embedded is obtained; the multiple prediction results are spliced to extract a complete watermark. The present application can realize fast embedding of video watermark in a cloud environment and effectively resist re-compression attacks.

A system and method for Medical Claims Risk Score (MCRS) algorithmic underwriting includes a predictive machine learning model configured to generate underwriting decisions on electronic applications. MCRS underwriting applies word embedding modeling, such as GloVe (global vectors), to transform high dimensional MC records into single-code word vectors. These single-code word vectors are employed in regression modeling, and may include summarized embedding coordinates aggregated at the applicant level. Regression modeling uses medical claim codes data and underwriting decision data stored for historical underwriting applicants to train a random forest model to predict relative mortality risk for underwriting applicants. A risk rating may be derived from the underwriting decision data based upon standard quantitative risk ratings of a plurality of risk classes. Other inputs to the random forest model may include cohort level applicant profile data, such as applicant issue age and sex.

The application relates to the technical field of wireless communication, in particular to a communication method, device and readable storage medium in a wireless local area network, the method comprising: an information bit sequence is acquired by a sending end; the information bit sequence is encoded based on a check matrix of an LDPC code to obtain a code word, the code length of the LDPC code is 3888 bits, and the check matrix of the LDPC code is as shown in the embodiment; and the code word is sent. By adopting the application, stronger error control performance can be obtained, and the implementation complexity can be reduced. The application supports IEEE series protocols, such as IEEE 802.11bn / UHR protocols, IEEE 802.15 / UWB protocols, IEEE 802.11bf / sensing protocols or integrated millimeter wave / IMMW protocols. The application can also support star flash / spark link / nearlink standard protocols.

The application discloses a decoding method and device, electronic equipment and a non-transitory computer readable storage medium, and belongs to the technical field of communication. The method comprises the following steps: determining the activation probability of each user based on at least one sparse code division multiple access signal received in a current time period and the codebook of each user in a communication network; the activation probability represents the probability of a user sending a non-all-zero code word in the current time period; determining each activated user from each user in the communication network according to the activation probability of each user; constructing an initial factor graph based on the activated user and the subcarriers occupied by the non-zero elements in the corresponding codebook; and performing decoding processing on each sparse code division multiple access signal based on a message passing algorithm, the initial factor graph and the codebook of each user, to obtain the sending code word of each activated user, so that data detection can be performed only on the activated user; when the activation probability of a user is low, the user is directly considered as a non-activated user sending an all-zero code word, and the calculation complexity of data detection can be reduced.

A memory controller for a (dynamic random-access memory) DRAM die having m DRAM banks. The memory controller includes: an ECC engine configured to provide error correction for the plurality of DRAM banks, wherein the ECC engine includes: an encoding system configured to provide error correction coding (ECC) coding redundancy to a data component and generate an ECC codeword; and a partitioning system configured to partition the ECC code word into m segments for storage in the m DRAM banks, wherein a first subset of the m segments each include a portion of the data segment and a portion of the ECC coding redundancy, and a second subset of the m segments each include only ECC coding redundancy.

A system includes a memory device comprising a plurality of dies and a processing device coupled to the memory device. The processing device provides updated assignments of a plurality of blocks from a plurality of dies to a plurality of voltage offset bins to a code word error rate (CWER) machine learning (ML) model. The processing device receives, from the CWER ML model, a CWER distribution of the memory device. The processing device determines a tail slope value associated with the CWER distribution. The processing device determines whether the tail slope value satisfies a tail slope threshold criterion. Responsive to determining that the tail slope value associated with the CWER distribution satisfies the tail slope threshold criterion, the processing device causes a data associated with a block family to be refreshed.

A method of receiving, by a terminal according to one embodiment of the disclosure, a physical downlink shared channel (PDSCH) in a wireless communication system includes receiving downlink control information (DCI) for scheduling the PDSCH, and receiving the PDSCH based on the DCI. The PDSCH is related to a code word generated based on a polar code.

The application belongs to the technical field of aerospace electronic integrated circuits, and particularly relates to a satellite load FPGA configuration data error correction method and system resisting single event upsets, a double-layer error correction method of "bit-symbol" based on RS decoding operator error correction of a finite field algebra on the basis of a "two out of three" majority voting logic, which can correct single particle independent upsets and multiple copy common mode failures at the same time, and solve the traditional TMR error locking problem. Meanwhile, when configuration data is written into a non-volatile memory, a cross-sector spatial staggered dispersion storage mechanism is introduced, so that the symbols in the same RS code word are separated as much as possible in the physical position, so as to convert the aggregation physical damage into dispersed symbol level errors.

The application provides a layered beam training method and device based on channel coding, which encodes an L-bit binary sequence of indexes (0 to N T -1) of N T angle directions into an M-bit binary sequence by using an encoder; constructs a beam set by using N T M-bit binary sequences; generates a wide-beam layered codebook corresponding to the beam set based on a narrow-beam codebook; and performs layered beam training on each user by using the wide-beam layered codebook and a decoder to select an optimal beamforming code word of each user in the narrow-beam codebook. The layered beam training problem is modeled as a channel coding and decoding problem, so that the reliability of the layered beam training is improved by using the coding gain of the channel coding to improve the data transmission reliability and reduce the bit error rate; and the low pilot overhead of the layered beam training is ensured by using the advantages of the layered beam training.

The application discloses a front-end data compression method, device, equipment, medium and product. The method comprises the following steps: a main thread receives service data, and when a preset compression triggering condition is met, the main thread dynamically converts a pre-embedded script code string into an executable sub-thread, and the script code string comprises compression logic of a lightweight compression engine; the main thread encodes the service data and stores the service data in a binary buffer, and transfers the memory ownership of the binary buffer to the sub-thread through a message communication interface; the sub-thread creates a typed array view based on the binary buffer, calls the lightweight compression engine to compress the typed array view, generates a compression result, and transfers the memory ownership of the compression result to the main thread; and the main thread reports the compression result or locally stores the compression result. The method can realize efficient data compression in the front end, ensure smooth running of a front-end page, and reduce memory occupation and transmission delay.

The application provides an image adaptive quantization communication method and system, relates to the technical field of artificial intelligence and semantic communication, and comprises the following steps: performing feature extraction on an input image to form an initial code word representation; adopting an adaptive dynamic quantization mechanism to perform quantization processing on the initial code word representation to generate a code word index as a quantization feature; after the receiving end obtains the code word index of the sending end, performing inverse quantization by using a codebook knowledge base, and reconstructing a recovered image by using a decoder. The method and system provided by the application avoid representation collapse and realize adaptive matching and dynamic updating between codebook elements and semantic features through multi-codebook cooperation, a learnable linear transformation and a dynamic selection mechanism based on attention; and through quantization representation and transmission of the image and then decoding and recovery, the efficiency of image transmission is greatly improved, and an efficient and intelligent basic framework is provided for a next-generation semantic-oriented image communication system.

The application provides a source code string obfuscation method, an electronic device and a storage medium, and relates to the technical field of information security. The method comprises the following steps: acquiring an obfuscated character set, the obfuscated character set comprising one or more characters that need to be obfuscated; in response to receiving source code to be obfuscated, parsing the source code to be obfuscated into an abstract syntax tree, the abstract syntax tree comprising multiple nodes, each node comprising a string and corresponding literal original text, and the string comprising multiple characters; locating a node to be processed in the multiple nodes by traversing the abstract syntax tree, and acquiring the string of the node to be processed; determining whether each character in the string belongs to the obfuscated character set; and in the case where at least one character in the string belongs to the obfuscated character set, updating the literal original text corresponding to the at least one character to obtain an obfuscated string.

A method of reading an optical code (20); is provided, the method comprising the steps of recording image data having the optical code (20); determining defects (30), and evaluating the image data by reading the code words. In this respect, the defects (30) are determined using an edge criterion and / or a binarization criterion, wherein the edge criterion evaluates whether there is a code module in an edge-free region of the image data that is larger than a specified multiple of the module size, and wherein the binarization criterion evaluates whether a code module having gray scale values close to a binarization threshold has been recorded.

The application discloses a kind of DNA storage in prior information VT code iterative decoding method, system and storage medium, it is related to DNA storage technical field.The method is first obtained systematic code word sequence by VT code, generates noisy reception sequence by ID model simulation channel transmission;Again, joint grid chart is constructed and initialized, and soft information and bit decision information are obtained by completing SISO decoding calculation, and channel parameters are updated based on MAP drift tracking;After convergence by iterative control, multiple independent estimated code words are obtained, and finally original information sequence is recovered by multi-sequence majority voting fusion.The application constructs decoding-estimation closed-loop iteration framework, does not need prior channel parameters, can adaptively learn channel characteristics, capture error hot spot, improve decoding robustness by combining multi-sequence fusion, realize original data high reliability recovery, and promote DNA storage practicality.

The application discloses an LDPC decoding method and system with a dynamic clock-off function, and relates to the technical field of communication. The method comprises the following steps: counting the number of current code words to be decoded; counting the actual iteration number in the decoding process, and calculating the average iteration number; determining the number of decoding cores that need to be started with a clock signal according to the number of current code words to be decoded, the average iteration number and system performance constraints; and dynamically controlling the on-off of the clock signal of the decoding core based on the number of decoding cores that need to be started with the clock signal. The application can dynamically perceive the load and channel quality, accurately match the required decoding resources, and maximally reduce the power consumption of idle resources on the premise of guaranteeing the system performance constraints, and is suitable for high-bandwidth and low-power communication scenes such as 50G PON.

The application discloses a shortened LDPC decoding method and system with high coding gain, and the method comprises the following steps: initializing channel reception log-likelihood ratio information and extrinsic information transmitted from check nodes to variable nodes; taking the initialized channel reception log-likelihood ratio information and the extrinsic information transmitted from the check nodes to the variable nodes as first iteration input, performing iteration decoding calculation to obtain a code word decision result; and outputting the code word decision result as a decoding result. The application improves the accuracy of decoding and the convergence speed of decoding.

A communication device has a control section that generates a code word obtained by encoding information bits using an extended polar code that applies a stop of polarization achieved by addition of an XOR (Exclusive OR) operation and deletion based on the XOR operation, and a transmission section that transmits the code word to another communication device.

The application discloses a kind of near-field beamforming and codebook design method of columnar antenna array, comprising: modeling near-field columnar antenna array, by the geometric position relationship of user and antenna array, expression of beam focusing vector is obtained by simplifying;Respectively in elevation angle domain, azimuth angle domain and distance domain, the closed-form solution of corresponding beamforming gain is obtained by calculating beamforming gain;By controlling the correlation of beam focusing vector focused on different positions, respectively, the sampling method of elevation angle domain, azimuth angle domain and distance domain is obtained;Sampling is carried out to elevation angle domain, and azimuth angle sampling value and distance sampling value are obtained on the plane corresponding to elevation angle sampling value, finally obtain the three-dimensional codebook for near-field columnar antenna array beamforming.The application can effectively represent the beamforming gain of near-field columnar antenna array, meet the constraint of the correlation between code words, and focus signals to the expected position.