39 results about "List decoding" patented technology

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 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.

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.

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.

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.

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 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 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.

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).

The invention discloses a PAC code decoding method and device based on parity check assistance, equipment, a medium and a product, and relates to the technical field of PAC code decoding, and the method comprises the steps: determining the position of a parity check pair according to a preset construction mode; when the to-be-coded data is coded, a parity check relation is introduced to the position based on parity check to obtain a PAC code word; the method comprises the following steps: introducing parity check in a process of performing list decoding on PAC code words, if the parity check does not pass, terminating current decoding and entering a next decoding attempt, after each decoding attempt is finished, judging whether all parity check passes, if so, outputting a decoding result, and if not, expanding the size of a list to perform a new decoding attempt, according to the invention, the error correction performance can be ensured while the decoding complexity is reduced.

The present application provides a cascaded random access decoding method and related devices based on outer code assistance. The method includes: obtaining a plurality of serially concatenated coded aliased codewords, each codeword aliasing the user data sent by all access users accessing within a time slot; performing list decoding on the aliased codewords to obtain a plurality of candidate outer codes; performing outer code decoding on the outer codes to obtain the outer code decoding information of the candidate decoded codewords; for each candidate decoded codeword, determining the number of users implied by the candidate decoded codeword according to the corresponding outer code decoding information; when the number of users is less than or equal to the discrimination threshold, using the candidate decoded codeword as the surviving decoded codeword of the list decoding, and performing outer code decoding separation to obtain all user data accessing within the time slot, and collecting the decoding results of all time slots can complete the access of all user data within the access frame. This method can effectively improve the performance of the massive access random access coding scheme with a cascaded structure in a wireless communication system.

The invention belongs to but is not limited to the technical field of communication coding, and particularly relates to a coding and decoding method and system for decoding a detection code combined twisted RS (Reed-Solomon) code list, comprising a coding method for embedding an algebraic operation detection mechanism (AMD code) into a twisted Reed-Solomon code structure, and a decoding system which is constructed based on the coding method and can support list decoding. According to the method, a twisted RS code with a disturbance item is constructed to enhance the structural security, a key-free AMD detection mechanism is fused, candidate results are subjected to tampering identification and screening in a list decoding stage, and a fused communication coding and decoding technology with high reliability, high security and high decoding efficiency is realized. The system can be widely applied to the fields of data storage, distributed communication, block chain base layer protocols, anti-pollution network coding and the like with high security requirements.

Certain aspects of the present disclosure provide techniques for aspects of the present disclosure, aspects of the present disclosure relate to wireless communications, and more particularly to techniques for determining a minimum list size to be used in a list decoding operation for reducing resource consumption (e.g., computations, memory, and power) at a decoder. A method includes receiving a codeword including a plurality of channel bits encoded with an error correction code, the plurality of channel bits including 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 minimum list size for the list decoding operation based at least on the payload size and the channel capacity metric; and performing a list decoding operation on the codeword based on the minimum list size to obtain a plurality of information bits.

Devices, systems and methods for list decoding of polarization-adjusted convolutional (PAC) codes are described. One example method for improving error correction in a decoder for data in a communication channel includes receiving a noisy codeword, the codeword having been generated using a polarization-adjusted convolutional (PAC) code and provided to the communication channel prior to reception by the decoder, and performing PAC list decoding on the noisy codeword, wherein an encoding operation of the PAC code comprises a convolutional precoding operation that generates one or more dynamically frozen bits, and wherein the PAC list decoding comprises extending, based on the one or more dynamically frozen bits, at least two paths of a plurality of paths in the PAC list decoding differently and independently.

The present application proposes a general multi-bit parallel list decoding method for polar codes, comprising: obtaining a polar code to be decoded and dividing it into M bit groups; sequentially placing the M bit groups into a decoder for decoding to obtain a decoding result, including: performing parallel metric calculation on the currently placed M bit group to obtain 2 M L path metrics; construct a master-slave sorting network for the decoder; exchange the path metric values ​​selected from the master-slave sorting network to obtain L path metric values; use the M-bit values ​​corresponding to the obtained L paths as the decoding decision for that path, and then as the decoding result for the current M-bit group; obtain the decoding results for all M-bit groups, and then use the smallest path among the L smallest paths in the decoding results of all M-bit groups as the final decoding path, and the sequence of all M-bit values ​​corresponding to this path as the decoding result of the polar code. The present invention, which adopts the above scheme, solves the technical problems of complexity and performance in list sorting for polar code decoding.

The present application discloses an improved PAC code fast list decoding method and related devices, relating to the field of communication technology. The method comprises: acquiring data; initializing decoding parameters; and determining the type of the current node; when the node is a low-rate node, performing a path extension operation according to a fixed node threshold; and performing path deletion using the fixed path threshold; when the node is a high-rate node, sorting the updated log-likelihood ratio values ​​of the codewords to be decoded and updating the dynamic node threshold parameters to perform a path extension operation; performing path deletion using the dynamic path threshold and the fixed path threshold; updating the dynamic path threshold and hard decision data; and sorting all updated path metric values ​​from small to large, and using the decoded codeword of the path with the smallest path metric value as the final decoding result. The present application can improve the decoding speed of the PAC code list decoding algorithm while ensuring the high error correction performance of the PAC code.

