Conferences related to Discrete Fourier transforms

Back to Top

2023 Annual International Conference of the IEEE Engineering in Medicine & Biology Conference (EMBC)

The conference program will consist of plenary lectures, symposia, workshops and invitedsessions of the latest significant findings and developments in all the major fields of biomedical engineering.Submitted full papers will be peer reviewed. Accepted high quality papers will be presented in oral and poster sessions,will appear in the Conference Proceedings and will be indexed in PubMed/MEDLINE.


OCEANS 2020 - SINGAPORE

An OCEANS conference is a major forum for scientists, engineers, and end-users throughout the world to present and discuss the latest research results, ideas, developments, and applications in all areas of oceanic science and engineering. Each conference has a specific theme chosen by the conference technical program committee. All papers presented at the conference are subsequently archived in the IEEE Xplore online database. The OCEANS conference comprises a scientific program with oral and poster presentations, and a state of the art exhibition in the field of ocean engineering and marine technology. In addition, each conference can have tutorials, workshops, panel discussions, technical tours, awards ceremonies, receptions, and other professional and social activities.

  • OCEANS 2005 - EUROPE

  • OCEANS 2006 - ASIA PACIFIC

  • OCEANS 2007 - EUROPE

    The theme 'Marine Challenges: Coastline to Deep Sea' focuses on the significant challenges, from the shallowest waters around our coasts to the deepest subsea trenches, that face marine, subsea and oceanic engineers in their drive to understand the complexities of the world's oceans.

  • OCEANS 2008 - MTS/IEEE Kobe Techno-Ocean

  • OCEANS 2009 - EUROPE

  • OCEANS 2010 IEEE - Sydney

  • OCEANS 2011 - SPAIN

    All Oceans related technologies.

  • OCEANS 2012 - YEOSU

    The OCEANS conferences covers four days with tutorials, exhibits and three days of parallel tracks that address all aspects of oceanic engineering.

  • OCEANS 2013 - NORWAY

    Ocean related technologies. Program includes tutorials, three days of technical papers and a concurrent exhibition. Student poster competition.

  • OCEANS 2014 - TAIPEI

    The OCEANS conference covers all aspects of ocean engineering from physics aspects through development and operation of undersea vehicles and equipment.

  • OCEANS 2015 - Genova

    The Marine Technology Society and the Oceanic Engineering Society of IEEE cosponsor a joint annual conference and exposition on ocean science, engineering and policy. The OCEANS conference covers four days. One day for tutorials and three for approx. 450 technical papers and 50-200 exhibits.

  • OCEANS 2016 - Shanghai

    Papers on ocean technology, exhibits from ocean equipment and service suppliers, student posters and student poster competition, tutorial on ocean technology, workshops and town hall meetings on policy and governmental process.

  • OCEANS 2017 - Aberdeen

    Papers on ocean technology, exhibits from ocean equipment and service suppliers, student posters and student poster competition, tutorials on ocean technology, workshops and town hall meetings on policy and governmental process.

  • 2018 OCEANS - MTS/IEEE Kobe Techno-Ocean (OTO)

    The conference scope is to provide a thematic umbrella for researchers working in OCEAN engineering and related fields across the world to discuss the problems and potential long term solutions that concernnot only the oceans in Asian pacific region, but the world ocean in general.

  • OCEANS 2019 - Marseille

    Research, Development, and Operations pertaining to the Oceans


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


2020 IEEE International Symposium on Circuits and Systems (ISCAS)

The International Symposium on Circuits and Systems (ISCAS) is the flagship conference of the IEEE Circuits and Systems (CAS) Society and the world’s premier networking and exchange forum for researchers in the highly active fields of theory, design and implementation of circuits and systems. ISCAS2020 focuses on the deployment of CASS knowledge towards Society Grand Challenges and highlights the strong foundation in methodology and the integration of multidisciplinary approaches which are the distinctive features of CAS contributions. The worldwide CAS community is exploiting such CASS knowledge to change the way in which devices and circuits are understood, optimized, and leveraged in a variety of systems and applications.


2020 IEEE International Instrumentation and Measurement Technology Conference (I2MTC)

The Conference focuses on all aspects of instrumentation and measurement science andtechnology research development and applications. The list of program topics includes but isnot limited to: Measurement Science & Education, Measurement Systems, Measurement DataAcquisition, Measurements of Physical Quantities, and Measurement Applications.



Periodicals related to Discrete Fourier transforms

Back to Top

Antennas and Propagation, IEEE Transactions on

Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.


Applied Superconductivity, IEEE Transactions on

Contains articles on the applications and other relevant technology. Electronic applications include analog and digital circuits employing thin films and active devices such as Josephson junctions. Power applications include magnet design as well asmotors, generators, and power transmission


Biomedical Engineering, IEEE Transactions on

Broad coverage of concepts and methods of the physical and engineering sciences applied in biology and medicine, ranging from formalized mathematical theory through experimental science and technological development to practical clinical applications.


Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Circuits and Systems I: Regular Papers, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.



Most published Xplore authors for Discrete Fourier transforms

Back to Top

Xplore Articles related to Discrete Fourier transforms

Back to Top

Signal processing with CCDs

1974 IEEE International Solid-State Circuits Conference. Digest of Technical Papers, 1974

CCD signal processing is offering new methods for accomplishing many radar, communications and other signal sorting and analysis tasks at significantly lower cost than present digital techniques. The problem of discerning the appropriate device design for specific applications will be probed.


Fast n-D fourier-heisenberg transforms<sup>1</sup>

