30 results about "Coding gain" patented technology

The application relates to the technical field of decoding, and provides a source channel joint decoding method and device, electronic equipment and a storage medium, the method comprising the following steps: acquiring initialization information of a channel encoder and prior probability information of a variable node of a source decoder; determining check node information of the source decoder based on the initialization information and the prior probability information; and performing the following iterative steps, which comprise the following steps: updating soft information of the variable node of the source decoder based on the check node information and the initialization information; and performing decoding decision based on the updated soft information to determine a decoding result. The method determines the check node information of the source decoder based on the initialization information and the prior probability information, iteratively updates the soft information of the variable node of the source decoder based on the check node information and the initialization information, that is, uses the information of the source as the soft information available in the decoding process, improves the coding gain, and thus improves the accuracy of the source channel joint decoding.

This application belongs to the field of channel coding technology. This application provides a WSC-assisted encoding and decoding method for PC-Polar codes. The embodiments disclosed herein can be used in any communication system employing PC-Polar codes with minimal impact on the overall design of the communication system. By assisting in the verification of multiple candidate paths, the correct path can be identified more accurately, resulting in additional coding gain compared to PC-Polar codes in simulations. The PC-Polar code is endowed with link-layer frame error detection and indication functions, allowing the system to definitively determine whether the decoding result is correct, thus enhancing the reliability of the communication system. The introduced WSC coding has low code rate loss overhead, low computational complexity, and is easy to implement in hardware, achieving a good balance between performance gain and overhead.

The embodiment of the invention relates to an uplink data sending method, equipment, a device and a medium, uplink authorization information carries information of a plurality of different RVs and uplink control information, so that terminal equipment generates data streams of a plurality of PUSCHs corresponding to the plurality of different RVs based on the information of the plurality of different RVs and the uplink control information, and sends the data streams of the plurality of PUSCHs corresponding to the plurality of different RVs to the terminal equipment. And the data streams of the plurality of PUSCHs are simultaneously sent to one or more target network devices through the plurality of transmitting panels, so that the transmission delay of blind retransmission can be reduced, the transmission efficiency can be improved, and the coding gain can be obtained.

Interaction of transform size and coding tools. The invention provides a method and apparatus for implementing a discrete triangular transform based on a maximum transform size. In one embodiment, matrix-based intra prediction is enabled for coding unit sizes up to a certain size, regardless of the maximum transform size. In another embodiment, a low frequency non-separable transform is used to improve coding gain. Syntax in the bitstream can be used to indicate the coding tools used.

This invention provides a method and apparatus for implementing discrete trigonometric transformations based on the maximum transform size. In one embodiment, matrix-based intra-frame prediction is enabled for coding unit sizes up to a specific size, regardless of the maximum transform size. In another embodiment, low-frequency inseparable transforms are used to improve coding gain. The syntax in the bitstream can be used to indicate the coding tools used.

This invention discloses a precoding gain estimation method, device, storage medium, computer product, and system. It includes: an EDU determining a compressed channel matrix and a large-scale fading coefficient matrix; a UCDU determining an estimated value of the precoding gain based on the large-scale fading coefficient matrix; the UCDU processing and fusing the estimated values ​​of the compressed channel matrix and precoding gain using a residual-aware fusion neural network, outputting an estimated value of the residual between the precise value of the precoding gain and the estimated value of the precoding gain; and the UCDU determining the final precoding gain based on the estimated value of the precoding gain and the estimated value of the residual. This method uses a residual-aware fusion neural network that has learned the residual between the precise value of the precoding gain and the estimated value of the precoding gain to output an estimated value of the residual, thereby determining the final precoding gain, which can improve the computational efficiency of the precoding gain.

