Suchergebnisse - "Fast-Fourier transform algorithms"

Optimization of the Weight Processing Algorithm in Multichannel Doppler Filtering

Autoren: V. I. Koshelev Ngoc Hieu Trinh

Quelle: Известия высших учебных заведений России: Радиоэлектроника, Vol 27, Iss 2, Pp 93-104 (2024)

Schlagwörter: non-equidistant pulse sequence, TK7800-8360, weight processing optimization, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Electronics, optimization of multichannel doppler filtering, modified fast fourier transform algorithms, 01 natural sciences, combined fast fourier transform algorithms, 0104 chemical sciences

Zugangs-URL: https://doaj.org/article/273d85f49dd8485791196ca28f500b22

The Elastic Properties of Dilute Solid Suspensions with Imperfect Interfacial Bonding: Variational Approximations Versus Full-Field Simulations: The elastic properties of dilute solid suspensions with imperfect interfacial bonding: variational approximations versus full-field simulations

Autoren: Gallican, Valentin Zecevic, Miroslav Lebensohn, Ricardo A. et al.

Quelle: Journal of Elasticity. 153:373-398

Schlagwörter: interfaces, Suspensions, Structured surfaces and interfaces, coexistent phases, Classical linear elasticity, Spectral and related methods applied to problems in solid mechanics, Micromechanical theories, homogenization, variational methods, elasticity, Effective constitutive equations in solid mechanics, Fast-Fourier transform algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7687182
https://doi.org/10.1007/s10659-023-10001-4

Factor graphs and the sum-product algorithm

Autoren: Frank R. Kschischang Brendan J. Frey Hans-Andrea Loeliger

Quelle: IEEE Transactions on Information Theory. 47:498-519

Schlagwörter: Signal theory (characterization, reconstruction, filtering, etc.), factor graphs, forward/backward algorithm, Graph algorithms (graph-theoretic aspects), sum-product algorithm, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, turbo decoding algorithm, 02 engineering and technology, fast Fourier transform algorithms, Viterbi algorithm, belief propagation

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1775783
https://doi.org/10.1109/18.910572

Fast Fourier Transforms for Wreath Products: Fast Fourier transforms for wreath products

Autoren: Daniel N. Rockmore

Quelle: Applied and Computational Harmonic Analysis. 2:279-292

Schlagwörter: (subgroup)-adapted bases, Extensions, wreath products, and other compositions of groups, Complexity and performance of numerical algorithms, wreath products, Applied Mathematics, data analysis, 0102 computer and information sciences, fast Fourier transform algorithms, 0101 mathematics, linear complexity, 01 natural sciences, Numerical methods for discrete and fast Fourier transforms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/850660
https://doi.org/10.1006/acha.1995.1020
https://core.ac.uk/display/82788067
https://www.sciencedirect.com/science/article/pii/S1063520385710202
https://www.sciencedirect.com/science/article/abs/pii/S1063520385710202

A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing

Autoren: Markus Hegland

Quelle: Numerische Mathematik. 68:507-547

Schlagwörter: parallel processing, matrix multiplication, Other matrix algorithms, 0202 electrical engineering, electronic engineering, information engineering, Parallel numerical computation, mixed-radix representation, 02 engineering and technology, fast Fourier transform algorithms, 0101 mathematics, matrix factorization, 01 natural sciences, Numerical methods for discrete and fast Fourier transforms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/691554
https://doi.org/10.1007/s002110050074
http://core.ac.uk/display/24277718
https://rd.springer.com/article/10.1007/s002110050074
https://link.springer.com/article/10.1007%2Fs002110050074

Algorithm to retrieve real coefficients of a two-dimensional Fourier series using complex one-dimensional FFTs

Autoren: Kassab, Alain J. Nordlund, R. S.

Quelle: Advances in Engineering Software. 19:41-44

Schlagwörter: two-dimensional Fourier series, fast Fourier transforms, Fourier series and coefficients in several variables, 0103 physical sciences, FORTRAN program, Numerical methods for trigonometric approximation and interpolation, Fourier coefficients, Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces, fast Fourier transform algorithms, 0101 mathematics, 01 natural sciences, Numerical methods for discrete and fast Fourier transforms

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/0965997894900450

High speed implementation of certain adaptive filters: A novel Toeplitz matrix decomposition approach

Autoren: John A. Tague Francis I. Mcwhorter

Quelle: Circuits, Systems, and Signal Processing. 12:495-502

Schlagwörter: Signal theory (characterization, reconstruction, filtering, etc.), implementation problems, adaptive filters, 0102 computer and information sciences, fast Fourier transform algorithms, 0101 mathematics, 01 natural sciences, Filtering in stochastic control theory

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/488302
https://doi.org/10.1007/bf01188091
https://link.springer.com/content/pdf/10.1007/BF01188091.pdf
https://link.springer.com/article/10.1007/BF01188091

Superparallel FFTs

Autoren: Hans Munthe-Kaas

Quelle: SIAM Journal on Scientific Computing. 14:349-367

Schlagwörter: superparallel algorithms, Numerical algorithms for specific classes of architectures, parallel computing, SIMD computers, 0202 electrical engineering, electronic engineering, information engineering, Parallel numerical computation, single instruction multiple data machines, 02 engineering and technology, fast Fourier transform algorithms, Numerical methods for discrete and fast Fourier transforms

Dateibeschreibung: application/xml

Zugangs-URL: http://dl.acm.org/citation.cfm?id=160077.160083

Optimal and Superoptimal Circulant Preconditioners: Optimal and superoptimal circulant preconditioners

Autoren: Evgenij E. Tyrtyshnikov

