# US 2003/0212722 A1 · Architecture for performing fast fourier-type transforms

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0212722 A1
- Document ID: US20030212722A1
- Status: Published application
- Kind: A1
- Application number: 10/211,651
- Filed: 2002-08-02
- Published: 2003-11-13
- Earliest claimed: 2002-05-07
- Assignees: Infineon Technologies AG
- Inventors: Raj Kumar Jain; Seo How Low
- Web page: https://patentgrep.com/patent/US20030212722A1

## CPC

- G06F 17/142: {Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A processor for performing fast Fourier-type transform operations is disclosed. At least one multiplier and a plurality of adders are provided to perform butterfly operations comprising three multiply operations and a plurality of add operations. Internal wordlengths are wider than wordlengths of input values to reduce rounding error.

## Claims

### Claim 1

A processor for performing fast Fourier-type transform operations, the processor comprising:
a memory unit for storing first and second real and imaginary input values, and modified first and second real and imaginary input values;
a computation unit coupled to the memory unit, said computation unit comprising a datapath unit, said datapath unit comprising at least one multiplier and a plurality of adders for performing butterfly operations on said first and second input values to generate modified first and second input values, said butterfly operation comprising three multiply operations and a plurality of add operations; and
intermediate registers in said computation unit for storing intermediate results, said intermediate results having wordlengths wider than wordlengths of said first and second input values for reducing rounding error.

### Claim 2 (depends on 1)

The processor of claim 1 wherein the computation unit comprises a saturation detection and rounding unit.

### Claim 3 (depends on 2)

The processor of claim 2 wherein said saturation detection and rounding unit limits the intermediate results when saturation is detected.

### Claim 4 (depends on 2)

The processor of claim 2 wherein said saturation detection and rounding unit rounds off the intermediate results when saturation is detected.

### Claim 5 (depends on 4)

The processor of claim 4 wherein the number of rounding operations is preset.

### Claim 6 (depends on 1)

The processor of claim 1 wherein the computation unit comprises an internal buffer for storing intermediate results.

### Claim 7 (depends on 1)

The processor of claim 1 wherein the memory unit comprises input buffers and output buffers.

### Claim 8

A processor for performing fast Fourier-type transform operations, the processor comprising:
first registers for storing first real and imaginary input values;
second registers for storing second real and imaginary input values;
a datapath unit, said datapath unit performs butterfly operations on said first registers and said second registers a prescribed number of times, generating modified first real and imaginary input values and modified second real and imaginary input values, said butterfly operation comprising three multiply operations and a plurality of add operations, said datapath unit comprising at least one multiplier and a plurality of adders; and
intermediate registers for storing intermediate results, said intermediate results having wordlengths wider than wordlengths of said first and second input values for reducing rounding error.
