69 results about "List decoding" patented technology

Systems, methods, and instrumentalities are disclosed for most probable mode (MPM) list generation with template-based intra mode derivation (TIMD). An example method involves determining an intra coding mode derivation process is enabled for a first coding block; based on the intra coding mode derivation process being enabled for the first coding block, generating a first MPM list for the first coding block based on a first MPM list generation process; decoding the first coding block based on the first MPM list; determining that the intra coding mode derivation process is disabled for a second coding block; based on the intra coding mode derivation process being disabled for the second coding block, generating a second MPM list for the second coding block based on a second MPM list generation process, different from the first MPM list generation process; and decoding the second coding block based on the second MPM list.

The invention discloses a reliability parameter assisted low-complexity polarization code rate matching method, and belongs to the technical field of wireless communication. Aiming at the problem that a proper punching site is difficult to select during rate matching due to a recursive structure of a polar code, the invention provides a polar code punching site selection algorithm based on a reliability parameter. An information bit reliability parameter is defined to calculate the reliability of candidate punching bits, and the optimal punching position is selected by traversing and solving the minimum value of the maximum reliability parameter. In order to solve the problem of high complexity of the existing polar code rate matching method, an interleaving algorithm and a pruning serial offset list decoding algorithm based on rate matching parameter mapping are provided, secondary sorting calculation of an interleaver is avoided, and a calculation unit updating strategy of a decoder is simplified. The polarization code rate matching method provided by the invention not only can improve the rate matching coding gain, but also can effectively reduce the calculation complexity.

Provided are a quick list decoding method and apparatus for polarization-adjusted convolutional code special nodes, a computer electronic device, a computer-readable storage medium, a computer program product, and a computer program. The method comprises: determining special nodes in a decoding tree for list decoding of a polarization-adjusted convolutional code, wherein the special nodes comprise a source node and a code rate-0 or repetition code sub-node sequence, and the special nodes are identified by means of a sequence set; calculating a log-likelihood ratio of the source node corresponding to the special node, and determining the number of paths; on the basis of the log-likelihood ratio and the sequence set corresponding to the special nodes, calculating the metrics of the paths, and reserving the paths having the minimum metric, the number of reserved paths being the set number of lists; decoding the source node by taking the reserved paths as inputs to obtain an estimated code word of each path of the source node; and calculating an estimated output bit and an estimated information bit of the special node by means of the estimated code word.

Low latency search for nearest neighbors in a dataset containing a large number of entries is improved using an error correction code (ECC) for partitioning data into clusters and retrieval. During initialization and preprocessing a d-dimensional space with clusters corresponding to ECC codewords is specified. Entries in the dataset are embedded into this space and associated with respective codewords, each codeword specifying a cluster. An index associates the codewords, clusters, and entries. During a query of the dataset, a query entry is processed to determine a query embedding in the d-dimensional space. The query embedding is used as input for a list decoder of the ECC. The list decoder provides a set of nearest codewords, with those codewords representing a set of candidate clusters that may contain nearest neighbors. The dataset entries associated with the candidate clusters may then be searched to determine query results comprising specific entries.

The application provides a polar code soft input soft output decoding method, a decoding device and a communication device; the decoding method comprises the following steps: (S1) performing fast serial cancellation list decoding under dynamic frozen bit constraint for all special nodes constituting a polar code; the types of the special nodes comprise rate zero, rate one, repetition and single parity check; (S2) calculating the approximation of the sum of the posterior probabilities of the legal code words not accessed under each special node after decoding; (S3) using the approximation of the code book probability obtained in the step (S2) to calculate the bit level soft information of the output polar code. The low-latency polar code soft input soft output decoding method provided by the application improves the parallelism by realizing fast soft output decoding based on the Rate0, Rate1, REP and SPC nodes, and significantly reduces the decoding latency without losing the soft output precision compared with the SO-SCL decoding algorithm.

The invention belongs to the field of secure multi-party computing, and discloses a method for combining an RS (Reed-Solomon) code list decoding algorithm, cyclic redundancy check and a secure multi-party computing scheme, which improves the security of secure multi-party computing. And theoretically, the algorithm combining RS code list decoding and CRC exists, so that the secure multi-party computing scheme can resist at most one half of hostile attackers. Meanwhile, a specific method combining an RS code list decoding algorithm and CRC is given, the limitation of the unique decoding radius of the RS is broken through, the error correction capability of the RS code is improved with high probability, and the security of secure multi-party calculation is improved. The method specifically comprises the following steps: calculating a CRC check code of information and combining the CRC check code with the information to obtain a combined code word; performing RS coding on the code word; carrying out list decoding on the attacked code word; each code word in the list is verified, and original information and a secret value are obtained in a probabilistic mode.

