Ho et al., 2009 - Google Patents
A reconfigurable systolic array architecture for multicarrier wireless and multirate applicationsHo et al., 2009
View PDF- Document ID
- 16377676361081660810
- Author
- Ho H
- Szwarc V
- Kwasniewski T
- Publication year
- Publication venue
- International Journal of Reconfigurable Computing
External Links
Snippet
A reconfigurable systolic array (RSA) architecture that supports the realization of DSP functions for multicarrier wireless and multirate applications is presented. The RSA consists of coarse‐grained processing elements that can be configured as complex DSP functions …
- 238000000034 method 0 abstract description 14
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
- G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2626—Arrangements specific to the transmitter
- H04L27/2627—Modulators
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2647—Arrangements specific to the receiver
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/145—Square transforms, e.g. Hadamard, Walsh, Haar, Hough, Slant transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/544—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
- G06F7/5443—Sum of products
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR100551111B1 (en) | Pipelined fast fourier transform processor | |
He et al. | Designing pipeline FFT processor for OFDM (de) modulation | |
Jung et al. | New efficient FFT algorithm and pipeline implementation results for OFDM/DMT applications | |
US7856465B2 (en) | Combined fast fourier transforms and matrix operations | |
JP2009535678A (en) | Pipeline FFT Architecture and Method | |
US20090106341A1 (en) | Dynamically Reconfigurable Shared Baseband Engine | |
Shih et al. | VLSI design and implementation of reconfigurable 46-mode combined-radix-based FFT hardware architecture for 3GPP-LTE applications | |
Chen et al. | An indexed-scaling pipelined FFT processor for OFDM-based WPAN applications | |
Boopal et al. | A reconfigurable FFT architecture for variable-length and multi-streaming OFDM standards | |
Ganjikunta et al. | An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications | |
Prakash et al. | Performance evaluation of FFT processor using conventional and Vedic algorithm | |
Prasanna Kumar et al. | Optimized pipelined fast Fourier transform using split and merge parallel processing units for OFDM | |
KR100836624B1 (en) | Device of variable fast furier transform and method thereof | |
Dreschmann et al. | Implementation of an ultra-high speed 256-point FFT for Xilinx Virtex-6 devices | |
Joshi et al. | Distributed arithmetic based split-radix FFT | |
Ho et al. | A reconfigurable systolic array architecture for multicarrier wireless and multirate applications | |
KR100576520B1 (en) | Variable fast fourier transform processor using iteration algorithm | |
Elshafiy et al. | On optimization of mixed-radix FFT: a signal processing approach | |
Pritha et al. | An effective design of 128 point FFT/IFFT processor UWB application utilizing radix-(16+ 8) calculation | |
Ho | A reconfigurable systolic array architecture for multicarrier wireless applications | |
Kirubanandasarathy et al. | VLSI Design of Mixed radix FFT Processor for MIMO OFDM in wireless communications | |
Chandran et al. | NEDA based hybrid architecture for DCT—HWT | |
Efnusheva et al. | Efficiency comparison of DFT/IDFT algorithms by evaluating diverse hardware implementations, parallelization prospects and possible improvements | |
Chien et al. | Design and realisation of a new hardware efficient IP core for the 1-d discrete Fourier transform | |
Kabilamani et al. | Efficient MRFFT feedback-Commutator technique for handling data flow control in narrow band-IOT based LTE |