[go: up one dir, main page]

Ramesha et al., 2016 - Google Patents

A novel Architecture of FBMC Transmitter using Poly phase Filtering and its FPGA implementation

Ramesha et al., 2016

View PDF
Document ID
8092340450534805883
Author
Ramesha M
Ramana T
Publication year
Publication venue
Indian Journal of Science and Technology

External Links

Snippet

Abstract Background/Objectives: In most of the Cognitive radio and frequency spectrum access we are using Filter Bank Multicarrier (FBMC) architecture; the Cognitive radio changes its parameters according to the environmental changes to operating the data in …
Continue reading at sciresol.s3.us-east-2.amazonaws.com (PDF) (other versions)

Classifications

    • 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/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
    • G06F7/5332—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even by skipping over strings of zeroes or ones, e.g. using the Booth 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/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
    • 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
    • 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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals

Similar Documents

Publication Publication Date Title
Rao et al. FPGA implementation of complex multiplier using minimum delay Vedic real multiplier architecture
CN109359267B (en) Low-complexity multiplier-free fixed-point FFT (fast Fourier transform) optimization method based on dynamic truncation
Elango et al. VLSI implementation of an area and energy efficient FFT/IFFT core for MIMO-OFDM applications
Ganjikunta et al. An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications
CN105095152B (en) A kind of 128 configurable point FFT devices
Prakash et al. Performance evaluation of FFT processor using conventional and Vedic algorithm
Liu et al. Design of low-power, 1GS/s throughput FFT processor for MIMO-OFDM UWB communication system
Godi et al. Design optimisation of multiplier‐free parallel pipelined FFT on field programmable gate array
Ramesha et al. A novel Architecture of FBMC Transmitter using Poly phase Filtering and its FPGA implementation
CN104657334B (en) A kind of base 2-4-8 mixed base butterfly of fast Fourier variation calculates device and its application
Kala et al. High throughput, low latency, memory optimized 64K point FFT architecture using novel radix-4 butterfly unit
Manuel et al. An area efficient high speed optimized FFT algorithm
CN101937332A (en) Multiplexing method of multipliers in multi-channel FFT processor based on radix-24 algorithm
Dali et al. An efficient MIMO-OFDM radix-2 single-path delay feedback FFT implementation on FPGA
Kumar et al. Small area reconfigurable FFT design by Vedic Mathematics
Xudong et al. Special-purpose computer for 64-point FFT based on FPGA
KR20120109214A (en) Fft processor and fft method for ofdm system
Jang et al. Low-power FFT design for NC-OFDM in cognitive radio systems
Ramesha et al. Design and Implementation of fully pipelined 64-point FFT Processor in a FPGA
Kumar et al. Performance Analysis of FPGA based Implementation of FFT Architecture with Pruning Algorithm for Industrial Applications
Arun et al. Design of eight parallel 512-point mdf fft/ifft processor for wpan applications
Yuan et al. A 256-point dataflow scheduling 2× 2 MIMO FFT/IFFT processor for IEEE 802.16 WMAN
Kumar et al. FPGA Implementation of Adaptive Absolute SCORE Algorithm for Cognitive Radio Spectrum Sensing with WTM and LFA.
Cardarilli et al. Design and FPGA Implementation of a Low Power OFDM Transmitter for Narrow-Band IoT.
Sun et al. An implementation of FFT processor