Filters








4,397 Hits in 6.4 sec

Input-adaptive parallel sparse fast fourier transform for stream processing

Shuo Chen, Xiaoming Li
2014 Proceedings of the 28th ACM international conference on Supercomputing - ICS '14  
Fast Fourier Transform (FFT) is frequently invoked in stream processing, e.g., calculating the spectral representation of audio/video frames, and in many cases the inputs are sparse, i.e., most of the  ...  This paper improves upon existing sparse FFT algorithms by simultaneously exploiting the input sparsity and the similarity between adjacent inputs in stream processing.  ...  the Fourier transform for the current input signal.  ... 
doi:10.1145/2597652.2597669 dblp:conf/ics/ChenL14 fatcat:gero4s5mmzgbbmahetk6kikumy

An Input-Adaptive Algorithm for High Performance Sparse Fast Fourier Transform [chapter]

Shuo Chen, Xiaoming Li
2014 Lecture Notes in Computer Science  
Many applications invoke the Fast Fourier Transform (FFT) on sparse inputs, with most of their Fourier coefficients being very small or equal to zero.  ...  This paper proposes an input-adaptive sparse FFT algorithm that takes advantage of the similarity between input samples to automatically design and customize sparse filters that lead to better parallelism  ...  In this paper, we address these limitations by proposing a new sublinear algorithm for sparse fast Fourier transform.  ... 
doi:10.1007/978-3-319-09967-5_15 fatcat:tmjyxko23jeojmjglippi7waha

An Efficient Implementation of NC-OFDM Transceivers for Cognitive Radios

Rakesh Rajbanshi, Alexander M. Wyglinski, Gary J. Minden
2006 2006 1st International Conference on Cognitive Radio Oriented Wireless Networks and Communications  
Given that the core component of an NC-OFDM transceiver is the fast Fourier transform (FFT), and that several of the subcarriers are deactivated, it is possible to reduce the execution time by "pruning  ...  We propose an algorithm that efficiently and quickly prunes the FFT for NC-OFDM transceivers.  ...  Then, the signal is converted into parallel streams using S/P converter, the cyclic prefix (CP) is discarded, and the fast Fourier transform (FFT) is applied to transform the time domain data into the  ... 
doi:10.1109/crowncom.2006.363452 dblp:conf/crowncom/RajbanshiWM06 fatcat:oqvgkbazmjau5hidm7czwe3m5y

Streaming GPU Singular Value and Dynamic Mode Decompositions [article]

Seth D. Pendergrass, J. Nathan Kutz, Steven L. Brunton
2016 arXiv   pre-print
This work develops a parallelized algorithm to compute the dynamic mode decomposition (DMD) on a graphics processing unit using the streaming method of snapshots singular value decomposition.  ...  In addition, it is possible to leverage the native compressed format of many data streams, such as HD video and computational physics codes that are represented sparsely in the Fourier domain, to massively  ...  SLB and SDP acknowledge support from the Department of Energy under award de-ee0006785 and thank NVIDIA for providing a Tesla K40 GPU for this research.  ... 
arXiv:1612.07875v1 fatcat:qry2nxh3mbbdlbmuomyc73iai4

Software Defined Radio for Underwater Applications using FPGA

Ch Sailaja, D Rajaramesh, M.Srinivasa Rao
2014 IOSR Journal of VLSI and Signal processing  
This paper describes an Underwater Acoustic Communication system for establishing a two-way communication between monitoring station and the underwater device.  ...  Acknowledgment Our sincere thanks to Sri.C.D.Malleswar, Scientist-G, Director, Naval Science and Technological Laboratory for his encouragement and support in bringing out this paper.  ...  Thanks are also due to Sri S.Raja Scientist-G of NSTL for his encouragement in bringing this paper. The authors sincerely acknowledge the contributions made by other team members.  ... 
doi:10.9790/4200-04520104 fatcat:ut5mfqvp2ngcre5hzk4kunnane

Fast Hybrid DFT/DCT Architecture for OFDM in Cognitive Radio System

Zhu Chen, Moon Ho Lee, Chang Joo Kim
2007 Future Generation Communication and Networking (FGCN 2007)  
In this paper, the sparse matrix decompositions for DFT matrix and DCT matrix are proposed. Based on these propositions, we develop a fast hybrid DFT and DCT architecture for OFDM.  ...  Therefore, there could be a considerably large number of zero-valued inputs/outputs for the IDFT/DFT or IDCT/DCT on the OFDM transceiver.  ...  Without loss of generality, a high speed data stream, ( ) x n , is modulated. Then, the modulated data stream is split into N slower data streams using a serial-to-parallel (S/P) converter.  ... 
doi:10.1109/fgcn.2007.124 dblp:conf/fgcn/ChenLK07 fatcat:esp4z63ygfag7kouyjurjqqsnu

A Survey of Compressed GPU-Based Direct Volume Rendering [article]

Marcos Balsa Rodríguez, Enrico Gobbetti, José A. Iglesias Guitián, Maxim Makhinya, Fabio Marton, Renato Pajarola, Susanne K. Suter
2012 Eurographics State of the Art Reports  
In contrast, adaptive real-time rendering from compressed representations requires fast, transient, and spatially independent decompression.  ...  In order to improve capabilities and performance over the entire storage, distribution and rendering pipeline, the encoding/decoding process is typically highly asymmetric, and systems should ideally compress  ...  for each group of similar elements, while streaming over all the input elements.  ... 
doi:10.2312/conf/eg2013/stars/117-136 fatcat:3cadb2miwngrjoaqmrmudww6lq

State-of-the-Art in Compressed GPU-Based Direct Volume Rendering

