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

43 results about "Stochastic computing" patented technology

Stochastic computing is a collection of techniques that represent continuous values by streams of random bits. Complex computations can then be computed by simple bit-wise operations on the streams. Stochastic computing is distinct from the study of randomized algorithms.

Knowledge graph-based recommendation method and device, computer equipment and storage medium

ActiveCN111966912ASolve the problem of not being able to obtain accurate recommendation results with high efficiency and low costSpecial data processing applicationsSemantic tool creationPathPingTheoretical computer science
The invention discloses a knowledge graph-based recommendation method and device, computer equipment and a storage medium. The method comprises the following steps: determining a to-be-analyzed node in the plurality of nodes, setting a relationship weight value between the to-be-analyzed node and a first-layer neighbor node as a, and randomly calculating a relationship weight value I from any neighbor node of the to-be-analyzed node to an Lth-layer node of the to-be-analyzed node, wherein I = a-(L-1) * (a/6); selecting the node of which the relationship weight value from the to-be-analyzed node to other nodes is greater than a preset value to generate a recommended path; generating recommendation data between the to-be-analyzed node and other nodes according to the recommendation path. According to the method, the knowledge graph nodes are randomly calculated for multiple times, the relationship strength values of the other nodes are obtained from the single node, then the nodes meeting the preset relationship strength value are selected to generate the recommendation path, and therefore the problem that an accurate recommendation result cannot be obtained with high efficiency andlow cost is solved.
Owner:ONE CONNECT SMART TECH CO LTD SHENZHEN

Random computing method for importance degree of wavelet coefficient of two-dimensional image

The invention discloses a random computing method for an importance degree of a wavelet coefficient of a two-dimensional image. The present method is very rough and is generally used for only dividing foreground and background coefficients or appointing one importance degree to each code block. The random computing method comprises the following steps: firstly, initializing alpha as a 0 matrix and generating a random matrix r, wherein the row number and the line number are consistent with beta and the elements are uniformly distributed on a coordinate (-1, 1); defining beta'=sgn(r)*beta and performing wavelet conversion W on beta', thereby obtaining alpha': alpha'=W(beta'); finally, updating alpha:alphap=max(alphap, absolute value of alphap') and performing p0 on each position; and if alpha no longer changes, ending and outputting alpha. According to the random computing method provided by the invention as a middle step of a JPEG2000 implicit ROI encoding process, the importance degree of each element on an image space is converted into the importance degree of each coefficient on a wavelet domain. According to the random computing method provided by the invention, the more accurate control on the ROI area and importance degree of a JPEG2000 compressed image is realized.
Owner:浙江锐智信息技术有限公司

Random computing method for importance degree of wavelet coefficient of two-dimensional image

The invention discloses a random computing method for an importance degree of a wavelet coefficient of a two-dimensional image. The present method is very rough and is generally used for only dividing foreground and background coefficients or appointing one importance degree to each code block. The random computing method comprises the following steps: firstly, initializing alpha as a 0 matrix and generating a random matrix r, wherein the row number and the line number are consistent with beta and the elements are uniformly distributed on a coordinate (-1, 1); defining beta'=sgn(r)*beta and performing wavelet conversion W on beta', thereby obtaining alpha': alpha'=W(beta'); finally, updating alpha:alphap=max(alphap, absolute value of alphap') and performing p0 on each position; and if alpha no longer changes, ending and outputting alpha. According to the random computing method provided by the invention as a middle step of a JPEG2000 implicit ROI encoding process, the importance degree of each element on an image space is converted into the importance degree of each coefficient on a wavelet domain. According to the random computing method provided by the invention, the more accurate control on the ROI area and importance degree of a JPEG2000 compressed image is realized.
Owner:浙江锐智信息技术有限公司

Probability calculation-based TPC iterative decoding method and decoder

The invention discloses a TPC iterative decoding method and decoder based on probability calculation, and relates to the field of wireless communication, and the technical scheme is characterized in that a log-likelihood ratio matrix is fused with external information, and a random bit stream and a random number generated randomly are compared and judged; performing BCH codeword self-check, extended bit parity check and Euclidean distance check on the initial hard decision row decoding result and the initial hard decision column decoding result to obtain initial row check information and initial column check information; performing fusion check updating on the initial row check information and the initial column check information according to the zone bit distribution condition to obtain row fusion check information and column fusion check information; and performing iterative processing. By means of probability calculation and extrinsic information updating strategies, complex test pattern generation can be achieved through a simple random calculation method, complete TPC iterative decoding is achieved, the structure is simple, implementation is easy, hardware implementation complexity is greatly reduced, and hardware efficiency is improved.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

A large-scale mimo detection method and detection device

The invention discloses a large-scale MIMO (Multiple-Input Multiple-Output) detecting method and belongs to the technical field of wireless communication. The large-scale MIMO detecting method comprises the steps of detecting an MIMO signal by utilizing a BP (Belief Propagation) based iterative algorithm in a real number domain; before BP iteration, firstly normalizing and quantifying all the definitive variables to enable the variables to be within a range of [-1, 1], and then representing the normalized and quantified definitive variables by using random bit streams with symbols; in the BP iteration process, finishing updating and delivery of information through random calculation; and after the BP iteration is finished, converting the random bit streams output after iteration into the definitive variables to serve as output soft information. The invention also discloses a large-scale MIMO detecting device. By combining the BP algorithm in the real number domain with random calculation, the hardware consumption and system delay just increase linearly along with the addition of the number of transmitting or receiving antennas while the detecting performance as same as that of definite detection is guaranteed, and accordingly the large-scale MIMO detecting method and device can well adapt to large-scale MIMO scenes.
Owner:SOUTHEAST UNIV

A method for fast formation of Jacobian matrix in power system power flow calculation

A method for quickly forming a Jacobian matrix in power system power flow calculations, comprising: establishing an array Y(n,d) that only stores triangular non-zero elements on the Y array in a random order, and controls the number of non-zero elements with the number of non-zero elements Read and apply; accumulatively calculate the self-admittance of nodes i and j; calculate the mutual admittance of nodes i and j respectively, and calculate S cumulatively according to the number of mutual admittances i ;Write the Y(n,d) array into the data file; read the Y(n,d) data file and randomly calculate the node active current I according to the parameters of the Y(n,d) array pi and reactive current I qi ;According to Y array element and J ij and J ji The corresponding relation of sub-array non-zero element position, use Y(n,d) array element, calculate J array element according to two rows + two columns at the same time; According to I pi , I qi , modify all diagonal elements to form a complete J matrix. The calculation speeds of forming and storing Y-array data files, reading Y-array data files, and forming J-array are greatly superior to those of traditional methods, and the advantages become more obvious with the increase of system scale.
Owner:NANCHANG UNIV
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