Results 231 to 240 of about 120,753 (284)

Entropy and Chaos-Based Modeling of Nonlinear Dependencies in Commodity Markets. [PDF]

Entropy (Basel)
Georgescu I, Kinnunen J.
europepmc   +1 more source

Life as a Categorical Information-Handling System: An Evolutionary Information-Theoretic Model of the Holobiont. [PDF]

Biology (Basel)
Carvajal-Rodríguez A.
europepmc   +1 more source

The Learning Rate Is Not a Constant: Sandwich-Adjusted Markov Chain Monte Carlo Simulation. [PDF]

Entropy (Basel)
Vrugt JA, Diks CGH.
europepmc   +1 more source

Biomolecular condensate microstructure is invariant to sequence-encoded molecular and macroscopic properties.

Soft Matter
Tan D, Aierken D, Garcia PL, Joseph JA.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fast Fourier Transformation Based on Number Theoretic Transforms

Journal of the Franklin Institute, 1988
A technique, denoted as FFT/NTT \((FFT=fast\) Fourier transform, \(NTT=number\) theoretic transform), is proposed for the fast computation of DFT (discrete Fourier transform) of a real sequence with prime length \(p=2^ M+1\). This technique is essentially a modification of \textit{Rader}'s method [Proc. IEEE, Vol.
Adhami, Reza, Polge, Robert J.
openaire   +1 more source

Hartley number theoretic transforms

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
The Hartley number theoretic transform (HNTT) is introduced, in particular, the Mersenne HNTT is defined and some multiplication free transforms are given.
R.M. Campello de Souza, H.M. de Oliveira, L.B. Espinola Palma, M.M. Campello de Souza   +3 more
openaire   +1 more source

Multiple radix fast fourier transformation based on number theoretic transforms

Journal of the Franklin Institute, 1991
Discrete Fourier transform on a prime number of samples is computed by means of the multiple radix fast Fourier transformation based on number theoretic transforms. This proposal is efficient in the transformation of samples \(P=2^{k1}3^{k2}5^{k3}\) with arbitrary integers ki \((i=1,2,3)\).
Lawrence, Brooks, Polge, Robert, Adhami, Reza   +2 more
openaire   +2 more sources

Arithmetic for ternary number-theoretic transforms

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1993
Summary: A simplified arithmetic for the computation of ternary number-theoretic transforms is presented. The proposed arithmetic is based on the application of a code translation technique that was used by \textit{L. M. Leibowitz} [A simplified binary arithmetic for the Fermat number transform, IEEE Trans.
Sunder, S., Antoniou, A.
openaire   +1 more source