# US 2003/0212728 A1 · Method and system to perform complex number multiplications and calculations

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

- Number: US 2003/0212728 A1
- Document ID: US20030212728A1
- Status: Published application
- Kind: A1
- Application number: 10/144,538
- Filed: 2002-05-10
- Published: 2003-11-13
- Earliest claimed: 2002-05-10
- Inventors: Amit Dagan; Gad S. Sheaffer
- Web page: https://patentgrep.com/patent/US20030212728A1

## CPC

- G06F 7/4812: {Complex multiplication}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In a method and apparatus for multiplying a complex number in the form of (a+ib), (±1 ±i) the multiplication result is resolved into addition operations providing the real number component of the multiplication result and the coefficient of i in the multiplication result. The addition operations are formed in a plurality of steps, and the terms a and b are combined in each of a pair of arithmetic units in a plurality of steps to provide the real number component and the complex number coefficient. In the preferred form, the multiplication is performed in four pairs of addition, and an operation code determines the signs of each term in each arithmetic unit in each operation.

## Claims

### Claim 1

A method comprising:
accessing a value a+ib to multiply the value by (±1, ±i);
producing a first sum of a and b and a second sum of a and b, the sign of a and b in each of said first and second sums being selected in accordance with a pre-selected signal
repeating the operation and producing further pairs of sums of a and b, the sign of a and b in each sum being selected in accordance with further signals;
accumulating a result comprising each first pair comprising a real number portion of a result and each second pair comprising a co-efficient of i; and
and accumulating a result equal to (a*(±1)−b*(±1))+i(a*(±1)+b(±1)).

### Claim 2 (depends on 1)

The method according to claim 1 comprising performing said pairs of additions in accordance with four instructions.

### Claim 3 (depends on 2)

The method according to claim 2 wherein said signal commands a set of first additions comprising (b−a), (−a−b), (a+b) and (a−b) and wherein said signals command corresponding second addition result of (−a+−b), (a−b), (b−a) and (a+b).

### Claim 4 (depends on 3)

The method according to claim 3 comprising performing said additions in a dedicated register, storing a in a first location of an input buffer register and storing b to a second location of said input buffer register;
providing a and b to a first arithmetic unit performing said first addition and providing a and b to a second arithmetic unit to perform said second addition;
providing the output of said first arithmetic unit to a first location of an output buffer register and providing the output of the second arithmetic unit to a second location of the output buffer register and applying an operation code to each said arithmetic unit to determine the signs of a and b in each addition operation.

### Claim 5 (depends on 4)

The method of claim 4 further comprising selecting operation codes in sequence from an instruction register.

### Claim 6 (depends on 5)

The method of claim 5 further comprising storing said addition results in said output register after each addition to combine them with other addition results defining (a+ib)(±1 ±i).

### Claim 7 (depends on 5)

The method according to claim 5 wherein providing the input in the form of a+ib to be multiplied by (±1 ±i) comprises a calculation step in a Rake receiver complex correlation option.

### Claim 8 (depends on 1)

The method according to claim 1 comprising accessing from a register in a predetermined order operations each for multiplying by (−1 −i), (−1 +i), (1 −i) and (1 +i).

### Claim 9 (depends on 1)

The method according to claim 1 comprising providing in a predetermined order (−1 −i), (−1 +i), (1 −i) and (1 +i) as input parameters.

### Claim 10 (depends on 1)

The method according to claim 1 comprising providing both values a and b to first and second arithmetic units and setting the sign of a and b respectively in each operation with said arithmetic unit.

### Claim 11 (depends on 10)

The method according to claim 10 said arithmetic units comprise arithmetic units.

### Claim 12

A machine-readable medium that provides instructions which, when executed by a processor, causes said processor to perform operations comprising accessing a complex number in the form of a+ib to multiply by (±1, ±i)comprising selectively converting said output to the form (b−a)+i(−a−b), (−a−b)+i(a−b), (a+b)+i(b−a), or (a−b)+i(a+b).

### Claim 13 (depends on 12)

A machine-readable medium in accordance with claim 12 wherein the instructions cause said processor to perform operations comprising accessing a complex number and producing in response to one instruction a first sum of a and b to comprise a real number and a second sum of a and b to comprise a coefficient of i, the signs of a and b in each addition being set in accordance with an operation code.

### Claim 14 (depends on 12)

