113 results about "Convolutional code" patented technology

The invention discloses a system convolutional code parameter blind identification method and device and a storage medium, and belongs to the technical field of digital communication. The method comprises the following steps: S1, acquiring binary code stream data and constraint length of a system convolutional code; s2, constructing a coefficient matrix according to the initial constraint length and the initial code length, performing Walsh transformation and counting the number of peak values; s3, traversing the code length and the constraint length of the convolutional code of the system; s4, obtaining a correct code length and a correct constraint length from the binary code stream data; s5, selecting an initial position according to the correct code length and the correct constraint length; s6, traversing the initial position, and performing Gaussian transformation on the system matrix; and S7, according to the matrix after Gaussian transformation of the system convolutional code, obtaining a correct initial position and a check matrix so as to obtain parameter information of the system convolutional code. The method has the advantages of being high in recognition speed, small in required data size, high in fault tolerance, capable of meeting the recognition requirement of a high code rate and the like.

The invention belongs to the related technical field of image processing, and discloses a texture surface defect generation method and system based on a mask perception image redrawing network, and the method comprises the steps: (1) obtaining a low-frequency structure feature based on a defect sample image of a to-be-processed product category, a binary mask for marking a defect position, and a convolutional coding module; (2) a context sliding window attention modeling module carries out long-range dependence modeling on the feature sequence, and attention calculation is carried out between effective feature marks to obtain high-frequency detail features; (3) inputting the low-frequency structural features and the high-frequency detail features into a collaborative feature fusion module for fusion to obtain fusion features; (4) a style modulation decoding module performs up-sampling on the fusion features based on the comprehensive style tensor; and (5) generating a defect image based on the trained generator network model, the defect-free sample image of the to-be-processed product category and a user-defined defect mask. According to the invention, the authenticity of defect generation is improved.

The invention provides a dual-binary Turbo decoding method based on deep learning, and belongs to the technical field of wireless communication. Comprising the following steps: generating a binary random bit stream as original information, and generating a Turbo code sequence through two recursive system convolutional code component encoders; pre-processing the Turbo code sequence, and inputting the pre-processed Turbo code sequence into a bidirectional PNN model for processing to obtain an output feature vector; based on the output feature vector, standardization is carried out through a batch normalization layer, and a decoding result probability value is output by using a full connection layer and a Sigmoid activation function; and on the basis of the decoding result probability value, a Max-Log-MAP algorithm is cascaded with a component decoder of the bidirectional RNN to obtain a decoding result.

The present application provides a method and communication device for rate matching of a convolutional code, wherein a puncture pattern of a second codeword at a second code rate is obtained based on a puncture pattern of a first codeword at a first code rate, wherein a second puncture position set of the second codeword is a subset of the first puncture position set of the first codeword. When a transmitting end device reduces the code rate from the first code rate to the second code rate, redundant bits are transmitted at positions in the second puncture position set that are the complement of the first puncture position set. Compared to the first puncture position set, the second puncture position set can obtain more incremental redundant bits, thereby reducing the channel coding rate and improving the decoding performance of the convolutional code.

The invention provides a cascade coding and decoding method based on RS-convolutional codes in an FSO system. Belongs to the technical field of atmospheric laser communication. The method comprises the following steps of: firstly, inputting a source data sequence into a sparse code encoder for blocking and RS (Reed-Solomon) coding to generate an RS code word containing error correction redundancy; and then, the RS code words are rearranged by using an interleaving technology, so that the occurrence of continuous errors is reduced. And then, after the interleaved RS code words are subjected to parallel-serial conversion, the RS code words are input into a dynamically-adjusted convolutional encoder, encoding parameters are dynamically adjusted according to the current communication environment, and a redundancy-enhanced encoding sequence is generated. After signals are sent and received, the interleaved RS code words are recovered through iterative decoding, and finally, the RS decoder corrects symbol errors and recovers source data by using dynamically adjusted decoding parameters. In the whole process, data transmission in the FSO system is realized through an RS-convolutional code cascade coding and decoding method, and the reliability and accuracy of data transmission are improved.

The invention discloses a method and a device used in a wireless communication terminal and an Internet of Things device. The method comprises the following steps: a terminal sends a first PRDCH, and the first PRDCH adopts an OOK; a terminal receives a first PDRCH, channel coding of the first PDRCH adopts a convolutional code, the limit length of the convolutional code adopted by the channel coding of the first PDRCH is equal to a first limit length, and the mother code rate of the convolutional code adopted by the channel coding of the first PDRCH is equal to a first code rate; at least one of the first limit length and the first code rate belongs to a first coding scheme, the first coding scheme belongs to a candidate coding scheme set, and the candidate coding scheme set comprises at least one coding scheme; the candidate coding scheme set depends on a device type of a sender of the first PDRCH; when the set of candidate coding schemes includes a plurality of coding schemes, the first PRDCH indicates the first coding scheme from the set of candidate coding schemes. The transmission quality is improved.