2000 10th European Signal Processing Conference, 2000

We develop fast Fourier-Heisenberg number theoretical transforms on discrete 1-D and n-D Heisenberg groups (H[3, GF(p), GF(p)] and H[n + 2, GFn(p), GFn(p)]) and over an arbitrary commutative ring K, where GF(p) is the Galois field, p = qmand g is a prime.


Convolution theorems for linear transforms

IEEE Transactions on Signal Processing, 1998

This correspondence explores the existence of convolution theorem for linear transformations under a variety of different assumptions. There are eight convolution theorems, all Fourier-related with only N operations in the transform domain and no ordering constraints on the convolution components in the result. They include circular convolutions and correlations.


Polynomial Fourier transforms

[1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic, 1988

A discrete polynomial Fourier transform that leads to a family of Chrestenson- related transforms is disclosed. The polynomial spectrum of a p-valued function can be calculated without requiring complex multiplication. Former known expressions for Chrestenson spectra can be obtained from the polynomial spectra by a simple modulo reduction. The coefficients of the spectral polynomials give exact information on the correlation ...


Bipolar VLSI facilitates Fourier transformation

ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing, 1982

This paper describes an integrated address sequencer for the Fast Fourier Transform. It also shows how this may be included in a high-speed signal processing peripheral.



Educational Resources on Discrete Fourier transforms

Back to Top

IEEE-USA E-Books

  • Signal processing with CCDs

    CCD signal processing is offering new methods for accomplishing many radar, communications and other signal sorting and analysis tasks at significantly lower cost than present digital techniques. The problem of discerning the appropriate device design for specific applications will be probed.

  • Fast n-D fourier-heisenberg transforms<sup>1</sup>

    We develop fast Fourier-Heisenberg number theoretical transforms on discrete 1-D and n-D Heisenberg groups (H[3, GF(p), GF(p)] and H[n + 2, GFn(p), GFn(p)]) and over an arbitrary commutative ring K, where GF(p) is the Galois field, p = qmand g is a prime.

  • Convolution theorems for linear transforms

    This correspondence explores the existence of convolution theorem for linear transformations under a variety of different assumptions. There are eight convolution theorems, all Fourier-related with only N operations in the transform domain and no ordering constraints on the convolution components in the result. They include circular convolutions and correlations.

  • Polynomial Fourier transforms

    A discrete polynomial Fourier transform that leads to a family of Chrestenson- related transforms is disclosed. The polynomial spectrum of a p-valued function can be calculated without requiring complex multiplication. Former known expressions for Chrestenson spectra can be obtained from the polynomial spectra by a simple modulo reduction. The coefficients of the spectral polynomials give exact information on the correlation between p-valued and linear functions. It is shown that the coefficients of selected spectral polynomials characterize the p-valued threshold functions uniquely.<<ETX>>

  • Bipolar VLSI facilitates Fourier transformation

    This paper describes an integrated address sequencer for the Fast Fourier Transform. It also shows how this may be included in a high-speed signal processing peripheral.

  • Fast computation of the discrete Hartley transform

    Two approaches to the computation of the discrete Hartley transform (DHT) are proposed. The first approach is based on computing a prime length DHT using a radix-2 number-theoretic transform. The number of multiplications required in this method is equal to N-1, which is less than the number of multiplications required for direct computation of the DHT using radix-2 or split radix algorithms. In the second approach, short-term transforms are implemented with rotations replacing multiplications. The availability of VLSI cordic processors implementing circular rotation makes this approach an interesting alternative to the realization of the transform.<<ETX>>

  • New formulation of fast discrete Hartley transform with the minimum number of multiplications

    A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2/sup m/. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.<<ETX>>

  • High speed 2D hexagonal convolution by polynomial transform

    The inherent nonseparable difficulty in 2D hexagonal sampled data can be overcome by choosing suitable periodicity and sampling basis, this will turn the original hexagonal data into very simple separable parallelograms, and then the rectangular polynomial transforms can be used to efficiently calculate 2D hexagonal convolutions; This algorithm is much faster than the hexagonal discrete Fourier transform method.

  • Digital all-pass filter design through discrete Hilbert transform

    A simple method for the design of a digital all-pass filter, satisfying the given group delay specification, is presented. The design is based on the discrete Hilbert transform relation, relating the log-magnitude and phase of the Fourier transform of the minimum phase signal. The transfer function of an all-pass filter is completely determined by the coefficients of the denominator polynomial. For the filter to be stable, the denominator polynomial must be minimum phase. From the given group delay specification, the phase corresponding to the pole part of the desired filter is first determined. The magnitude spectrum corresponding to the pole part of the desired filter is obtained from the above phase through the discrete Hilbert transform relation. The method needs just four fast Fourier transform operations. There is no restriction on the order of the filter, and the number of filter coefficients can be selected after the final design, depending on the accuracy desired. The procedure is illustrated through design examples.<<ETX>>

  • Efficient computation of the DFT of a 2N - point real sequence using FFT with CORDIC based butterflies

    In this paper, an efficient method for computation of the DFT of a 2N - point real sequence by using DIT FFT with CORDIC based butterflies is presented. Most of the real world applications use long real valued sequences. By using FFT with CORDIC based butterflies, the space required on ROM and also the time required to perform the operation can be reduced. Further, to calculate the 2N - point DFT, by using one N-point DFT involving complex valued data, efficiency is almost doubled.



Standards related to Discrete Fourier transforms

Back to Top

No standards are currently tagged "Discrete Fourier transforms"