Eureka-AI is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Eureka AI

1517 results about "Round complexity" patented technology

Round complexity is also a meaningful measure of complexity when constraints are placed on the allowed types of communication, particularly in the LOPC/LOCC frameworks where private/quantum communication is not allowed.

Channel-polarization-based encoder for staggered structure duplication code, and encoding and decoding methods thereof

The invention discloses a channel-polarization-based encoder for a staggered structure duplication code, and an encoding method and decoding methods thereof. The encoder consists of a duplication bit buffer with a storage capacity of L bits, a bit position mapper with a length N and a channel polarization device with the length N which are connected in sequence. The encoding method based on the encoder comprises the following steps of: embedding duplicated encoding into a channel polarization process, and introducing a duplicated relationship between parts of the bits of code blocks transmitted in sequence during the channel polarization for encoding. In addition, the invention further provides two decoding methods, which comprise the following steps of: decoding by using a simple and rapid successive cancellation (SC) algorithm, and performing iterative decoding by using a Tanner-graph-based belief propagation algorithm with excellent performance. On the basis of the innovative structure encoder, the encoding and decoding methods provided by the invention are stronger in error correction capability under the condition of not increasing the decoding complexity, and the transmission performance is obviously improved. The encoding and decoding methods are particularly applicable to an actual communication engineering system and have a good popularization and application prospect.

Method and Apparatus of Transform Unit Partition with Reduced Complexity

ActiveUS20120230411A1Reduced encoding computational complexitySmall motion estimation costColor television with pulse code modulationColor television with bandwidth reductionRound complexityMotion vector
Three block concepts are introduced in HEVC: coding unit (CU), prediction unit (PU), and transform unit (TU). The overall coding structure is characterized by the various sizes of CU, PU and TU in a recursive fashion. For transform processing in current HEVC, a hierarchy RQT (Residual Quad Tree) is used and the TU size is related to the CU size, but independent of the PU size. This results in high encoding complexity and also causes increased processing time to process the syntax of residual quad tree. Accordingly a modified transform unit partition with reduced complexity is disclosed. According to an embodiment, the TU size may be restricted to the minimum of PU width and height, except for a 2N×2N coding unit with the 2N×2N partition type. In another embodiment, the maximum TU size equals to maximum of PU width and height, and the minimum TU size equals to minimum of the PU width and height, except for a 2N×2N coding unit with the 2N×2N partition type. In yet another embodiment, the TU size is selected between 2N×2N and N×N for the 2N×2N, 2N×N, N×2N and N×N partition types. The syntax element, split_transform_flag, is used to indicate the selection of 2N×2N or N×N TU size when needed. Furthermore, a method with reduced complexity of selecting the best merge candidate for the 2N×2N CU merge mode is disclosed. The method relies on R-D cost associated with the motion vector of merge candidate to reduce required computation.

Algebraic soft decoding of reed-solomon codes

InactiveUS6634007B1Other decoding techniquesAlgebraic geometric codesDecoding methodsRound complexity
An algorithmic soft-decision decoding method for Reed-Solomon codes proceeds as follows. Given the reliability matrix Pi showing the probability that a code symbol of a particular value was transmitted at each position, computing a multiplicity matrix M which determines the interpolation points and their multiplicities. Given this multiplicity matrix M, soft interpolation is performed to find the non-trivial polynomial Q<HIL><PDAT>M</SB><PDAT>(X,Y) of the lowest (weighted) degree whose zeros and their multiplicities are as specified by the matrix M. Given this non-trivial polynomial Q<HIL><PDAT>M</SB><PDAT>(X,Y), all factors of Q<HIL><PDAT>M</SB><PDAT>(X,Y) of type Y-f(X) are found, where f(X) is a polynomial in X whose degree is less than the dimension k of the Reed-Solomon code. Given these polynomials f(X), a codeword is reconstructed from each of them, and the most likely of these codewords selected as the output of the algorithm. The algorithmic method is algebraic, operates in polynomial time, and significantly outperforms conventional hard-decision decoding, generalized minimum distance decoding, and Guruswami-Sudan decoding of Reed-Solomon codes. By varying the total number of interpolation points recorded in the multiplicity matrix M, the complexity of decoding can be adjusted in real time to any feasible level of performance. The algorithmic method extends to algebraic soft-decision decoding of Bose-Chaudhuri-Hocquenghem codes and algebraic-geometry codes.</PTEXT>

Method for detecting code similarity based on semantic analysis of program source code

