Interleaver design and pairwise codeword distance distribution enhancement for turbo autoencoder
US-12175353-B2 · Dec 24, 2024 · US
US2020005120A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2020005120-A1 |
| Application number | US-201816020619-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 27, 2018 |
| Priority date | Jun 27, 2018 |
| Publication date | Jan 2, 2020 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space. The method also includes either assigning a corresponding set of ringed neurons in a spiking neural network to a corresponding virtual random walker, or assigning a corresponding set of ringed neurons to a point in the virtual space. Movement of a given virtual random walker is tracked by decoding differences between states of individual neurons in a corresponding given set of ringed neurons. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network.
Opening claim text (preview).
What is claimed is: 1 . A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers, the method comprising: defining, using a processor, a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space; assigning, using the processor, a corresponding set of ringed neurons in a spiking neural network to a corresponding virtual random walker such that there is a one-to-one correspondence between sets of ringed neurons and the virtual random walkers, wherein movement of a given virtual random walker is tracked by decoding differences between states of individual neurons in a corresponding given set of ringed neurons, wherein a spiking neural network comprising a plurality of sets of ringed spiking neurons is established; and executing, using the processor, a virtual random walk of the plurality of virtual random walkers using the spiking neural network, wherein executing includes tracking all movements of all of the plurality of virtual random walkers. 2 . The method of claim 1 wherein the corresponding set of ringed neurons comprises a first set of ringed neurons and a second set of ringed neurons, and wherein differences between neuron positions in the first set and the second set determine a position of the corresponding virtual random walker. 3 . The method of claim 1 wherein the corresponding set of ringed neurons comprises a first set of ringed neurons, a second set of ringed neurons, and a third set of ringed neurons, and wherein differences between neuron positions in the first set, the second set, and the third set determine a position of the corresponding virtual random walker. 4 . The method of claim 1 further comprising: using a set of neurons to introduce a spike delay to add or subtract a time increment when a given neuron in a given ring will trigger. 5 . The method of claim 1 further comprising: using a secondary circuit placed on all rings of a given walker to advance or stall triggering of the corresponding set of ringed neurons. 6 . The method of claim 1 further comprising: storing a result of the virtual random walk on a non-transitory computer readable storage medium. 7 . The method of claim 6 further comprising: using the result to model a physical process. 8 . The method of claim 7 wherein the physical process is selected from the group consisting of: radiation transport, plasma dynamics, and molecular dynamics. 9 . The method of claim 8 wherein the result is used to track a property selected from the group consisting of: path dependent behavior of particles, interactions of virtual random walkers with one another, interactions of virtual random walkers with an environment in which the virtual random walkers are walking, and combinations thereof. 9 . The method of claim 6 further comprising: using the result to perform a discrete simulation Monte Carlo (DSMC) simulation of a physical process. 10 . The method of claim 6 further comprising: using the result to model an application-specific boundary condition of a physical process. 11 . The method of claim 6 further comprising: using the result to model information propagation through a social network. 12 . The method of claim 6 further comprising: using the result to compute a property of a computerized graph database. 13 . The method of claim 12 further comprising: estimating a valuation of a financial asset. 14 . The method of claim 12 further comprising: finding one of a neighborhood or a clique within the computerized graph database. 15 . An application-specific integrated circuit comprising: a processor architecture that implements a spiking neural network comprising a plurality of sets of ringed spiking neurons, wherein each set of ringed spiking neurons is assigned to calculate a single corresponding property of a single corresponding object. 16 . The application-specific integrated circuit of claim 15 wherein the plurality of sets of ringed spiking neurons comprises a first set of ringed neurons and a second set of ringed neurons, and wherein differences between neuron positions in the first set and the second set determine a position of the corresponding virtual random walker. 17 . The application-specific integrated circuit of claim 15 wherein the plurality of sets of ringed spiking neurons comprises a first set of ringed neurons, a second set of ringed neurons, and a third set of ringed neurons, and wherein differences between neuron positions in the first set, the second set, and the third set determine a position of the corresponding virtual random walker. 18 . The application-specific integrated circuit of claim 15 wherein the processor architecture is further modified to use a spike delay to add or subtract a time increment when a given neuron in a given ring will trigger. 19 . The application-specific integrated circuit of claim 15 wherein the processor architecture is further modified to use a secondary circuit placed on all rings of a given walker to advance or stall triggering of the corresponding set of ringed neurons. 20 . The application-specific integrated circuit of claim 15 further comprising: a non-transitory computer readable storage medium storing results of a virtual random walk.
based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO] · CPC title
Temporal neural networks, e.g. delay elements, oscillating neurons or pulsed inputs · CPC title
Probabilistic graphical models, e.g. probabilistic networks · CPC title
using electronic means · CPC title
Learning methods · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.