Novel spread spectrum codec apparatus and method

• US 5,081,645 A
• Filed: 08/06/1990
• Issued: 01/14/1992
• Est. Priority Date: 08/06/1990
• Status: Expired due to Term

• Current Assignee: Aware Incorporated (Crowley Holdings Preferred LLC)
• Original Assignee: Aware Incorporated (Crowley Holdings Preferred LLC)
• Inventors: Gopinath, Ramesh A., Pollen, David, Resnikoff, Howard L., Lawton, Wayne M.
• Primary Examiner(s): Gregory, Bernarr E.
• Application Number:
  US07/563,275
• Time in Patent Office: 526 Days
• Field of Search: 370/19, 370/21, 370/22, 375/62, 375/67, 375/68, 375/80, 375/82, 375/83, 375/88, 375/94
• US Class Current: 375/146
• CPC Class Codes: H04B 1/707 using direct sequence modulation
• CPC Class Codes: H04J 13/10 Code generation
• CPC Class Codes: H04J 2013/0037 Multilevel codes
• CPC Class Codes: H04L 27/0004 using wavelets

Abstract

A system comprising apparatuses and methods for encoding and decoding spread spectrum signals is disclosed. Signals are encoded by modulating numerical sequences selected from an orthonormal basis of numerical sequences to provide channel coding. The modulated sequences are then combined to form an encoded signal. Because of the orthonormal character of the sequences, the encoded signal may be easily decoded using a matched filter. A method for generating long sequences from the product of shorter sequences is also disclosed.

Claims

1. A spread spectrum encoding apparatus for generating a code sequence comprising an ordered sequence of values from an ordered sequence of symbols, said encoding apparatus comprising:

means for receiving an input signal comprising predetermined number of symbols from said ordered sequence of symbols;

memory means for storing at least a portion of a first spread spectrum basis having a multiplier μ

comprising one or more channel sequences, the m^th said channel sequence comprising an array of numerical values w_p, where p runs from 0 to L-1, wherein each said channel sequence being of length L, the number of said stored channel sequences being less than or equal to μ

, wherein ##EQU6## where (*) denotes complex conjugation, E is a constant, μ

is a positive integer, and the sum is performed over all values of p for which w_p (i) and w_p+μ

q (j) are non-zero;

clock means for generating a sequence of timing signals;

control means connected to said memory means and said receiving means for generating a sum array comprising an ordered array of numerical values β

(k), for k=0 to (L-1), said control means comprising means for selecting a said channel sequence corresponding to each of said predetermined number of symbols, for multiplying said selected channel sequence by a numerical value depending on said corresponding received symbol, and for adding corresponding values of said multiplied channel sequences to form said ordered array β

(k);

means for storing a spread spectrum array comprising an ordered array of numerical values α

(k) for k=0 to L-1;

means connected to control means and said spread spectrum array storing means for combining said sum array with said spread spectrum array comprising means for adding β

(k) to α

(k), said combining means being responsive to said clock means having generated μ

q said timing signals, where q is a positive integer; and

shifting means for outputting α

(L-1) as the next value in said generated code sequence, for replacing α

(k) by α

(k-1) for k=1 to (L-1), and for replacing α

(0) by 0, said shifting means being connected to said spread spectrum array storing means and being responsive to said clock means having generated a said timing signal.

2. The spread spectrum encoding apparatus of claim 1 wherein said channel sequence selected by said control means depends on the order of receipt of said received symbol.

3. The spread spectrum encoding apparatus of claim 1 wherein said means for multiplying said selected channel sequence by a numerical value in said control means comprises means for multiplying said channel sequence by a numerical value depending on a said received symbol.

4. The spread spectrum encoding apparatus of claim 1 wherein said memory means further comprises means for storing a second spread spectrum basis having a multiplier of μ

, and wherein said control means further comprises means for generating a third spread spectrum basis comprising the Pollen product of said first and second spread spectrum bases.