The invention discloses a method for detecting code similarity based on semantic analysis of a program source code, which relates to computer program analyzing technology and a method for detecting complex codes of computer software. The method solves the prior problems of low similarity detection accuracy and high computing complexity on the codes of different syntactic representations and similar semantemes, and also solves the problem of incapability of realizing large-scale program code similarity detection. The method comprises the following steps: resolving two segments of source codes to be detected into two control dependence trees of a system dependence graph respectively and executing basic code standardization respectively; utilizing a measure method to extract candidate similar code control dependence trees of the control dependence trees which are subjected to the basic code standardization; executing an advanced code standardization operation on extracted candidate similar codes; and computing semantic similarity to obtain a similarity result so as to finish the code similarity detection. The method is applied to source code piracy detection, software component library query, software defect detection, program comprehension and the like.

Synchronization and channel response estimation method suitable for OFDM system

The invention relates to a synchronization and channel response estimation method which is applicable to an OFDM system, the technical proposal is as follows: a maximum likelihood criterion ML-based cost function for the symbol timing synchronization, the carrier frequency synchronization and the channel parameter joint estimation is proposed by using an OFDM system model under a frequency selective fading channel and against the requirements on the accuracy of the transmission of high-quality information of the next generation of wireless communication system and the existing OFDM wireless communication system. A system architecture and a strategy of joint estimation symbols of timing offset Theta, carrier frequency offset Epsilon and channel impulse response h are derived from the cost function. The method comprises the following steps of carrying out the coarse synchronization and the channel response estimation and carrying out the fine synchronization and the calculation of a channel estimated value. The method can realize the balance between the calculation precision and the calculation complexity, increase or reduce the times of the iteration of the fine synchronization according to an actual system, reduce the interference during the wireless transmission, further improve the reliability of the system and improve the availability of the system.

Generation method of vector quantization code book

The invention provides a generation method of a vector quantization code book. In the method, a global optimization method based on a random relaxation technology is introduced; and while iteratively updating the code book every time, random disturbance is generated and added to a corresponding code word, thus local convergence is effectively avoided during the process of updating the code book. The method can further rationally optimize a code book structure and bit positions of the code word according to the inherent characteristic of channel statistical distribution of a wireless communication system and the requirement on orthogonality of user scheduling in a base station in an MIMO system on the selected users. In addition, a method for expanding the code book is also introduced in order to improve the robustness of the code book in a multi-channel statistical distribution environment, and the size of the code book can be flexibly adjusted according to specific conditions. As the antenna number of the base station and downlink user equipment is greatly increased based on the demand of the development of the future communication system, the method can generate reserved interfaces for the future code book, and can achieve higher quantization and system performance with lower complexity even though the method is used in high-dimensional vector quantization.

Multi-band structure self-adaptive filter switching method for AEC (acoustic echo cancellation)

ActiveCN106782593AAchieving Convergence Speed ​​AdvantageOvercome speedSpeech analysisMulti bandAdaptive filter
The invention discloses a multi-band structure self-adaptive filter switching method for AEC (acoustic echo cancellation). Firstly, a far-end voice signal is acquired; a voice endpoint is detected, and a VAD (voice activity detection) flag bit and an improved envelope decision threshold are output; the voice signal is fed into a loudspeaker to serve as a desired signal and also input into a self-adaptive filter; the self-adaptive filter adopts a switchable multi-band structure and a corresponding self-adaptive algorithm, parameters of the filter are adjusted by use of the least mean square criterion according to feedback information, and the optimal solution is obtained. According to the provided switching method, voice characteristics are considered sufficiently under the condition that steady maladjustment is guaranteed, and optimized configuration of the convergence rate and the algorithm complexity is realized while advantages of the algorithm in the convergence rate are utilized. During actual application of echo cancellation, a single algorithm does not easily meet various variable demands. The variable switching algorithm provides more probability for a user and has great significance in application of self-adaptive echo cancellation.

DSL system loading and ordering

Loading and ordering techniques are provided for one-sided and two-sided vectored line groups, as well as loading methodologies that also can be used on a single line, in communication systems such as DSL binders. For single-user lines, bits and energy are optimally allocated for a given set of parameters, which may include maximum rate, minimum rate, maximum margin, target margin, minimum margin and PSD mask of any shape. Iterations, bit-swapping during loading or adaptive margin update during loading can be used in single-user loading, which has low complexity and can be used for a variety of loading objectives and/or goals, such as rate-adaptive, margin-adaptive and fixed-margin objectives. For multi-user vectoring systems, ordering as well as loading is provided for a supplied rate-tuple within a rate region, determining acceptable user loadings and orderings so that the rate-tuple can be implemented. For one-sided vectored DSL, some loading and ordering determines acceptable allocations of bits, energy and decoding/precoding ordering(s) for each tone of each user for a specified set of rates on the vectored lines. PSD determination, ordering and bit allocation can be iteratively used in multi-user loading and ordering and can augment and alter the criteria used for bit swapping procedures used in single lines (or in bonded multiple lines for a single user) so that a favorable vector of rates is achieved for all users. Order swapping can adjust a bit vector and/or rate vector within a constant-rate-sum convex subset of a hyperplane towards the desired vector of user rates for each of the lines.
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products