The invention relates to a short code length QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) code construction method based on a Stanley sequence and a genetic algorithm. According to the method, a Stanley sequence is used for forming first two rows of an index matrix meeting the condition that no four rings exist, then a genetic algorithm is used for searching a third row element which enables the index matrix to meet the requirements that the ring length is at least 8 and the number of trap sets is small, and therefore the index matrix with the girth length being at least 8 is obtained, the genetic algorithm can guarantee that the number of the trap sets is minimum, and the number of trap sets is small. And finally, the index matrix is expanded to obtain a parity check matrix of the index matrix, so that four rings and six rings do not exist in a Tanner graph of the check matrix, the number of trap sets is small, the storage space required by code words is small, and hardware implementation is easy. Simulation shows that compared with an HS-QC-LDPC code, an MT-QC-LDPC code and an SES-QC-LDPC code which have the same code rate and code length, the SS-QC-LDPC code constructed by the method has the advantages that the net coding gain is improved to a certain extent, and the constructed SS-QC-LDPC code has better waterfall region performance in a high signal-to-noise ratio region and has no obvious error leveling phenomenon.

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

This invention discloses a source-channel joint coding scheme for short packet communication. The scheme includes: at the transmitting end, firstly, performing two-stage classified enumerative (CE) coding on the message sequence u to be transmitted to obtain a variable-length description sequence (w). u i u ), where w u Indicates the type of the message, i u This indicates the order of message u within this type class; subsequently, the variable-length sequence (w) will be... u i u After multi-rate matching channel coding, a fixed-length transmit codeword c is obtained. During modulation, transmission energy is allocated according to the channel code rate, with low-rate transmit codewords receiving low transmission energy. At the receiving end, type-specific test decoding is used to recover the transmitted message. For a given type, the corresponding channel code decoding is performed first, followed by CE decoding, ultimately yielding an estimate of the message sequence. This invention has a significant coding gain compared to existing schemes, and its performance can approach the source-channel joint coding bound under finite length conditions.

The invention discloses an image high dynamic range reconstruction method and system based on a detail coding gain graph, and belongs to the technical field of computer vision and image processing. The method comprises the following steps: S1, data preprocessing: acquiring an input single standard dynamic range image, and preprocessing the image to obtain image data in a linear space or normalized floating point tensor format; s2, proposing a detail recovery network design based on detail generation of a diffusion model; s3, predicting a detail coding gain graph, and providing a gain convolutional neural network design; and S4, final HDR synthesis: carrying out pixel-by-pixel multiplication on the processed standard dynamic range (SDR) image and the three-channel (R, G, B) gain image according to channels to obtain a reconstructed HDR image. According to the method, the problems of detail recovery missing, image structure distortion, low calculation efficiency and the like in the existing single image HDR (High Dynamic Range) reconstruction technology are effectively solved.

The embodiment of the invention provides a motion vector prediction (MVP) candidate determination method, a storage medium and an electronic device, and the method comprises the steps: obtaining an MVP candidate list, and enabling the candidate MVP types in the MVP candidate list to comprise a space-domain motion vector candidate MVP, a time-domain motion vector candidate MVP, a historical motion vector prediction (HMVP) candidate MVP, and a motion vector angle prediction (MVAP) candidate MVP; and determining a basic candidate MVP according to the MVP candidate list. The problem that the coding gain is low due to the fact that the optimal basic candidate MVP cannot be selected in the prior art is solved, and the effects of efficiently selecting the optimal basic candidate MVP and improving the coding gain are achieved.

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

The invention discloses a data encoding method, a data decoding method, a data encoding device, data decoding equipment, and a storage medium, and belongs to the technical field of communication. The method comprises the steps of obtaining a first data segment; a plurality of basic code blocks are obtained, the basic code blocks are composed of a first code block set and a second code block set, and the minimum code block distance between any basic code block in the first code block set and other code blocks in the basic code blocks is larger than the minimum Euclidean distance of PAM, the minimum code block distance between any basic code block in the second code block set and other code blocks in the multiple basic code blocks is equal to the minimum Euclidean distance, and the number of the basic code blocks in the first code block set is larger than that of the basic code blocks in the second code block set; and encoding the first data segment according to the plurality of basic code blocks. As the code block distance between any basic code block in the first code block set and other code blocks is greater than the minimum Euclidean distance, the basic code blocks in the first code block set are used for coding, and additional coding gain can be generated.

