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

52 results about "Allocation Code" patented technology

A coded value specifying the method of assigning entities to groups or categories.

H.264 code rate control method

The present invention discloses an H.264 code rate control method, for in sequence performing code rate control to each current macro block in the current P-frame, which includes: if the current macro block is the first macro block of the current P-frame, taking the average quantization parameter QP of the former frame as the QP of the current macro block; otherwise, calculating the edge direction of the current macro block, and using the edge direction to predict the mean absolute error MAD of the current macro block, updating the quadratic code rate- quantitative step length R-Q model coefficient based on the historical information of the coded macro block, determining the head information bit number predicted value and pre-allocation code rate of the current macro block; an then based on the MAD predicted value, head information bit number predicted value and pre-allocation code rate of the current macro block, using the quadratic R-Q model with update coefficient to determine the QP of the current macro block. Using the method of the invention can more efficiently use correlativity of time-domain and space-domain, overcome the defect of JVT-G012 code rate control algorithm and its improved algorithm existing in the performance or computational complexity, to achieve the most effective code rate control.
Owner:BEIJING UNIV OF POSTS & TELECOMM

FPGA interconnect resource allocation generation method based on reinforcement learning

The invention belongs to the technical field of FPGAs and provides an FPGA interconnect resource allocation generation method based on reinforcement learning. Firstly, an interconnect resource model based on the reinforcement learning is constructed, and a state transition matrix and a return function are initialized; then, the state transition matrix and the return function are combined, and according to the interconnect source model, a reinforcement learning training method is adopted to train a strategy; then, a wiring initial state point is set, according to the strategy, allocation traces are finished, and according to the allocation traces, the state transition matrix is updated; finally, the state transition matrix is updated repeatedly until the coverage rate is withdrawn, all allocation traces are summarized and converted to allocation codes, and finally, the interconnect resource allocation is output. According to the FPGA interconnect resource allocation generation method based on the reinforcement learning, by the adoption of a reinforcement learning theory, on the premise that the interconnect resource test coverage rate reaches 100 %, test allocation times are effectively reduced, automatic allocation of the FPGA comprising Global and Local interconnect resources is achieved, the test efficiency is high, and the applicability is good.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Realization method for dynamic clock based on embedded WEB-OMT (object modeling technology) page

The invention discloses a realization method for a dynamic clock based on an embedded WEB-OMT (object modeling technology) page. The method comprises the following steps of: A, sending a page request to a server by a client end; B, downloading a page document including a dynamic clock script from the server by the client end; and C, analyzing HTML (hypertext markup language) tags by the client end, and implementing a JavaScript. The page document comprises a document head and a document body corresponding to the document head, wherein the document comprises a dynamic clock JavaScript, and the document body comprises corresponding HTML allocation codes and JavaScript calling codes. In the technical scheme of the realization method, a pure script is used to realize the dynamic clock, an internal function is mainly used to realize dynamic effect, combined with a trigonometric function, the precise positioning is realized, pictures are not included in a realization form, and the loading time is shortened; and meanwhile the realization form of the adopted codes can be expanded, the maintenance difficulty is small, the flexibility is high, and an intuitive dynamic effect is provided. The realization method for the dynamic clock based on the embedded WEB-OMT page can be widely applied in the technical field of communication.
Owner:ALLWIN TELECOMM

Workshop layout scheduling optimization method based on multi-objective non-dominated sorting

The invention discloses a workshop layout scheduling optimization method based on multi-objective non-dominated sorting. The method comprises the following steps: 1, collecting data related to production resources in an enterprise production process; 2, encoding equipment, layout and processes of a production workshop, and establishing an optimization model; 3, generating a uniform reference point set, and randomly initializing a population Pt of which the scale is N; 4, performing selection, crossover and variation on the population Pt to obtain a filial generation population Qt with the scale of N, and merging the parent population and the filial generation population to obtain a population Rt with the scale of 2N; 5, after the Rt is subjected to non-dominated sorting, dividing the Rt into a plurality of layers such as F1, F2 and the like; 6, indicating that St = F1 union, F2 union... Fl, and until '2jeemaa2' St '2jeemaa2' is greater than or equal to N; 7, normalizing individuals: normalizing all individual targets in the St; 8, setting a clustering operator, and defining the niche number of the ith reference point as rho i; 9, selecting K individuals from the F1 by using the niche number and putting the K individuals into Pt + 1; 10, judging whether the maximum number of iterations is met or not; and 11, generating layout codes and equipment allocation codes.
Owner:ZHEJIANG UNIV OF TECH

Memory allocation code detection method, device, computer equipment and storage medium

The invention discloses a memory allocation code detection method, a memory allocation code detection device, computer equipment and a storage medium. According to the technical scheme, the method comprises the following steps that: the computer equipment acquires an intermediate language code of a to-be-detected application program code, determines that an instruction code is a target intermediate language code of a target instruction code in the to-be-detected intermediate language code, and finally determines the position information of the memory allocation code in the to-be-detected application program code by determining the position information of the source code corresponding to the target intermediate language code in the to-be-detected application program code. Therefore, according to the scheme, the position information of the memory allocation code in the to-be-detected application program can be determined through the target intermediate language code. Moreover, the memoryallocation code detection method provided by the invention does not need to run the application program and does not need to exhaust each operation condition of the application program. Therefore, the operation is simple and convenient. The problem of incomplete memory allocation code detection can also be avoided.
Owner:TENCENT TECH (SHENZHEN) CO LTD

Dynamic allocation method of coding vector based on graph coloring in multicast network

InactiveCN101577629AReduce complexityIncrease the probability of successful decodingSpecial service provision for substationMulticast networkGraph coloring
The invention discloses a dynamic allocation method of coding vector based on graph coloring in a multicast network. Coding vectors are allocated for the multicast network based on network coding, that target node receives global coding vector linearity is not related is guaranteed. Based on the purpose, the invention provides a coding vector allocation method based on graph coloring, the method comprises the following steps of: converting a multicast tree needing allocation coding vector into a line graph, then dividing the line graph into different areas for constructing simple planar graph, next, mapping different colors into different coding vectors which are allocated to each top point of the areas (namely each edge of the multicast tree). After the global coding vectors are allocated for all the edges of the multicast tree, a source node is needed to record original coding vectors, the target node records decoding matrix, and the coding node calculates and records local coding vectors. During the transmission of data, the source node and the coding node need to transmit linear combination of information vectors and coding vectors downward; and the target node calls the decoding matrix and adopts a Gaussian elimination method for decoding.
Owner:BEIJING UNIV OF POSTS & TELECOMM
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