Quelle: SIAM Journal on Matrix Analysis and Applications. 13:459-473

Schlagwörter: Iterative numerical methods for linear systems, preconditioning, Toeplitz matrices, Numerical computation of matrix norms, conditioning, scaling, Preconditioners for iterative methods, fast Fourier transform algorithms, 0101 mathematics, complexity, 01 natural sciences, circulant matrices, Conditioning of matrices

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/58157
https://doi.org/10.1137/0613030
http://locus.siam.org/doi/abs/10.1137/0613030
https://dl.acm.org/doi/10.1137/0613030
https://epubs.siam.org/doi/10.1137/0613030
https://doi.org/10.1137/0613030
https://locus.siam.org/doi/abs/10.1137/0613030

A geometrical interpretation of the Chinese remainder theorem and its applications to MD signal processing

Autoren: BERNARDINI, Riccardo cortelazzo g mian g.

Quelle: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. 48:603-605

Schlagwörter: Signal theory (characterization, reconstruction, filtering, etc.), multidimensional signal processing, prime factor fast Fourier transform algorithms, lattice chains, 0202 electrical engineering, electronic engineering, information engineering, Algebraic coding theory, cryptography (number-theoretic aspects), Chinese remainder theorem, 02 engineering and technology, 0101 mathematics, 01 natural sciences, Numerical methods for discrete and fast Fourier transforms, base change

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1769383
https://doi.org/10.1109/81.922462
https://core.ac.uk/display/53333405
https://ieeexplore.ieee.org/document/922462/

Computational Study of Stokesian Suspensions using Particle Mesh Ewald Summation

Autoren: Menon, Udayshankar K

Thesis Advisors: Nott, Prabhu R

Schlagwörter: Particle Mesh Ewald Summation, Stokesian Suspensions, Particle Dynamics, Stokesian Dynamics, Particle Velocity, Unbounded Shear, Stokesian Suspension Simulations, Fast Fourier Transform Algorithms, Chemical Engineering

Relation: G27105

Verfügbarkeit: http://etd.iisc.ernet.in/2005/3846
http://etd.iisc.ernet.in/abstracts/4718/G27105-Abs.pdf

Fourier transforms that respect crystallographic symmetries

Autoren: M. Shenefelt L. Auslander

Quelle: IBM Journal of Research and Development. 31:213-223

Schlagwörter: Other geometric groups, including crystallographic groups, Fourier coefficients, Fourier series of functions with special properties, special Fourier series, crystal density function, crystal structure determination, space group, group of lattice translations, fast Fourier transform algorithms, 0101 mathematics, 01 natural sciences, Statistical mechanics of crystals, X-ray diffraction

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4009017
https://doi.org/10.1147/rd.312.0213
https://ieeexplore.ieee.org/document/5390131/
http://ieeexplore.ieee.org/document/5390131/

ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor

Autoren: Kala, S

Thesis Advisors: Nandy, S K, Jamadagni, H S

Schlagwörter: Wireless Communication Systems, Fast Fourier Transformation Processor, Fast Fourier Transform Archirecture, Fast Fourier Transform - Algorithms, Application Specific Integrated Circuit, FFT Processor, FFT Architecture, Orthogonal Frequency Division Multiplexing (OFDM), Communication Engineering

Relation: G25691

Verfügbarkeit: http://etd.iisc.ernet.in/handle/2005/2557
http://etd.ncsi.iisc.ernet.in/abstracts/3324/G25691-Abs.pdf

Advances in the study of fast algorithms in image and digital signal processing

Autoren: Yu, Pinneng Jiang, Zengrong

Schlagwörter: Signal theory (characterization, reconstruction, filtering, etc.), computational complexity, fast algorithms, discrete Fourier transform, polynomial transforms, Parallel numerical computation, image and digital signal processing, Complexity and performance of numerical algorithms, number theoretic transforms, survey article, Research exposition (monographs, survey articles) pertaining to numerical analysis, prime factor FFT algorithms, radix fast Fourier transform algorithms, parallel computation, Numerical methods for discrete and fast Fourier transforms, Number-theoretic algorithms, complexity

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/123802

Computational Study of Stokesian Suspensions using Particle Mesh Ewald Summation

Autoren: Menon, Udayshankar K Nott, Prabhu R

Weitere Verfasser: Menon, Udayshankar K Nott, Prabhu R

Schlagwörter: Particle Mesh Ewald Summation, Stokesian Suspensions, Particle Dynamics, Stokesian Dynamics, Particle Velocity, Unbounded Shear, Stokesian Suspension Simulations, Fast Fourier Transform Algorithms, Chemical Engineering

Dateibeschreibung: application/pdf

Relation: G27105; http://etd.iisc.ac.in/handle/2005/3846

Verfügbarkeit: http://etd.iisc.ac.in/handle/2005/3846
http://etd.iisc.ac.in/static/etd/abstracts/4718/G27105-Abs.pdf

ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor

Autoren: Kala, S Nandy, S K Jamadagni, H S

Weitere Verfasser: Kala, S Nandy, S K Jamadagni, H S

Schlagwörter: Wireless Communication Systems, Fast Fourier Transformation Processor, Fast Fourier Transform Archirecture, Fast Fourier Transform - Algorithms, Application Specific Integrated Circuit, FFT Processor, FFT Architecture, Orthogonal Frequency Division Multiplexing (OFDM), Communication Engineering

Dateibeschreibung: application/pdf

Relation: G25691; https://etd.iisc.ac.in/handle/2005/2557

Verfügbarkeit: https://etd.iisc.ac.in/handle/2005/2557
http://etd.iisc.ac.in/static/etd/abstracts/3324/G25691-Abs.pdf