The invention relates to the technical field of information security, and particularly provides a steganography method and device, equipment, a medium and a product. According to the steganography method and device, target signals of carrier audio are searched based on a plurality of fixed codebook vector combinations, steganography parameters to be determined are obtained, and the target signals are random noise excitation obtained through self-encoding gain and noise processing; based on the to-be-determined steganography parameter and a first mapping relation, determining a steganography bit stream, the first mapping relation being used for representing a mapping relation between a level state of the to-be-steganography target secret information and a steganography parameter range; the steganography bit stream is a signal carrying target secret information; determining steganographic audio based on the steganographic bit stream; and sending the steganography audio to a receiving device. The value of a steganography parameter is limited at a sending end, and the steganography parameter is used as an intermediate variable in a coding process, so that embedding of secret information is realized. Therefore, the security of audio steganography can be improved.

Provided in the present application are a communication method and communication apparatus based on a PC code, in which PC coding and CRC coding are mainly used to implement the precoding of information bit sequences transmitted in a broadcast channel, an uplink data channel and a downlink data channel, or information bit sequences carried in control information, followed by channel coding, so that the coding gain of channel coding can be improved, thereby facilitating an improvement in the communication quality. In addition, the method can improve the error correction performance when the number of payloads increases, and can also achieve a further improvement in the coding gain when a mother code length increases.

The invention provides an OFDM (Orthogonal Frequency Division Multiplexing) waveform design method suitable for covered wire transmission, which comprises the steps of CRC (Cyclic Redundancy Check) check, Turbo coding / rate matching, serial-to-parallel conversion, constellation mapping, OFDM modulation and framing, and utilizes a mode of combining an OFDM transmission technology with high spectrum utilization rate with 16QAM (Quadrature Amplitude Modulation) and 4QAM modulation technologies with high information transmission rate. Compared with a traditional single-carrier frequency domain equalization technology and a PAM constellation mapping mode of covered line transmission, the frequency spectrum utilization rate and the data transmission rate are improved; meanwhile, compared with the traditional grid coding, the Turbo coding further improves the coding gain; the insertion of the CP-UW pilot signals can reduce the difficulty of subsequent receiving end signal processing and improve the channel estimation precision, so that distortion and attenuation signals introduced by covered wire long-distance transmission can be recovered more accurately, large-bandwidth and long-distance communication in a covered wire communication environment is realized, and audio and video transmission services can be supported.

This invention belongs to the field of optical fiber testing and sensing technology, specifically relating to a method for identifying faults and disturbances in few-mode optical fibers using Raman-enhanced time-domain reflectometry (TDDR). The method includes: signal transmission based on pulse coding and mode-selective excitation; signal-to-noise ratio enhancement based on distributed Raman amplification; mode demultiplexing and mode field detection; coded demodulation and reconstruction using a multi-mode few-mode optical TDDR; multi-dimensional fault identification based on mode-dependent loss and coupling characteristics; and multi-mode differential and high-precision positioning based on digital signal processing. This invention targets high-capacity communication and distributed sensing systems using few-mode fibers. It solves the problem of detecting weak inter-mode scattering signals by coordinating pulse coding gain and distributed Raman optical gain. Subsequently, it utilizes the unique mode-dependent loss and inter-mode energy transfer characteristics of few-mode fibers for joint decision-making, providing highly sensitive, multi-dimensional optical fiber link health monitoring capabilities. This method has great potential and application prospects in the operation and maintenance of next-generation space-multiplexed optical networks.

The methods and devices for implementing discrete trigonometric transformations are based on the maximum transformation size. In one approach, matrix-based intraprediction is permitted for encoding unit sizes up to a specified size, regardless of the maximum transformation size. In another approach, low-frequency, non-separable transforms are used to improve the encoding gain. Syntax can be used on a bitstream to indicate the encoding tool being used.

This invention belongs to the field of point cloud encoding and decoding technology, and particularly relates to a point cloud hybrid motion prediction method based on point cloud prediction trees. The specific steps include: obtaining geometric prediction parameters and sequence initialization, generating candidate points for reference frames, selecting prediction points, and reconstructing the point cloud. This invention obtains the final predicted position by superimposing the local motion of a reference node relative to its parent node onto coordinates after global motion compensation. This invention scientifically expands the candidate node list, introducing a wider range of predictors to cover various motion types. This expansion breaks the limitations of traditional single predictors, enabling the encoder to have richer matching choices when facing complex local motions, thereby effectively reducing prediction residuals. The method of this invention provides consistent and significant coding gains in various dynamic scenarios, especially in driving scenarios with densely packed independent moving objects.

