Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

3482 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.
Owner:BEIJING UNIV OF POSTS & TELECOMM

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.
Owner:HFI INNOVATION INC

Algebraic soft decoding of reed-solomon codes

InactiveUS6634007B1Maximizes the expected scoreMaximizing the expected scoreOther 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>
Owner:MIND FUSION LLC

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.
Owner:HARBIN INST OF TECH

Adaptive network system with online learning and autonomous cross-layer optimization for delay-sensitive applications

A network system providing highly reliable transmission quality for delay-sensitive applications with online learning and cross-layer optimization is disclosed. Each protocol layer is deployed to select its own optimization strategies, and cooperates with other layers to maximize the overall utility. This framework adheres to defined layered network architecture, allows layers to determine their own protocol parameters, and exchange only limited information with other layers. The network system considers heterogeneous and dynamically changing characteristics of delay-sensitive applications and the underlying time-varying network conditions, to perform cross-layer optimization. Data units (DUs), both independently decodable DUs and interdependent DUs, are considered. The optimization considers how the cross-layer strategies selected for one DU will impact its neighboring DUs and the DUs that depend on it. While attributes of future DU and network conditions may be unknown in real-time applications, the impact of current cross-layer actions on future DUs can be characterized by a state-value function in the Markov decision process (MDP) framework. Based on the dynamic programming solution to the MDP, the network system utilizes a low-complexity cross-layer optimization algorithm using online learning for each DU transmission.
Owner:SANYO NORTH AMERICA CORP +1
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