82 results about "Coding gain" patented technology

The invention relates to the field of adaptive noise reduction, in particular to an adaptive noise reduction method and system for a multi-mode audio SoC main control chip. The method comprises the following steps: acquiring an original audio input signal according to an SoC main control chip, performing time-frequency domain dual deconstruction and cross-frequency domain noise interference structure analysis, and constructing a full-frequency domain noise interference topology table; carrying out multi-mode interference factor separation on the full-frequency-domain noise interference topology table, carrying out multi-noise environment modeling, and constructing a real-time noise scene model; time sequence noise slope fluctuation modeling is carried out on the real-time noise scene model, dynamic noise reduction response learning optimization is carried out, and a dynamic noise reduction optimization strategy is constructed; and performing neural coding gain and audio boundary line reconstruction according to the original audio input signal to obtain a coding gain key audio signal and a weak audio optimization signal. According to the invention, by flexibly adjusting the noise reduction intensity of the audio signal, the real-time scene noise reduction performance is optimized.

The invention provides an anti-interference phase estimation method suitable for MSK modulation, which belongs to the technical field of anti-interference phase estimation and comprises the following steps: S1, an interference identification and marking step which comprises a signal capturing and hopping link, an interference detection algorithm link and an interference mask generation link; s2, an interference range judgment and processing step, wherein the step comprises a whole-hop interfered processing link, a partial interference processing link, a pilot frequency sequence reconstruction link and a phase estimation and compensation link; and S3, a data integration and post-processing step, wherein the step comprises a demodulation link, a data splicing link, a de-interleaving processing link, a channel decoding link and a performance feedback link. In order to solve the problems that the coding gain of a decoder is reduced and the communication performance is influenced by a traditional method when short-time sudden interference occurs in communication, the phase can still be effectively estimated by using data which are not interfered through the characteristics of MSK modulation, so that the data which are not interfered can participate in subsequent demodulation and decoding, and the communication performance is improved. And the anti-interference capability of the system is effectively improved.

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

The embodiment of the invention discloses a data mapping method and a related device, which can obtain higher coding gain while keeping good compatibility, and can ensure the resistance to channel burst errors at the same time. Specifically, a first data stream encoded by an outer code is obtained. Afterwards, the first data stream is subjected to inner code coding to obtain a second data stream, the second data stream comprises L code words subjected to second FEC coding, L is an integral multiple of 8, each code word comprises n bits, and n is an odd number larger than 1. Furthermore, the L code words are interleaved and mapped to obtain n * L / 8 DP-16QAM symbols, any one of an X polarization direction I-path component, an X polarization direction Q-path component, a Y polarization direction I-path component and a Y polarization direction Q-path component of each DP-16QAM symbol is obtained by mapping two bits in the L code words, and each DP-16QAM symbol is obtained by mapping eight bits from eight code words.

The invention discloses an incoherent index modulation method and system based on a fluid antenna, and belongs to the field of wireless communication. A plurality of fluid antenna transmitting modes are preset for a fluid antenna wireless communication system, and a beam forming vector corresponding to each transmitting mode is optimized by using a closed expression of a fluid antenna space coding gain, so that a transmitter can transmit a phase shift keying modulation symbol while transmitting the phase shift keying modulation symbol; spatial bit information can be implicitly transmitted through a cyclic shift value of a fluid antenna emission mode index value, and the whole communication process does not need to depend on channel state information, so that the multiple-input-multiple-output communication method for fluid antenna energization without channel estimation is realized.

A VVC-standard encoder and a VVC-standard decoder are provided, implementing a decoder-side chroma intra prediction mode gradient-based derivation method, which improves coding efficiency of chroma intra prediction, thereby saving on signaling cost. A VVC-standard decoder configures one or more processors of a computing system to derive one of multiple possible chroma intra prediction modes by computing gradients of adjacent luma samples and chroma samples of a current chroma block. With minimal increase in signaling cost, the VVC-standard coding and decoding processes are enhanced to base intra prediction modes for chroma blocks on collocated luma block-adjacent reconstructed luma samples adjacent reconstructed chroma samples, enabling prior computational work done on coding and decoding adjacent blocks to be referenced. In this fashion, coding gains can be achieved in matching texture characteristics of the current chroma block based on a texture gradient including adjacent blocks.

The invention discloses a self-adaptive modulation method and device for a power line carrier communication system, which belongs to the technical field of power line carrier communication, and comprises the following steps of: acquiring channel information of the power line carrier communication system, including a transmission characteristic value of each sub-channel and the total transmitting power of the system, and calculating the signal-to-noise ratio of each sub-channel; according to the signal-to-noise ratio of each sub-channel and the total transmission power of the system, calculating the power value allocated to each sub-channel, adjusting the original power peak-to-average ratio of the sub-channel, determining the adjusted power peak-to-average ratio, and calculating the adjusted coding gain through an optimization coefficient related to the system characteristics in combination with the adjusted power peak-to-average ratio and the original coding gain; according to the method, the performance and the reliability of the power line carrier communication system are improved by reasonably distributing the sub-channel power, controlling the peak-to-average power ratio, optimizing the error control coding gain and intelligently switching the working mode.