The invention discloses a polarization code construction method and device for a serial cancellation list decoder. The method comprises the following steps: calculating a serial cancellation list decoding algorithm performance lower bound; and determining a polarization code information bit set according to the performance lower bound of the serial offset list decoding algorithm. According to the polarization code construction method and device for the serial offset list decoder disclosed by the invention, the polarization code can be constructed by utilizing the polarization code serial offset list decoding lower bound, the error performance of the polarization code is improved, the error rate is reduced, and the communication requirements of high reliability and high spectral efficiency are met. The method is simple and convenient to operate, is particularly suitable for being applied to an actual communication system, and has a very good practical prospect.

The invention provides a polarization code soft input soft output decoding method, a decoding device and communication equipment. The decoding method comprises the following steps: (S1) aiming at all special nodes forming a polarization code, fast serial cancellation list decoding under dynamic frozen bit constraint is executed, and the types of the special nodes comprise rate zero, rate one, repetition and single parity check; (S2) after each special node is decoded, calculating the approximation of the posterior probability sum of legal code words which are not accessed under the node; and (S3) utilizing the approximate estimation codebook probability obtained in the step (S2) and calculating bit-level soft information of the output polarization code. Compared with an SO-SCL decoding algorithm, the low-delay soft input and soft output decoding method for the polarization codes, provided by the invention, has the advantages that the degree of parallelism is improved and the decoding delay is remarkably reduced on the premise that the soft output precision is not lost by realizing rapid soft output decoding based on the Rate0, the Rate1, the REP and the SPC nodes.

The present invention relates to the field of electronic communication technologies, and more specifically, to a method for generating quasi-cyclic hyperelliptic codes. The method includes: S1. Selecting a hyperelliptic curve according to given coding parameters; S2. Generating a divisor on the corresponding curve according to the given coding parameters; S3. Calculating a compact generator matrix by using the hyperelliptic curve and the divisor. The present invention can generate quasi-cyclic codes or cyclic codes of any length by using hyperelliptic curves, and obtain the algebraic geometric expression form of the generated quasi-cyclic codes and the expression form of the compact generator matrix. The present invention establishes a connection between hyperelliptic curves and quasi-cyclic codes, and solves part of the problems of representing quasi-cyclic codes and cyclic codes in algebraic geometric forms. The hyperelliptic quasi-cyclic codes generated by the present invention have a clear algebraic geometric structure, and this structure can be used for decoding methods unique to algebraic geometric codes such as list decoding, thereby improving the error correction ability of channel coding and reducing the storage space of the coding matrix.

The present disclosure provides an iterative receiving method of a polar coded continuous phase modulation signal and a related device. The method comprises: receiving, by a demodulator, a continuous phase modulation signal from a channel, and determining an initial accuracy parameter, a forward metric and a backward metric of the continuous phase modulation signal; performing, by the demodulator, an operation on the initial accuracy parameter to obtain a target accuracy parameter; performing, by the demodulator, a recursive operation on the forward metric and the backward metric based on the target accuracy parameter to obtain a multi-ary code word probability, and obtaining an estimated information stream at a receiving end based on the multi-ary code word probability and converting the estimated information stream into a decoder prior information stream; performing, by a decoder, a decoding process on the decoder prior information stream based on a serial cancellation list decoding algorithm to obtain a candidate code word sequence, performing a decoding process on the candidate code word sequence based on a belief propagation decoding algorithm, and judging whether the decoding process meets a preset termination condition, and outputting a source information bit or a target information stream at the receiving end according to a result of the judgment.

A system and a method may include a receiver circuit configured to receive an encoded codeword over a channel from an encoder neural network of an encoder, and a decoder circuit, including a decoder neural network, configured to decode the encoded codeword, and generate a list of decoded message words, the list of the decoded message words including a plurality of candidate message words representing the message word.