5. The spread spectrum encoding apparatus of claim 1 wherein said numerical values comprising said first spread spectrum basis are dyadic rational numbers.

6. A spread spectrum decoding apparatus for decoding a spread spectrum encoded input signal to generate a decoded signal, said apparatus comprising:

means for receiving said input signal;

clock means for generating a sequence of timing signals;

means connected to said receiving means and said clock means for generating an ordered sequence of numerical values from said input signal and for storing the previously generated L said numerical values, said generating means being responsive to said timing signals;

memory means for storing at least a portion of a first spread spectrum basis having a multiplier μ

comprising one or more channel sequences, the m^th said channel sequence comprising an array of numerical values w_p where p runs from 0 to L-1, wherein each said channel sequence is of length L, the number of said stored channel sequences being less than or equal to μ

, wherein ##EQU7## where (*) denotes complex conjugation, E is a constant, μ

is a positive integer, and the sum is performed over all values of p for which w_p (i) and w_p+μ

q (j) are non-zero;

correlation means connected to said memory means and said generating means for generating a signal related to the cross-correlation of said previously generated L said numerical values and a said channel sequence stored in said memory means, said correlation means being responsive to said clock means having generated qμ

said timing signals wherein q is a predetermined positive integer; and

means connected to said correlation means for outputting a value representing said decoded signal, said value being related to said generated signal generated by said correlation means.

7. The spread spectrum decoding apparatus of claim 6 wherein said memory means further comprises means for storing a second spread spectrum basis having a multiplier of μ

, and wherein said spread spectrum decoding means further comprises control means for generating a third spread spectrum basis comprising the Pollen product of first and second spread spectrum bases.

8. The spread spectrum decoding apparatus of claim 6 wherein said numerical values comprising said first spread spectrum basis are dyadic rational numbers.

9. The spread spectrum decoding apparatus of claim 6 further comprising delay means for between said receiving means and said generating means for introducing a variable delay between the receipt of said input signal and the generation of said ordered sequence of numerical values.

10. A method for encoding a spread spectrum signal comprising the steps:

receiving an input signal comprising an ordered sequence of symbols;

storing at least a portion of a first spread spectrum basis having a multiplier μ

comprising one or more channel sequences, the m^th said channel sequence comprising an array of numerical values w_p where p runs from 0 to L-1, wherein each said channel sequence is of length L, the number of said stored channel sequences being less than or equal to μ

, wherein ##EQU8## where (*) denotes complex conjugation, E is a constant, μ

is a positive integer, and the sum is performed over all values of p for which w_p (i) and w_p+μ

q (j) are non-zero;

generating a sequence of timing signals;

generating a sum array comprising an ordered array of numerical values β

(k), for k=0 to (L-1), said control means comprising means for selecting a said channel sequence corresponding to each of said predetermined number of symbols, for multiplying said selected channel sequence by a numerical value depending on said corresponding received symbol, and for adding corresponding values of said multiplied channel sequences to form said ordered array β

(k);

storing a spread spectrum array comprising an ordered array of numerical values α

(k) for k=0 to L-1;

combining said sum array with said spread spectrum array comprising means for adding β

(k) to α

(k), said combining means being responsive to said clock means having generated μ

q said timing signals, where q is a positive integer; and

at each timing signal, outputting α

(L-1) as the next value in said generated code sequence, for replacing α

(k) by α

(k-1) for k=1 to (L-1), and for replacing α

(0) by 0.

11. The method of claim 10 wherein said selected channel depends on the order of receipt of said received symbol.

12. The method of claim 10 wherein said the step of multiplying said selected channel sequence by a numerical value comprises multiplying said channel sequence by a numerical value depending on a said received symbol.

13. The method of claim 10 wherein said a second spread spectrum basis having a multiplier of μ

is also stored, and wherein a third spread spectrum basis is generated by the Pollen product of said first and second spread spectrum bases.

14. The method of claim 10 wherein said numerical values comprising said first spread spectrum basis are dyadic rational numbers.