This invention relates to the field of wireless communication technology, specifically disclosing a soft-decision method for GFSK signals based on multi-sampling point adaptive weighting. The method includes: extracting phase change features from the I / Q signal and performing three-level anti-interference processing to obtain an optimized phase difference sequence; performing frequency offset correction and symbol synchronization on the optimized phase difference sequence based on a predefined local ZC preamble sequence and a local gold code sequence in the frame structure; selecting three sampling points (middle, left, and right) from eight times the oversampling points in each symbol period; performing interference compensation on the data from the three sampling points and then weighting and fusing them to obtain a weighted fused sequence; constructing a reference sequence based on the local gold code sequence, and calculating the log-likelihood ratio between the reference sequence and the weighted fused sequence bit by bit as the soft decision value; and performing subsequent decoding based on the soft decision value. This invention can stably reduce the bit error rate and maximize the system coding gain in low signal-to-noise ratio and multipath interference scenarios.

The application discloses a polar adjustment-based finite field multiple access system, a power distribution method and a decoding method, and belongs to the technical field of 6G communication.The application is used for solving the problem of low-rate channel coding in a communication scene and the problem of obtaining coding gain through multi-user channel coding in a multi-user transmission scene in an uplink.The application is used for distributing power to a diagonal form FFMA system to form a corresponding finite field multiple access system.In the process of power distribution, the power is distributed to different symbols for modulating and sending useful information parts by using elements in a polar adjustment vector or polar coefficients.For the case of distributing power by using the polar coefficients, a binary minimum distance decoding algorithm is used for decoding, information bit parts are preliminarily screened in an information bit detection stage, and each information part screened in the information bit detection stage is combined in a joint decoding stage, so that the code word is reconstructed, and the parity check part is decoded after the combination.

The present application belongs to the technical field of communications. Disclosed are a data encoding method and apparatus, a data decoding method and apparatus, and a device and a storage medium. The data encoding method comprises: acquiring a first data segment; acquiring a plurality of basic code groups, wherein the plurality of basic code groups consist of a first code group set and a second code group set, the minimum code group distance between any basic code group in the first code group set and the other code groups among the plurality of basic code groups is greater than the minimum Euclidean distance of PAM, the minimum code group distance between any basic code group in the second code group set and the other code groups among the plurality of basic code groups is equal to the minimum Euclidean distance, and the number of basic code groups in the first code group set is greater than the number of basic code groups in the second code group set; and encoding the first data segment on the basis of the plurality of basic code groups. Since the code group distances between any basic code group in a first code group set and the other code groups are all greater than the minimum Euclidean distance, encoding with the basic code groups in the first code group set can yield an additional coding gain.

The invention discloses a communication method and device, a chip system, a storage medium and a computer program product, which are used for improving coding gain in a data transmission process and further improving decoding performance. In the application, a first communication device receives first data, and obtains second data and third data from the first data. The first data includes a first transport block. The first transport block includes second data and third data. The second data is mapped to the rth time domain symbol of the first time slot. The third data is mapped to the s-th time domain symbol of the second time slot, r and s are positive integers, and r and s are not equal. As the data in the same transmission block is dispersed to two different time domain symbols of at least two time slots for transmission, when a certain time slot is affected by channel shielding in the data transmission process, only part of data of one transmission block is mapped on the time slot, so that the data transmission efficiency is improved. Therefore, the degree of influence of channel shielding on the transmission block in the decoding process is small, and the decoding success rate of the transmission block is high.