The invention discloses a storage and calculation integrated architecture-based convolutional code parallel pipeline decoding acceleration system and method, and the system comprises a global data scheduling module which is used for slicing convolutional code data from magnetic tape storage equipment according to a set rule and carrying out the scheduling through a multi-stage cache mechanism; the storage and calculation integrated unit array is used for storing data tiles and intermediate results output by the global data scheduling module and executing convolution operation, path metric calculation and survival path selection through a reconfigurable calculation unit; the parallel pipeline controller is used for dynamically distributing decoding tasks and controlling the pipeline rhythm of the storage and calculation integrated unit array; the self-adaptive resource configuration module is used for monitoring system load in real time and dynamically adjusting a data distribution strategy and computing resource scheduling; the verification and error correction unit is used for performing verification and error correction on the decoding result output by the storage and calculation integrated unit array and then outputting the decoding result; according to the decoding acceleration system and method, high-efficiency and low-delay convolutional code decoding is realized.

The invention discloses an electric power local communication method based on Viterbi soft information demodulation, which comprises the following steps of: firstly, carrying out convolutional coding on information bits by a transmitting end, and modulating the information bits to an electric power authorization 230MHz frequency band by adopting a CPFSK (Continuous Phase Frequency Shift Keying) mode; then up-converting the information bits, sending the information bits to a receiving end through an electric power authorization frequency band, and down-converting the information bits by the receiving end; then, a receiving end extracts soft information in the CPFSK signal by adopting a soft information calculation method based on a Viterbi demodulation algorithm; and finally, a decoder performs soft decoding based on soft information by adopting a convolutional code decoding technology and utilizing a log-likelihood ratio. According to the invention, the reliability and communication rate of the local communication system are improved.

The present application discloses a method and apparatus for use in a terminal and an Internet of Things device for wireless communication. The method comprises: a terminal sends a first PRDCH, OOK being used for the first PRDCH; and the terminal receives a first PDRCH, a convolutional code being used for channel coding of the first PDRCH, a constraint length of the convolutional code used for channel coding of the first PDRCH being equal to a first constraint length, and a code rate of a mother code of the convolutional code used for channel coding of the first PDRCH being equal to a first code rate. At least one of the first constraint length and the first code rate belongs to a first coding scheme, the first coding scheme belongs to a set of candidate coding schemes, and the set of candidate coding schemes comprises at least one coding scheme. The set of candidate coding schemes depends on a device type of a sender of the first PDRCH. When the set of candidate coding schemes comprises a plurality of coding schemes, the first PRDCH indicates the first coding scheme in the set of candidate coding schemes. The present application improves transmission quality.

A receiver (115) receives pulse trains (r0, r1) encoding a plurality of bits (b) using a convolutional code {3, 2, 5} whose systematic bit g0 and parity bit g1 are mapped into two binary trains (21, 22) depending respectively on g0^g1 and g1. Noting that the convolutional coding and the mapping lead to modulation (bz-1^b^b.z+1, bz-1^b.z+1, bz-1^b.z+1), a demodulator demodulates the pairs of received pulse trains (r0, r1) into respective pairs of LLR values ​​(b0, b1) and a Viterbi decoder built on a convolutional code {3, 7, 5} decodes each pair of LLR values ​​into a decoded bit (d). Optimal decoding is thus achieved, notably offering a gain estimated at 1.8 dB (in error rate) without additional complexity. See Figure 3 for the abbreviated version.

The application relates to the field of digital communication and digital storage, and particularly relates to a rate-compatible tail-biting convolutional code encoding method and device based on selective multiplicative repetition. The method comprises the following steps: obtaining an information sequence to be encoded; performing CRC encoding on the information sequence by using a cyclic redundancy polynomial to obtain a redundancy sequence, wherein the redundancy sequence comprises the information sequence and a CRC redundancy information sequence; periodically inserting the CRC redundancy information sequence into the information sequence in a symbol unit formed by a preset number of bits to obtain a new redundancy sequence; performing tail-biting convolutional encoding according to the new redundancy sequence to obtain an encoded sequence; and performing selective multiplicative repetition encoding according to a preset target code rate, the encoded sequence and a randomly determined multiplicative coefficient to obtain a selective repetition encoded sequence. The encoding method provided by the application has a lower block error rate under various code rates.

