IP Library Granted Patent US 7,613,158
Granted Patent B2
US 7,613,158 · App. 10/450,722 · Granted Nov 3, 2009

Method of quadrature spreading

Assignee: Indoaust Investments Ltd.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,613,158
App. No.
10/450,722
Granted
Nov 3, 2009
Kind
B2
Abstract

The invention provides a method of quadrature spreading suited for use in a software implementation of a code division multiple access communication (CDMA) system. The method includes providing for a bit of short code, adding a bit of each of N data channels together to obtain a combined channel value (X in ), and performing a spreading operation to obtain a spread channel value.

Claims (67)

1. A method of quadrature spreading by an M bit processor in a code division multiple access communication (CDMA) system, the method comprising:

adding a bit of each of N data channels together to obtain a combined channel value represented by K bits where K is the smallest number of bits which is required to represent N in binary and which is a factor of M;

packing S combined channel values into an M bit combined channel data element, where S×K=M;

extending M/N bits of short code to M bits by repeating each bit of short code N times to produce an extended short code; and

XORing the combined channel data element with the extended short code to obtain an N channel M bit spread channel value, wherein the XORing comprises a spreading operation:

X

out

=

{

X

in

if

the

bit

of

short

code

=

0

N

-

X

in

if

the

bit

of

short

code

=

1

and wherein said spreading operation is performed by:

providing constant data having M bits in which a binary sequence representing the number of channels N is repeated S times;

performing a first manipulation of said combined channel data by logically AND-ing said combined channel data with said short code data to thereby obtain first manipulated combined channel data;

performing a second manipulation of said combined channel data by (a) subtracting said combined channel data from said constant data to obtain first intermediate data and (b) logically AND-ing said intermediate data with the inverse of said short code data to thereby obtain second manipulated combined channel data;

logically OR-ing said first and second manipulated combined channel data; and subtracting said logically OR-ed first and second manipulated combined channel data from said constant data to obtain said spread channel data.

2. A method as claimed in claim 1 , wherein said spreading operation is performed by:

providing constant data having M bits in which a binary sequence representing the number of channels N is repeated S times;

performing a first manipulation of said combined channel data by logically AND-ing said combined channel data with the inverse of said short code data to thereby obtain first manipulated combined channel data;

performing a second manipulation of said combined channel data by (a) subtracting said combined channel data from said constant data to obtain intermediate data, and (b) logically AND-ing said intermediate data with said short code data to thereby obtain second manipulated combined channel data, and

logically OR-ing said first and second manipulated combined channel data to obtain said spread channel data.

3. A method as claimed in claim 1 wherein N is 4.

4. A method as claimed in claim 1 wherein M is the native number of bits of a processor used to carry out a method.

5. A method as claimed in claim 4 where M is 32.

6. A processor programmed to carry out the method of claim 1 .

7. A program which when executed by a processor will cause said processor to carry out the method of claim 1 .

8. A program which when executed by a 32-bit digital signal processor will cause said 32-bit digital signal processor to carry out the method of claim 1 wherein M=32.

Assignments (4)
CHANGE OF NAME Recorded Jun 4, 2014
From: INDOAUST INVESTMENTS LTD
To: CELLOS SOFTWARE LTD
Reel/Frame 033027/0403 →
CHANGE OF NAME Recorded Apr 9, 2009
From: INDOAUST INVESTMENTS PTY LTD
To: INDOAUST INVESTMENTS LTD
Reel/Frame 022528/0582 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 14, 2007
From: ADVANCED COMMUNICATIONS TECHNOLOGIES (AUSTRALIA) PTY LTD
To: INDOAUST INVESTMENTS PTY LTD
Reel/Frame 018906/0114 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 17, 2003
From: LADYZHENSKII, RUDOLF
To: ADVANCED COMMUNICATIONS TECHNOLOGIES (AUSTRALIA) PTY LTD
Reel/Frame 014697/0474 →
Priority Claims (1)
AU PR2063 · Dec 13, 2000 · national
Continuity (1)
Related Publication 20040091020A1 · May 13, 2004