The machine-readable medium according to claim 12 wherein the instructions cause said processor to perform operations comprising accessing a complex number and producing in response to one instruction a first sum of a and b to comprise a real number and a second sum of a and b to comprise a coefficient of i, the signs of a and b in each addition being set in accordance with a current value of an operation to be performed.

### Claim 15 (depends on 13)

The machine-readable medium according to claim 13 wherein said signals cause said processor to perform four pairs of additions and accumulate the result of each addition.

### Claim 16 (depends on 13)

The machine-readable medium of claim 13 wherein the instructions causing performance of pairs of addition comprises loading a from a first location of an input buffer register;
loading b from a second location of the input buffer register;
adding a and b in the first arithmetic unit and providing the output of the first arithmetic unit to a first location in an output buffer register;
providing a and b to a second arithmetic unit and providing a result from said second arithmetic unit to a second location of the output buffer register, providing an operation code to the first and second registers for each pair of additions and accumulating each pair of additions from the buffer output register.

### Claim 17 (depends on 16)

A machine-readable medium according to claim 16 wherein the instructions cause said processor to multiply a and b by in a predetermined order by (−1 −i), (−1 +i), (1 −i) and (1 +i).

### Claim 18 (depends on 17)

The machine-readable medium according to claim 17 wherein the instructions provide a and b to first and second arithmetic units for operations thereon.

### Claim 19 (depends on 16)

The machine-readable medium according to claim 16 wherein multiplying a+b by (±1 ±i) comprises a step in a complex correlation operation Rake receiver algorithm.

### Claim 20 (depends on 15)

The machine-readable medium according to claim 15 comprising an instruction of providing complex number results to an output register for providing an output to an algorithm utilizing the results of the multiplication.

### Claim 21

A computer system comprising:
a main memory comprising a program for performance of a routine including multiplication of complex numbers by (±1 ±i) and an execution unit, said memory interacting with said execution unit,
said execution unit comprising a dedicated register, said dedicated register including a complex number buffer register accessing a complex number of the form a+ib and storing a in a first location of an input buffer register and storing b in a second location of said input buffer register;
first and second arithmetic units and an output buffer register;
said first arithmetic unit being coupled to receive a and b from said input buffer register and providing an output to a first location of said second buffer register, said second arithmetic unit being coupled to said second location of the input buffer register and providing an output to a second location of said output buffer register;
an instruction register providing operation codes to said first and second arithmetic units, said operation codes determining the signs of a and b provided by first and second arithmetic units to said first and second locations of said output buffer register respectively.

### Claim 22 (depends on 21)

The computer system according to claim 21 further comprising a register for providing in sequence to said first and second arithmetic units operation codes to provide the set of outputs and said first arithmetic unit comprising (b−a), (−a−b), (a+b) and (a−b) and said second arithmetic unit result of (−a−b), (a−b), (b−a) and (a+b), said output buffer means providing values from each pair of multiplication to memory.

### Claim 23 (depends on 21)

The computer system of claim 21 wherein the routing comprises in said memory comprises a Rake receiver complex correlation operation routine.

### Claim 24 (depends on 22)

The computer system according to claim 22 wherein said operation code register stores four operation codes.

### Claim 25

A computer system comprising:
a main memory comprising a program for performance of a routine including multiplication of complex numbers by (±1 ±i),
an execution unit to perform said multiplication of complex numbers,
said execution unit comprising first and second arithmetic units being coupled to receive values a and b where a and b are coefficients of a complex number in the form a+ib;
a register to provide signals to multiply a and b in a predetermined order in each of a plurality of operations by (−1 −i), (−1 +i), (1 −i) and (1 +i); and
a register accumulating a result of the form a*(±1)−b*(±1))+i(a*(±1)+b*(±1)).

### Claim 26 (depends on 25)

A computer system according to claim 25 wherein said register comprises a dedicated register including a complex number input buffer register accessing a complex number of the form a+ib and storing a in a first location of said input buffer register and storing b in a second location of said input buffer register;
said first and second arithmetic units and an output buffer register;
said first arithmetic unit being coupled to receive a and b from said input buffer register and providing an output to a first location of said second buffer register, said second arithmetic unit being coupled to said second location of the input buffer register and providing an output to a second location of said output buffer register;
and wherein said instruction register is to provide operation codes to said first and second arithmetic units, said operation codes determining the signs of a and b provided by first and second arithmetic units to said first and second locations of said output buffer register respectively.

### Claim 27 (depends on 26)

The computer system of claim 26 wherein the routine in said memory comprises a Rake receiver complex correlation operation routine.