M. Balsa Rodríguez, E. Gobbetti, J.A. Iglesias Guitián, M. Makhinya, F. Marton, R. Pajarola, S.K. Suter
2014 Computer graphics forum (Print)  
In contrast, adaptive real-time rendering from compressed representations requires fast, transient, and spatially independent decompression.  ...  Figure 1 : Frames from real-time rendering of animated supernova data set (432 3 × 60, float -18GB), compressed using sparse coding of voxel blocks [GIM12] (block size 6, sparsity 4) at 0.10 bps, PSNR  ...  In the case of the Fourier transform the projection slice is extracted thanks to the Fourier projection-slice theorem [Lev92] using the inverse 2D fast Fourier transform. Viola et al.  ... 
doi:10.1111/cgf.12280 fatcat:3stzgmtlw5hwtk6zxiz4kaep6m

Performance comparison of DFT-OFDM, DCT-OFDM, and DWT-OFDM for visible light communications

Zhenlei Zhou, Bangjiang Lin, Xuan Tang, Sushank Chaudhary, Haiguang Zhang, Chun Lin, Zhaohui Li
2019 17th International Conference on Optical Communications and Networks (ICOCN2018)  
Discrete Fourier transform (DFT) and discrete cosine transform (DCT) to compare discrete wavelet transform (DWT).  ...  These transform, that DCT with 'Haar' and 'biorthogonal' shows better improvement among the wavelet families since the PAPR achieve almost 5 dB.  ...  The output of the low-past filter also has 64 samples, frequency Bit stream data as input randomly The process mapping and remove cyclic prefix The process wavelet transform, the signal is decomposed by  ... 
doi:10.1117/12.2522838 fatcat:jyho7gmmqveshpxlnosgdbzcr4

Low Complexity FFT Factorization for CS Reconstruction

2020 International Journal of Engineering and Advanced Technology  
In this paper is presented a novel area efficient Fast Fourier transform (FFT) for real-time compressive sensing (CS) reconstruction.  ...  In general, for real time applications, FFT transforms are required for high speed computations as well as with least possible complexity overhead in order to support wide range of applications.  ...  Some of the prominent basis widely preferred is discrete cosine transform (DST), Fast Fourier Transform (FFT), wavelet, Gabor, etc.  ... 
doi:10.35940/ijeat.c4675.029320 fatcat:7y2kr76kpngmblngmjig3aybaa

RapidMind: Portability across Architectures and its Limitations [article]

Iris Christadler, Volker Weinberg
2010 arXiv   pre-print
We specially thank our colleague Hans Hacker for providing the CUDA ports and performance figures, and JSC and CEA for access to their accelerator systems and support.  ...  One-dimensional Fast Fourier Transformation (mod2f ) The Fast Fourier Transformation (FFT) is widely used in many scientific programs.  ...  suite [11] have been chosen: -mod2am: a dense matrix-matrix multiplication, -mod2as: a sparse matrix-vector multiplication, -mod2f: a one-dimensional Fast Fourier Transformation (FFT).  ... 
arXiv:1001.1902v2 fatcat:spayf57c5ncarfqykhilt32qga

Parallel Approaches to Digital Signal Processing Algorithms with Applications in Medical Imaging

Konstantin Kapinchev, Adrian Bradu, Adrian Podoleanu
2019 2019 13th International Conference on Signal Processing and Communication Systems (ICSPCS)  
Parallel implementations of some of the most commonly used algorithms, such as Fourier transforms, convolution and cross-correlation are discussed.  ...  This paper reviews established and emerging parallel technologies, which are employed to enhance the performance of digital signal processing algorithms.  ...  Those systems made these signals available for further processing, which is transforming a stream of numerical data into information ready to be visualized, as illustrated in Figure 1 .  ... 
doi:10.1109/icspcs47537.2019.9008720 dblp:conf/icspcs/KapinchevBP19 fatcat:yl7xdpiclfdndjjmfp7kfpxv6i

1983 Index IEEE Transactions on Computers Vol. C-32

1983 IEEE transactions on computers  
Owens, RobertMichael, T-CApr83 406-411 sign/logarithm arithmetic for fast Fourier transforms.  ...  Kumar, Manoj, + , variable-size fast Fourier transforms using VLSI network.  ... 
doi:10.1109/tc.1983.1676190 fatcat:xsogjoynp5dt7mqu6dy4tiodfq

Tailoring Wideband Signals With a Photonic Hardware Accelerator

Bahram Jalali, Ata Mahjoubfar
2015 Proceedings of the IEEE  
This paper proposes a new class of hardware accelerators to alleviate bottlenecks in the acquisition, analytics, storage and computation of information carried by wideband streaming signals.  ...  Solli at the University of California Los Angeles for valuable discussions.  ...  By making Fourier transform computationally efficient, it has become the bedrock of digital signal processing for communication and image processing. Nevertheless, FFT has some limitations.  ... 
doi:10.1109/jproc.2015.2418538 fatcat:kcikt754fbfhdfz4xfrc7jteyu

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

Mohandass Sundararajan, Umamaheswari Govindaswamy
2014 Electronics  
Fast Fourier Transform (FFT) plays a vital role in all the multicarrier modulation techniques. The FFT part of the modem can be used for spectrum sensing.  ...  Since the cognitive radio is an adaptive system, the FFT operator must also be adaptive for various input/output values, in order to save energy and time taken for execution.  ...  For an input signal of length N, which has K non-zero entries in the Fourier transform of the signal, sparse FFT costs O(K log N) instead of O(N log N) in FFT.  ... 
doi:10.3390/electronics3030419 fatcat:kfhyr3mn3ngrzgpkyxrwr7wxbe
« Previous Showing results 1 — 15 out of 4,397 results