The invention relates to an eight-ring QC-LDPC (Quasi-Cyclic Low Density Parity Check) code construction method based on a subtraction construction search algorithm. According to the method, a first row is fixed by using a Golomb Ruler sequence, the last two rows are obtained by using a search algorithm constructed based on subtraction to form an index matrix meeting a condition without 4 and 6 rings, and finally, the index matrix is correspondingly 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 required storage space is small, and hardware implementation is easy. A simulation result shows that compared with an SS-QC-LDPC code, a DDS-QC-LDPC code, a GR-QC-LDPC code, an LETS-QC-LDPC code and a GRS-QC-LDPC code which have the same code rate and code length, the SC-QC-LDPC code constructed by the method has the advantages that the net coding gain is improved to a certain degree, and the constructed SC-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 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.

To provide a method or a device for realizing a coding or a decoding, a compression or an extension of a video.SOLUTION: A method and a device for mounting a discreteness trigger metric conversion are based on the maximum conversion size. According to an embodiment, an intra prediction of a matrix base is not related to the maximum conversion size, and validates a code unit size until a size to be designated. In the other embodiment, low frequency non-separable conversion is used for improve a code gain. By using a construction in a bit stream, a code tool to be used can be indicated.SELECTED DRAWING: Figure 4

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.

The invention provides a data retransmission method and device, in the method, for the Yth data retransmission, the sum value of the length of initial data transmission and the length of previous (Y-1) th data retransmission can be the accumulated transmission length of data, and the switching point of IR-HARQ and CC-HARQ is determined according to the length of the Yth data retransmission and the accumulated transmission length, so that the switching point of the IR-HARQ and the CC-HARQ is determined according to the length of the Yth data retransmission and the accumulated transmission length. The coding gain can be obtained, and the low implementation complexity can be kept at the same time.

A coding method for data communication is provided, and may be applied to a plurality of scenarios such as a metro network, a backbone network, and a data center interconnection. The method includes: forming a first codeword, where the first codeword includes n image bits and n to-be-transmitted bits, the n image bits are selected from to-be-transmitted bits in m source codewords, the source codeword is a codeword formed before the first codeword, both n and m are positive integers, and n>m; and sending the n to-be-transmitted bits in the first codeword. The bit in the first codeword is protected by a plurality of codewords generated at different moments, and a coding gain effect is better. In addition, the bit in the codeword is protected by different quantities of codewords.

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 invention relates to the technical field of decoding, and provides a source-channel joint decoding method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining the initialization information of a channel encoder, and the prior probability information of a variable node of a source decoder; determining check node information of the information source decoder based on initialization information and the prior probability information; executing the following iteration steps: updating the soft information of the variable node of the information source decoder based on the check node information and the initialization information; and based on the updated soft information, performing decoding judgment to determine a decoding result. According to the method, check node information of a source decoder is determined based on initialization information and prior probability information, soft information of variable nodes of the source decoder is iteratively updated based on the check node information and the initialization information, that is, the information of a source is used as available soft information in the decoding process, the coding gain is improved, and the decoding efficiency is improved. Therefore, the accuracy of source-channel joint decoding is improved.

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 invention relates to a blind phase estimation method and system for a high-speed frequency hopping system, and the method comprises the steps: a receiving end carries out the capturing of a synchronization hop according to a synchronization code, and determines the synchronization time of the frequency hopping system; determining the position of a data symbol in each data hop according to the synchronization time, and selecting N unknown data symbols to participate in phase estimation; except the necessary fixed overhead of the data hop, the rest time is used for transmitting the data; for binary digital modulation, N original bits corresponding to N unknown data symbols have K possible valuing modes, K is equal to 2N, a local modulation signal of each valuing mode and a received signal corresponding to the position are subjected to correlation operation, a possible phase estimation value is obtained, and K phase estimation values are obtained in total; and finding an optimal value from the K phase estimation values. According to the invention, the phase estimation function can be completed without inserting a pilot frequency sequence, the transmission overhead is saved, the user requirement of high-speed information is met, and the coding gain and the system performance are improved at the same time.

The present invention discloses that some operations associated with transform decoding can provide coding gain for coded blocks predicted by intra prediction, but not for coded blocks predicted using certain inter prediction tools or techniques. These operations can include, for example, multi-transform selection (MTS) and / or transform skip, and the inter prediction tools or techniques can include one or more of affine motion compensation, combined inter and intra prediction (CIIP), triangular partitioning mode (TPM), or geometric merge mode (GEO). Accordingly, systems, methods, and tools associated with versatile video coding can be configured such that the foregoing operations associated with transform decoding can be disabled for coded blocks that are predicted using one or more of the inter prediction tools or techniques described herein. Many benefits can result from disabling these operations, including, for example, reduced coding time and / or signaling overhead.

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.

Transform coding of video data for inter-prediction is disclosed, some operations associated with transform decoding may provide coding gain for intra-predicted coding blocks, but not for coding blocks predicted using certain inter-prediction tools or techniques. These operations may include, for example, multiple transform selection (MTS) and / or transform skipping, and inter prediction tools or techniques may include one or more of affine motion compensation, combined inter and intra prediction (CIIP), triangular partition mode (TPM), or geometric merge mode (GEO). Accordingly, systems, methods, and tools associated with multi-function video coding may be configured such that the foregoing operations associated with transform decoding may be disabled for a coded block predicted using one or more inter prediction tools or techniques described herein. Many benefits may be derived from disabling these operations, including, for example, reducing encoding time and / or signaling overhead.

The present application provides a data retransmission method and apparatus. In the method, for a Y-th data retransmission, the sum value of the length of a data initial transmission and the length of the previous Y-1 data retransmissions can be the cumulative transmission length of data, and a switching point for an IR-HARQ and a CC-HARQ is determined on the basis of the length of the Y-th data retransmission and the accumulated transmission length, so that not only can a coding gain be obtained, but lower implementation complexity can also be maintained.

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.