The present disclosure provides a system and method for polar decoding in a communication system. A polar decoder includes a core block including a successive cancellation decoder and a list decoder, and a cyclic redundancy check (CRC) module, wherein the core block stores one or more pre-calculated reliability sequence for decoding the received encoded data bits.

A system and method for processing errors in a self-managed DRAM module. A method includes receiving a block of code symbols comprising s code segments; loading the code symbols into a bank of list-decoding modules, wherein each module is configured to correct errors in a specific combination of code-segments from the block; for each list-decoder module, erase code symbols and calculate replacement code symbols to form a valid codeword; for each valid codeword, determine a codeword metric based on a number of corrections between the replacement code symbols and the erased received symbols; identify a first and a second valid codeword from the set of unique codewords generated by a bank of list-decoder modules having a minimum codeword metric and a second minimum codeword metric, respectively; and correct the first valid codeword if, based on the minimum and second minimum codeword metric, no decoding error is detected.

The present application relates to the technical field of intelligent irrigation, in particular to a garden greening intelligent irrigation method and system based on the Internet of Things. The method comprises: acquiring soil humidity, environmental temperature and node power at the irrigation node side and mapping to an information bit channel, receiving channel reliability distribution parameters and setting a code rate, setting a bit value of a frozen bit channel, in a serial cancellation list decoding process of a polar code at the control terminal side, when a soil humidity change rate exceeds a range set based on a physical environment model, applying a nonlinear attenuation penalty to an intermediate path, generating an irrigation strategy, calculating a decoding confidence, generating channel reliability distribution parameters for adjusting a code rate of a next transmission period and returning to the irrigation node. That is, the scheme of the present application can eliminate incorrect decoding results caused by strong interference, improve the reliability of data decoding in a poor channel, reduce resource waste and balance energy efficiency and reliability.

The invention provides a polar code serial cancellation list flipping decoding method and device, and the method comprises the steps: obtaining a flipping set corresponding to a code tree, and the flipping set comprises at least one target layer; for each target layer, determining an overturning skipping result corresponding to the current target layer according to an overturning skipping rule; if the overturning skipping result is skipping, updating the current target layer into a next target layer of the current target layer in the overturning set, and executing the overturning skipping result corresponding to the current target layer determined according to the overturning skipping rule and the following steps; and if the flipping skipping result is no skipping, performing path flipping on the current target layer on the code tree and performing serial offset list decoding. According to the method, the target layer is evaluated through the path flipping skipping rule, and whether one flipping attempt is necessary is dynamically determined, so that the decoding attempt times and complexity of SCLF are reduced, and the time delay efficiency of the polarization code in a wireless communication system is improved.

To provide a simple and efficient encoding / decoding method and apparatus that reduce a complexity of an intra prediction.SOLUTION: A decoder specifies an intra prediction mode parameter of a current block by decoding a bitstream. When the intra prediction mode parameter indicates that an intra prediction value of the current block is to be specified using an intra weighted combined prediction (IWCP) mode, the intra prediction mode parameter specifies a first mode index and a second mode index of the current block. A MPM list of the current block is constructed. The first intra prediction mode and the second intra prediction mode of the current block are identified based on the first mode index, the second mode index, and a most probable mode (MPM) list. A weighting matrix of the current block is determined, and a prediction value of the current block is determined based on the first intra prediction mode, the second intra prediction mode, and the weighting matrix.SELECTED DRAWING: Figure 6

A least reliable bit (LRB) identification approach based on a cumulative distribution function (CDF) is disclosed. In some embodiments, a receiver includes a detector and a decoder. The detector is configured to receive a codeword and determine a list of reliability values for the bits included in the codeword. The decoder is configured to receive, from the detector, the codeword and the list of reliability values, compute a list of CDFs of the reliability values for the codeword, identify, from the CDF list, a group including a specific number of LRBs that have the reliability values within a threshold range, and determine a location of each LRB of the group in the codeword.

Systems and machine readable media for enhanced decoding of a demultiplexed data stream received from a plurality of transmitters. When it is determined at a decoder selection unit (210) that the number of unknown bits (e.g., differential transmission bits, i.e., 1 from one transmitter and 0 from another transmitter) is below a threshold, the receiver decodes (220) with erasure, where the threshold may be Hamming distance minus one, i.e., D-1, of error and erasure error correction codes (e.g., Reed-Solomon codes); otherwise, list decoding is employed if the number of differential transmission bits is above a threshold (230). Selection logic (240) may be employed if list decoding fails to produce a single result but produces multiple possible results. The selection logic may utilize error and erase decoding of the possible results, or utilize media decoding of the possible results.