The invention belongs to the technical field of space communication and satellite communication, and particularly relates to a maximum posterior probability decoding method and system for a high-bit-rate convolutional code. The method comprises the following steps: converting received high-bit-rate convolutional code word soft information into log-likelihood ratio information; updating of forward information is carried out on the Trellis graph; the backward information is updated on the Trellis graph; according to the updated forward information and backward information, calculating side information of all the Trellis branches; obtaining log-likelihood posterior probability information of each input bit according to the side information of each branch; and obtaining final decoding output by judging logarithm likelihood posterior probability information of each input bit. By adopting the method provided by the invention, the bit error rate of the CCSDS high-bit-rate convolutional code can be reduced.

Methods, systems, and devices for wireless communications are described. An energy harvesting device may receive a carrier wave from a reader device, encode a message using a 1 / 4 rate convolutional encoder, and transmit the message to the reader device by either backscattering the carrier wave or by using energy harvested from the carrier wave. The 1 / 4 rate convolutional encoder may be associated with a constraint length and a set of four polynomials, including any permutation of a first polynomial, a second polynomial, a third polynomial, and a fourth polynomial. Various combinations of constraint length and sets of four polynomials associated with a valid trellis for the 1 / 4 rate convolutional encoder are described. An initial state of the convolutional encoder may be the same as an ending state of the convolutional encoder. An input vector of the convolutional encoder may be padded with a quantity of bits.

The present disclosure relates to a 5G or 6G communication system for supporting a higher data transmission rate than a 4G communication system such as LTE. An encoding method performed by a transmission device of a communication system according to an embodiment of the present disclosure may comprise the steps of: identifying at least one parameter related to a convolutional code associated with a polarization-adjusted convolutional (PAC) code; on the basis of the at least one parameter, identifying a parity check matrix for an input binary vector of a polar code associated with the PAC code; on the basis of the parity check matrix, encoding a polar code concatenated with an outer code; and transmitting a codeword vector generated on the basis of the encoding.

The invention discloses a convolutional code pattern classification and identification method based on a self-attention mechanism LSTM, and the method comprises the steps: randomly generating a sequence, carrying out the convolutional coding of the sequence, carrying out the modulation, carrying out the channel noise, carrying out the demodulation, generating a coding sequence with an error code, extracting features through a convolutional layer, and carrying out the recognition of a convolutional code pattern. According to the convolutional code recognition method, the defects that the types which can be recognized by the convolutional codes are few and the requirement of a traditional algorithm for the signal to noise ratio of the signals is high are effectively overcome, and the accuracy and universality of convolutional code recognition are improved.

The application discloses a convolution code parallel pipeline decoding acceleration system and method based on a memory-compute integrated architecture, comprising: a global data scheduling module, which is used for slicing convolution code data from a magnetic tape storage device according to a set rule and scheduling the data through a multi-level cache mechanism; a memory-compute integrated unit array, which is used for storing data tiles and intermediate results output from the global data scheduling module and performing convolution operation, path metric calculation and surviving path selection through a reconfigurable computing unit; a parallel pipeline controller, which is used for dynamically allocating decoding tasks and controlling the pipeline beat of the memory-compute integrated unit array; an adaptive resource configuration module, which is used for monitoring the system load in real time and dynamically adjusting data distribution strategies and computing resource scheduling; and a check and error correction unit, which is used for checking and correcting the decoding results output from the memory-compute integrated unit array and then outputting the results; the decoding acceleration system and method realize efficient and low-delay convolution code decoding.

Communication systems that utilize receivers for decoding short block length messages are disclosed. In many embodiments, the receiver includes an antenna for receiving encoded data, via RF signals, a demodulator for obtaining symbols from the RF signal, a demapper for generating symbol metrics, and a parallel list decoder. In several embodiments, the parallel list decoder processes multiple trellis stages simultaneously, enabling efficient decoding of the symbol metrics to obtain received, bits. In certain embodiments, the parallel list decoder divides the decoding trellis into segments, processes these segments independently, and combines them pairwise to form new segments. This parallel processing approach can allow for reduced decoding latency and improved efficiency in handling short block length messages. making it particularly suitable for applications requiring rapid data exchange and low-latency communication.