The invention relates to the technical field of intelligent irrigation, in particular to a landscaping intelligent irrigation method and system based on the Internet of Things. The method comprises the following steps of: acquiring soil humidity, environment temperature and node electric quantity on an irrigation node side, mapping the soil humidity, the environment temperature and the node electric quantity to an information bit channel, receiving channel reliability distribution parameters, setting a code rate, setting a bit value of a frozen bit channel, and performing serial offset list decoding on a polarization code on a control terminal side. And when the soil humidity change rate exceeds a range set based on a physical environment model, applying nonlinear attenuation penalty to the intermediate path, generating an irrigation strategy, calculating a decoding confidence coefficient, generating a channel reliability distribution parameter for adjusting a code rate of a next transmission period, and returning the channel reliability distribution parameter to an irrigation node. According to the scheme of the invention, a wrong decoding result caused by strong interference can be eliminated, the reliability of data decoding under a severe channel is improved, the resource waste can be reduced, and the energy efficiency and the reliability are balanced.

Methods, systems, and devices for wireless communications are described. A wireless device may receive a signal including a polar encoded control message. A message payload of the polar encoded control message may be associated with known bits information that may indicate one or more bit positions of one or more known bits and a respective bit value for each of the one or more known bits. The wireless device may perform successive cancellation list polar decoding on the signal to obtain the message payload of the polar encoded control message by generating list decoding bit sequences. A path metric of a list decoding bit sequence may be based on application of a bias penalty value to one or more bit decisions in the list decoding bit sequence that differ from a known bit value at a bit position in accordance with the known bits information.

Certain aspects of the present disclosure provide techniques for Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for determining a minimal list size to use in list decoding operations for reducing resource consumption (e.g., compute, memory, and power) at a decoder. A method includes receiving a codeword comprising a plurality of channel bits encoded with an error-correcting code, the plurality of channel bits comprising, at least, a plurality of information bits, determining a payload size of the codeword, determining a channel capacity metric for the plurality of channel bits, determining a minimal list size for a list decoding operation based on at least the payload size and the channel capacity metric; and performing the list decoding operation on the codeword based on the minimal list size to obtain the plurality of information bits.

Communication systems and methods are disclosed involving the transmission and reception of short block-length messages. In many embodiments, transmitters are utilized that encode messages by combing: at least a first partial codeword generated using a first encoder based upon a first convolutional code and a first expurgating linear function: and a second partial codeword generated by a second encoder based upon a second convolutional code and a second expurgating linear function. In a number of embodiments, receivers are utilized that decode received messages using a full decoder that reconstructs the transmitted message bits based upon: at least a first set of partial codewords produced by a first partial decoder based upon the first convolutional code and the first expurgating linear function; and a second set of partial codewords generated by a second partial decoder based upon, the second convolutional code and the second expurgating linear function.

The present invention discloses a puncturing method and system based on recursive list decoding of RM codes. The method includes the following steps: S1. Determine a puncturing order set based on the column weights of RM codes; S2. Select a puncturing index from the puncturing order set to obtain a puncturing set F, puncture the bit positions of the puncturing indexes in the puncturing set F, and set the log-likelihood ratio at the puncturing positions to zero; S3. Input the punctured information bits and the unpunctured information bits into the decoder in the original order; S4. Decode the RM code through the decoder using a recursive structure, and select the one with the minimum path metric value from the decoding paths as the output result. The present invention selects the puncturing order according to the column weights of the generating matrix G of RM codes, and has better error performance, higher information transmission capacity, and higher information transmission efficiency in the case of a large number of puncturing.

Systems, methods, and instrumentalities are disclosed for most probable mode (MPM) list generation with template-based intra mode derivation (TIMD). An example method involves determining an intra coding mode derivation process is enabled for a first coding block; based on the intra coding mode derivation process being enabled for the first coding block, generating a first MPM list for the first coding block based on a first MPM list generation process; decoding the first coding block based on the first MPM list; determining that the intra coding mode derivation process is disabled for a second coding block; based on the intra coding mode derivation process being disabled for the second coding block, generating a second MPM list for the second coding block based on a second MPM list generation process, different from the first MPM list generation process; and decoding the second coding block based on the second MPM list.