The invention provides a high-reliability 8B / 6T coding method and a hybrid error correction and erasure correction method combined with RS codes. The coding method comprises the following steps: step 1, generating a high-reliability 8B / 6T mapping code table HRMap; step 2, data grouping and initialization; step 3, mapping query: searching a corresponding 6T in an 8B / 6T mapping code table HRMap for each 8B code block in sequence to obtain a temporary 6T code block; 4, calculating a current imbalance value; step 5, deciding a finally output 6T code block and updating the operation imbalance according to the previously accumulated imbalance value; and step 6, repeating the step 4 and the step 5 until all the code blocks are processed, and finally outputting a coded ternary symbol sequence. Through collaborative design of a code table and a coding and decoding scheme, the scheme realizes about 2.0 dB coding gain while keeping direct current balance.

Various improvements to trellis coded quantization (TCQ) are described. An improvement modifies the coefficient syntax to preserve parity information in the first coding pass, thereby allowing the decoder to determine the parity of each coefficient without requiring the second pass. An improvement proposes a hybrid state machine approach that allows for better coding gains than a lower-state trellis alone, while reducing the computational complexity of a higher-state trellis. An improvement focuses on enhancing the end-of-block (EOB) decision algorithm using a simplified rate-distortion (RD) cost computation, which can reduce the computational complexity of the trellis search. An improvement introduces a node pruning technique using a dynamic threshold based on the distance of the current position from the DC coefficient, which aims to reduce the number of RD cost calculations performed during the trellis search by pruning nodes that are unlikely to contribute to the optimal solution.

Embodiments of the present application provide a communication method and a communication apparatus. The method includes: receiving a first message, where the first message indicates that decoding of a code set is unsuccessful, and the code set includes N code blocks; obtaining M first code sequences, where the M first code sequences correspond one-to-one with M code blocks from the N code blocks; obtaining a second code sequence based on the M first code sequences, where each first code sequence is enabled to be obtained based on the second code sequence and other M-1 first code sequence (s) among the M first code sequences, and each first code sequence and the second code sequence have the same number of bits; and transmitting the second code sequence. Multiple code sequences corresponding to different CBs are combined to generate a cross-CB code sequence used for retransmission.Thus, coding gain and spectral efficiency of HARQ can be improved.

The application relates to a loop filtering decision method based on a deep neural network of coding information and belongs to the technical field of image processing. The decision method is applied to the neural network-based loop filter decision in a video coding standard VVC. A neural network-based loop filter is preset as Filter Net, which is used to replace a deblocking effect filter DBF and a sample adaptive offset SAO in the VVC standard. An FFDN is built to extract features of input information, so that distortion conditions are accurately learned, and then a CTU-level Filter Net flag is obtained. The input of the FFDN is reconstruction information of a coding tree unit (CTU), a division depth matrix, slice type information and a QP value. With the coding information, the FFDN network can reduce the complexity of the neural network-based loop filtering scheme under the condition of equivalent coding gain, and then the overall coding time is reduced.

In a video coding system, it is proposed to improve the intra prediction based on intra-block copy by allowing a decoder-side refinement allowing further refinement of the block vector obtained from IBC using a template matching process. In this template matching, the decoder searches in an iterative process the best match for the current block (L-shaped) template within the reconstructed area, adjacent to the block vector determined using the IBC 10 prediction. This technique allows to obtain a finer precision that what is possible with IBC while minimizing the amount of coding information. In at least one embodiment where a coarse precision is used for IBC, it allows at the same time to benefit from significant coding gain provided by IBC while providing a much finer precision with reduced signaling of the block vector.

Various improvements to trellis coded quantization (TCQ) are described. An improvement modifies the coefficient syntax to preserve parity information in the first coding pass, thereby allowing the decoder to determine the parity of each coefficient without requiring the second pass. An improvement proposes a hybrid state machine approach that allows for better coding gains than a lower-state trellis alone, while reducing the computational complexity of a higher-state trellis. An improvement focuses on enhancing the end-of-block (EOB) decision algorithm using a simplified rate-distortion (RD) cost computation, which can reduce the computational complexity of the trellis search. An improvement introduces a node pruning technique using a dynamic threshold based on the distance of the current position from the DC coefficient, which aims to reduce the number of RD cost calculations performed during the trellis search by pruning nodes that are unlikely to contribute to the optimal solution.