The present invention belongs to the technical field of space communication and satellite communication, and particularly relates to a maximum a posteriori probability decoding method and system for high code rate convolutional codes. The method includes: converting the soft information of the received high code rate convolutional codeword into log-likelihood ratio information; updating the forward information on the Trellis diagram; updating the backward information on the Trellis diagram; calculating the edge information of all Trellis branches according to the updated forward information and backward information; obtaining the log-likelihood a posteriori probability information of each input bit according to the edge information of each branch; and obtaining the final decoding output through the decision of the log-likelihood a posteriori probability information of each input bit. By adopting the method of the present invention, the bit error rate of the CCSDS high code rate convolutional code can be reduced.

The application discloses a quantum secure communication negotiation method and device, equipment, medium and program product, and relates to the technical field of communication. The method comprises the following steps: receiving a target sequence transmitted by a second communication end based on an original sequence through a quantum channel; converting the target sequence into a first Gaussian sequence with uniform distribution; encoding the first Gaussian sequence by using a parallel concatenated recursive systematic convolution code to obtain a check sequence, and sending the check sequence to the second communication end, so that the second communication end determines key information corresponding to the original sequence by decoding the check sequence and a second Gaussian sequence corresponding to the original sequence through the parallel concatenated recursive systematic convolution code; and determining the key information by decoding the first Gaussian sequence and the check sequence through the parallel concatenated recursive systematic convolution code. According to the application, the quantum secure communication negotiation and key error correction can be more safely and efficiently realized, so that the overall quantum secure communication negotiation efficiency and error correction accuracy can be effectively improved.

Communication systems and methods are disclosed that utilize Probability Amplitude Shaping (PAS) and Trellis Coded Modulation (TCM) to transmit short block-length messages. While capacity-approaching codes, such as Low Density Parity Check (LDPC) codes, Turbo codes, and Polar codes, can achieve data rates approaching the Shannon limit at large block-lengths, the performance of these codes can deteriorate dramatically at short block-lengths. Communication systems configured in accordance with various embodiments of the invention can utilize classical codes to encode short block-length messages to achieve communication rates exceeding Polyanskiy's Random Coding Union bound. In several embodiments, message bits are transmitted using a TCM system in which message bits that have been previously encoded by an error detection code are encoded using a convolutional code (CC). In a number of embodiments, the error detection code and the CC are obtained via a joint optimization with respect to a Frame Error Rate bound.

The invention discloses a parallel stepped convolutional code space coupling coding and decoding (PSCBCC) method and device, belongs to the technical field of channel coding, and is suitable for a large-bandwidth communication scene. According to the method, a frame of data is divided into multiple groups of sub-data, parallel convolutional coding of three paths of input of current sub-data, interleaved previous sub-data and an interleaved previous check sequence is realized by utilizing a parallel coding unit, a current check sequence is generated, and the sub-data and the check sequence are respectively reserved to different subsequent moments to form asymmetric coupling; and during decoding, a parallel decoding unit is matched with a coding structure, and a plurality of groups of log-likelihood ratios are input to realize iterative updating. The throughput rate is improved through parallel processing, the bit error rate performance is enhanced through asymmetric coupling, multi-code-rate adaptation is supported, and the performance is superior to that of existing BCC and 4G / 5G standard codes.

The present application discloses a multi-rate convolutional code sequence decoder and decoding method, which relates to the field of communication decoding technology. The decoder includes: a data storage module, a branch metric module, a parallel processing module, a shift register, a convolutional coding module, and a main control module; receiving and storing a coding rate identification bit and data to be decoded in input data; selecting a non-systematic code generator according to the coding rate identification bit, performing convolution processing on the non-systematic code generator according to a preset number of shift data and the non-systematic code generator to obtain a convolutional code; obtaining the data to be decoded according to the non-systematic code generator, calculating a branch metric value according to the coding rate identification bit, the data to be decoded, and the convolutional code; determining a decoding result of the data to be decoded according to the branch metric value and the total metric value, and updating the total metric value; updating the shift data in the shift register according to the updated total metric value; and storing the shift data. The present invention can efficiently process input data and improve the overall data processing speed and efficiency.

Methods and devices are provided in which a channel encoded with a polarization-adjusted convolutional (PAC) code is received. A decoded codeword is generated based at least in part on simplified successive cancellation list (SSCL) decoding performed on the channel via a decoding tree. The decoding tree includes a node that generates candidate codeword output based on predefined processing using convolutional code (CC) state input and channel vector input. A sub-tree of the node remains unprocessed.

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 invention discloses an unsupervised engineering structure damage identification method, apparatus and device, and a medium. The method comprises the steps of obtaining a structure vibration signal of a to-be-identified engineering structure; reconstructing the structural vibration signal through the damage identification model to obtain a reconstructed vibration signal; and on the basis of a reconstruction error between the vibration signal and the reconstructed vibration signal, identifying the structure state of the to-be-identified engineering structure. According to the method, the local feature extraction capability of the convolutional coding module and the overall evolution rule of the signal captured by the Transform coding module along the time dimension are fused, and the features are compulsively compressed and reconstructed by using the bottleneck layer, so that the damage identification model learns the essential feature representation of the structural vibration signal, the reconstruction accuracy of the healthy vibration signal is improved, and the reconstruction accuracy of the healthy vibration signal is improved. Therefore, the accuracy of the structure state identified on the basis of the reconstruction error between the vibration signal and the reconstructed vibration signal can be improved.

