Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Reordering-needless four-point Winograd Fourier transformation device

A Fourier transform and reordering technology, used in instruments, special data processing applications, complex mathematical operations, etc., can solve problems such as increasing control complexity, reducing operation speed, and multi-memory resources, to improve operation speed, reduce Hardware cost, effect of simplified control logic

Inactive Publication Date: 2017-08-11
RONGCHENG DINGTONG ELECTRONICS INFORMATION SCI & TECH CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

As we all know, reordering means that a first-level buffer must be added, which consumes more memory resources and increases hardware costs.
In addition, reordering will reduce the operation speed and increase the complexity of control

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Reordering-needless four-point Winograd Fourier transformation device
  • Reordering-needless four-point Winograd Fourier transformation device
  • Reordering-needless four-point Winograd Fourier transformation device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments, but not as a limitation of the present invention.

[0019] The FFT of the N-point sequence x(n) is

[0020]

[0021] Among them, n,k=0,1,...,N-1,W N = e -j2π / N . The amount of multiplication and addition operations to directly calculate the N-point FFT is proportional to the square of N. When N is large, the computation load is very large.

[0022] In order to reduce the computational complexity, when N is not a power of 2, a nested multidimensional PFA can be used to realize N-point FFT. Assume that N can be decomposed into the product of s pairwise prime factors, that is, N=N 1 N 2 …N s . That is, any two factors N i and N j The greatest common divisor of (i, j=1, 2, . . . , s, and i≠j) is 1. Note, N i Not necessarily a prime number. The basic principle of N-point PFA is to map one-dimensional large-point FFT ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a four-point Winograd Fourier transformer without reordering, which is characterized in that the processor is mainly composed of an input matrix I, a variable diagonal matrix A, an output matrix O and a complex multiplier M 1 ~ M 3 It consists of four parts. The input matrix I passes through the complex multiplier M 1 Multiplied with the input vector v to get the vector p, the variable diagonal matrix A passes through the complex multiplier M 2 Multiply with the vector p to get the vector q, the output matrix O passes through the complex multiplier M 3 Multiply with vector q to get output vector V. The invention eliminates the reordering operation involved in the four-point Winograd Fourier transformer in the N-point indexing iso-sequence prime factor algorithm, simplifies the control logic, improves the operation speed, saves the memory consumption and reduces the hardware cost.

Description

technical field [0001] The invention relates to the field of digital signal processing, in particular to an implementation method of a Winograd Fast Fourier Transform Algorithm (Winograd Fourier Transform Algorithm, WFTA) without reordering. Background technique [0002] With the continuous growth of wireless communication services, available spectrum resources are increasingly tight. In order to improve spectrum utilization and communication quality, modern wireless communication systems widely adopt Orthogonal Frequency Duplex Multiplexing (OFDM) technology which has strong immunity to frequency selective fading. The core of OFDM technology is FFT. The number of FFT points is divided into power of 2 and non-power of 2. The number of points is a power of 2 FFT algorithm and its implementation is relatively mature. In contrast, FFT with non-power-of-two points is more flexible, and has been applied in DRM, DTMB, and LTE systems in recent years. Therefore, the algorithm a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/14G06F17/16
CPCG06F17/141G06F17/16
Inventor 刘明璐
Owner RONGCHENG DINGTONG ELECTRONICS INFORMATION SCI & TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products