The invention relates to a wireless mouse data secure transmission method based on Polar codes and chaotic encryption. The wireless mouse data secure transmission method comprises the following steps: iteratively generating a dynamic key sequence through a Logistic mapping chaotic system; according to the mouse original data blocking result and the dynamic key sequence, determining a preprocessed data block; dynamically generating a channel polarization matrix according to the chaotic sequence value; according to the channel capacity characteristics and the data priority index of the channel polarization matrix, calculating the distribution priority of each bit position through a balance factor; carrying out Polar coding according to the preprocessed data block, the channel polarization matrix and the distribution priority, and carrying out superposition chaotic phase modulation to generate an encrypted signal; and performing phase demodulation on the received encrypted signal according to the synchronous chaos sequence, and recovering original data by using the reconstruction polarization matrix through a list decoding algorithm to obtain a reconstructed data block. According to the invention, the data transmission safety and reliability of the wireless mouse can be improved.

Error-correcting performance of polar codes is improved by assigning parity check bits to small, reliable indices. Zeros are assigned to message indices not among a most-reliable set of the message indices, information bits and parity check bits are assigned to the most-reliable set of the message indices, with the parity check bits generated on the information bits assigned to the smallest of the most-reliable set and then assigned to the smallest indices of the most-reliable set that follow the information bits on which the parity check pits are generated. During successive cancellation list decoding, the parity check bits allow error events to be promptly corrected during decoding.

The invention belongs to the technical field of communication coding, and discloses a high error correction capability coding and decoding method and system based on Reed-Solomon code list decoding and algebraic manipulation codes, and the method comprises the steps: firstly coding a message with the length of r on a finite field by using a system AMD code, and obtaining a coding codeword; an RS code with a parameter of [n, r + 2] on a finite field is taken, and RS code coding is carried out on the obtained coding codeword; performing list decoding of the RS code with the list size of the received code word; and carrying out AMD code decoding on the code words in the list so as to correctly recover the original code words according to the probability. According to the method, the AMD code is introduced to code the information in advance, and the list decoding result of the RS code can be effectively and uniquely output at a high probability by combining the high error detection capability of the AMD code with the list decoding of the RS code. The unique decoding radius is effectively improved under high probability, and remarkable technical progress is realized.

Certain aspects of the present disclosure provide techniques for Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for determining a minimal list size to use in list decoding operations for reducing resource consumption (e.g., compute, memory, and power) at a decoder. A method includes receiving a codeword comprising a plurality of channel bits encoded with an error-correcting code, the plurality of channel bits comprising, at least, a plurality of information bits, determining a payload size of the codeword, determining a channel capacity metric for the plurality of channel bits, determining a minimal list size for a list decoding operation based on at least the payload size and the channel capacity metric; and performing the list decoding operation on the codeword based on the minimal list size to obtain the plurality of information bits.

Communication systems and methods are disclosed involving the transmission and reception of short block-length messages. In many embodiments, transmitters are utilized that encode messages by combing: at least a first partial codeword generated using a first encoder based upon a first convolutional code and a first expurgating linear function; and a second partial codeword generated by a second encoder based upon a second convolutional code and a second expurgating linear function. In a number of embodiments, receivers are utilized that decode received messages using a full decoder that reconstructs the transmitted message bits based upon: at least a first set of partial codewords produced by a first partial decoder based upon the first convolutional code and the first expurgating linear function; and a second set of partial codewords generated by a second partial decoder based upon the second convolutional code and the second expurgating linear function.

Provided are an apparatus and method for decoding a successive cancellation list of polar codes by using power gating. The apparatus for decoding a successive cancellation list of polar codes by using power gating according to an embodiment comprises: a plurality of successive cancellation list decoding units that receive polar-encoded codes and decode the codes by using a successive cancellation list technique; and a power gating circuit unit that is connected to a preset number of successive cancellation list decoding units among the plurality of successive cancellation list decoding units and controls the supply of current.

The present invention provides a polar code list decoding method, system, electronic device and storage medium for outputting soft information. The polar code list decoding method for outputting soft information includes: performing an initialization operation on an information transfer binary tree based on soft cancellation, and dividing information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; for all paths in the list, determining a first soft information vector based on soft cancellation, the first soft information vector respectively indicating the received soft information vector from a superior node; determining a second soft information vector based on the first soft information vector, the second soft information vector indicating the output soft information vector transmitted to the superior node; selecting a first path with the highest reliability from all paths; and ending decoding and outputting the second soft information vector of the first path as the soft information provided to a previous module.