The invention belongs to the technical field of communication signal processing and code identification, and solves the problem of channel code identification when a non-cooperative communication system lacks coding parameter prior information and training data with labels. According to the technical scheme, the method is characterized in that a unified recognition framework is constructed based on five features, namely, a rank fluctuation feature is used for distinguishing convolutional codes and linear block codes, a continuous zero spectrum feature is used for recognizing BCH codes, a multi-dimensional structure feature is used for detecting Turbo product codes, a bit distribution deviation feature is used for recognizing polarization codes, and an average absolute column correlation feature is used for distinguishing LDPC codes and non-LDPC codes; blind recognition of five types of channel codes including BCH codes, LDPC codes, convolutional codes, Turbo product codes and polarization codes is achieved. The method does not depend on coding parameter prior information, does not need training, is high in recognition rate under a low signal-to-noise ratio, is high in generalization capability, and is suitable for real-time and resource-limited scenes.

An apparatus configured to apply a convolutional precoder with a time-varying polynomial to an information vector to generate a precoded vector, wherein coefficients of the time-varying polynomial are generated by a pseudo-random number generator (PRNG) using a radio network temporary identifier (RNTI) as an initialization seed, generate a polarization-adjusted convolution (PAC) codeword based on the precoded vector and transmit the PAC codeword.

The invention relates to the technical field of channel coding and decoding. The invention discloses a pre-transformation method and device of a polarization adjustment convolutional code, a terminal and a storage medium, which can reduce the computation complexity of optimizing a convolution multiform and reduce the optimization difficulty of code redistribution of a PAC code. The pre-transformation method of the polarization adjustment convolutional code comprises the following steps: setting a first convolution formula and a plurality of to-be-processed formulas; a tree structure modeling mode is adopted to carry out convolution multi-mode modeling processing on the first convolution formula and the multiple to-be-processed formulas to obtain a target convolution polynomial of the polarization adjustment convolution code, the tree structure modeling mode sets a coefficient in a target to-be-processed formula as 0 or 1, and when the coefficient of the target to-be-processed formula is 0, the polarization adjustment convolution code is obtained. The to-be-processed formula corresponding to the target to-be-processed formula is not used for constructing the target convolutional polynomial, and the target to-be-processed formula is any to-be-processed formula in the multiple to-be-processed formulas.

The present application provides a communication method based on modified polarization-adjusted convolutional (MPAC) codes. According to the method, on the basis of the performance criterion of AUB, from among multiple candidate information length Kc and code length Nc pairs, one information length and code length pair can be determined as parameters of a partial convolutional code for MPAC, wherein the information length and the code length are two values in a first parameter group, so that MPAC coding can be carried out on an information bit sequence to be coded to obtain a first MPAC codeword sequence. Compared with a Polar code and a PAC code, the obtained MPAC code has better performance and lower complexity. Moreover, the first information length and the first code length in the determined first parameter group are sent out, so that the obtained first MPAC codeword sequence is subsequently subjected to MPAC decoding on the basis of the first parameter group, thereby perfecting the MPAC coding and decoding structure.

The application discloses a convolutional decoder, a decoding method and an electronic device, relates to the technical field of communication, and is used for reducing time overhead of convolutional code decoding. The application is used for decoding an encoded sequence, the encoded sequence is divided into P first sub-sequences, tail sequences of the P first sub-sequences are P second sub-sequences, and the convolutional decoder comprises the following steps: for first round decoding, P Viterbi decoders decode the P second sub-sequences respectively, and update cumulative score vectors of the P second sub-sequences; from second round decoding, a pth Viterbi decoder starts to perform cyclic decoding on the encoded sequence from a starting position of a pth first sub-sequence, and update cumulative score vectors of the P first sub-sequences; P comparators compare the cumulative score vectors of two sub-sequences with the same ending position in the last two rounds of decoding, and if the maximum probability state transition paths of the two sub-sequences with the same ending position are the same, the decoding sequence of the maximum probability state transition path is output.