[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Polat et al., 2015 - Google Patents

Design and implementation of 256‐point radix‐4 100 Gbit/s FFT algorithm into FPGA for high‐speed applications

Polat et al., 2015

View PDF @Full View
Document ID
6572713658321181099
Author
Polat G
Ozturk S
Yakut M
Publication year
Publication venue
ETRI Journal

External Links

Snippet

The third‐party FFT IP cores available in today's markets do not provide the desired speed demands for optical communication. This study deals with the design and implementation of a 256‐point Radix‐4 100 Gbit/s FFT, where computational steps are reconsidered and …
Continue reading at onlinelibrary.wiley.com (PDF) (other versions)

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
    • 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/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • 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/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • 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

Similar Documents

Publication Publication Date Title
Polat et al. Design and implementation of 256‐point radix‐4 100 Gbit/s FFT algorithm into FPGA for high‐speed applications
Primak et al. Stochastic methods and their applications to communications: stochastic differential equations approach
Zhu et al. Countering variations and thermal effects for accurate optical neural networks
WO2016107236A1 (en) Self-adaptive equalization filtering apparatus and method in optical fibre communications, and storage medium
Xu et al. Spectral analysis of sampled band-limited signals in the offset linear canonical transform domain
Garrido et al. Optimum MDC FFT hardware architectures in terms of delays and multiplexers
Xiao et al. VLSI design of low‐cost and high‐precision fixed‐point reconfigurable FFT processors
Deren et al. Extremal Positive Solutions for Hadamard Fractional Differential Systems on an Infinite Interval
Bae et al. Improved implementation approaches for 512-tap 60 GSa/s chromatic dispersion FIR filters
Cirillo et al. An iterative approach to barycentric rational Hermite interpolation
Ji et al. Hardware Implementation of Chromatic Dispersion Compensation in Finite Fields
Mai et al. Aveiro method in reproducing kernel Hilbert spaces under complete dictionary
Li et al. A parareal approach of semi‐linear parabolic equations based on general waveform relaxation
Kulshreshtha et al. CORDIC‐based Hann windowed sliding DFT architecture for real‐time spectrum analysis with bounded error‐accumulation
Zayed et al. Dispersive Optical Solitons For Schrodinger–Hirota Equation With Fourth–Order Dispersion And Multiplicative White Noise
Kadak et al. On the Classical Paranormed Sequence Spaces and Related Duals over the Non‐Newtonian Complex Field
US20090112959A1 (en) Single-cycle FFT butterfly calculator
Chahardahcherik et al. Implementing FFT algorithms on FPGA
Abdelkawy et al. Optical Solitons for Chen–Lee–Liu equation with two spectral collocation approaches
Nguyen et al. An FPGA-based implementation of a pipelined FFT processor for high-speed signal processing applications
Selva Efficient type‐4 and type‐5 non‐uniform FFT methods in the one‐dimensional case
Xing et al. Low-Complexity Chromatic Dispersion Compensation Using High-Radix Fermat Number Transform
Hazarika et al. Energy efficient VLSI architecture of real‐valued serial pipelined FFT
Reynoso‐Godinez et al. FPGA‐based parallel process for Walsh–Hadamard transform
Hua et al. A fast realization of new Mersenne number transformation and its applications