The invention discloses a least unreliable bit (LRB) identification method based on a cumulative distribution function (CDF). In some embodiments, the receiver includes a detector and a decoder. The detector is configured to receive a codeword and determine a list of reliability values for bits included in the codeword. The decoder is configured to receive a codeword and a list of reliability values from the detector, calculate a CDF list of reliability values for the codeword, identify a group from the CDF list that includes a particular number of LRBs having reliability values within a threshold range, and determine a location in the codeword for each LRB in the group.

The application claims a reliability parameter assisted low complexity polar code rate matching method, belonging to the technical field of wireless communication. In view of the problem that the recursive structure of polar code makes it difficult to select suitable puncturing bits during rate matching, a polar code puncturing bit selection algorithm based on reliability parameters is proposed. Based on the analysis of the decoding process of polar code and the influence of the box operation on the selected puncturing bits, a kind of information bit reliability parameter is defined to calculate the reliability of the candidate puncturing bits. The optimal puncturing bits are selected by solving the maximum reliability parameter minimum value through iteration. In view of the problem that the existing polar code rate matching method has high complexity, an interleaving algorithm based on rate matching parameter mapping and a pruning serial cancellation list decoding algorithm are proposed, which avoids the secondary sorting calculation of the interleaver and simplifies the updating strategy of the calculation unit of the decoder. The proposed polar code rate matching method can not only improve the rate matching coding gain, but also effectively reduce the calculation complexity.

This invention proposes a fast continuous cancellation list decoding method for polar codes based on dynamic flipping of special nodes, comprising: S1: decoding the received polar code sequence using a fast continuous cancellation list decoding algorithm, and determining whether the decoding result of the received polar code sequence can pass CRC check; S2: calculating the flip metric value of the first-order flip element in the decoding tree of the fast continuous cancellation list decoding according to the type of the special node, and constructing finite sets of flip elements and flip metrics respectively; S3: flipping the flip element with the largest metric value in the finite set, re-decoding using the fast continuous cancellation list decoding algorithm, and determining whether the current decoding result can pass CRC check; S4: connecting the current flip element with other flip elements in the finite set except the current flip element, constructing higher-order flip elements, and calculating the metric values ​​of all higher-order flip elements according to the type of the special node, inserting them into the finite set according to the size of the metric values, and constructing a new set of flip elements and flip metrics; S5: repeating the process of S3-S4 until the result of a decoding attempt can pass CRC check, or the number of decoding attempts exceeds the limit.

Methods, systems, and devices for wireless communications are described. A wireless device may receive a signal including a polar encoded control message. A message payload of the polar encoded control message may be associated with known bits information that may indicate one or more bit positions of one or more known bits and a respective bit value for each of the one or more known bits. The wireless device may perform successive cancellation list polar decoding on the signal to obtain the message payload of the polar encoded control message by generating list decoding bit sequences. A path metric of a list decoding bit sequence may be based on application of a bias penalty value to one or more bit decisions in the list decoding bit sequence that differ from a known bit value at a bit position in accordance with the known bits information.

To provide an encoder that provides inter prediction in exponential partitioning and a decoder capable of decoding a coded bitstream, as well as a non-transitory computer readable medium.SOLUTION: A decoder includes receiving a bitstream, partitioning a current block into a first region and a second region via an exponential partitioning mode, and determining a motion vector associated with the first region or the second region. The determining includes building a candidate list. The decoder also decodes the current block using the determined motion vector.SELECTED DRAWING: Figure 14

Provided in the embodiments of the present application are an encoding method and apparatus, a decoding method and apparatus, a bitstream, a decoder, an encoder, and a storage medium. The decoding method comprises: determining a first candidate list for the current block, wherein the first candidate list comprises at least one first motion information candidate (1701); determining at least one second motion information candidate on the basis of the first motion information candidate, wherein an MV in the second motion information candidate is different from an MV in the first motion information candidate (1702); determining a second candidate list on the basis of the at least one second motion information candidate and the first candidate list (1703); decoding a bitstream to determine a candidate motion information index for the current block (1704); determining an inter-frame prediction value of the current block on the basis of the candidate motion information index of the current block and the second candidate list (1705); and determining a reconstruction value for the current block on the basis of the inter-frame prediction value of the current block (1706).