Interleaver design and pairwise codeword distance distribution enhancement for turbo autoencoder
US-12175353-B2 · Dec 24, 2024 · US
US9015095B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9015095-B2 |
| Application number | US-201213650928-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 12, 2012 |
| Priority date | Jan 25, 2012 |
| Publication date | Apr 21, 2015 |
| Grant date | Apr 21, 2015 |
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 neural network designing method forms a RNN (Recurrent Neural Network) circuit to include a plurality of oscillating RNN circuits configured to output natural oscillations, and an adding circuit configured to obtain a sum of outputs of the plurality of oscillating RNN circuits, and inputs discrete data to the plurality of oscillating RNN circuits in order to compute a fitting curve with respect to the discrete data output from the adding circuit.
Opening claim text (preview).
What is claimed is: 1. A neural network designing method comprising: a forming procedure causing a computer to form a RNN (Recurrent Neural Network) circuit to include a plurality of oscillating RNN circuits configured to output natural oscillations, and an adding circuit configured to obtain a sum of outputs of the plurality of oscillating RNN circuits; and a computing procedure causing the computer to input discrete data to the plurality of oscillating RNN circuits, in order to compute a fitting curve with respect to the discrete data output from the adding circuit, wherein the computing procedure includes computing and storing in a storage unit a 0 ,a 1 , . . . , a 2n-1 ,b 1 , . . . , b 2n-1 represented by the following formulas from the discrete data y 0 =0, y 1 , . . . , y 2n-1 , y 2n =0, a 0 = 1 2 n ∑ i = 1 2 n - 1 y i = 1 2 n ∑ i = 0 2 n y i a q = ψ ( q 2 n ) 4 n π 2 ∑ i = 1 2 n - 1 y i ( - cos ( i - 1 ) q π n + 2 cos i q π n - cos ( i + 1 ) q π n ) q = 1 , 2
Recurrent networks, e.g. Hopfield networks · CPC title
Temporal neural networks, e.g. delay elements, oscillating neurons or pulsed inputs · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.