Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2000-09-25
2002-10-15
Williams, Howard L. (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
C708S254000
Reexamination Certificate
active
06466142
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to generation of code signals, such as pseudo-noise signals, and more particularly to a method for generating families of orthogonal and pseudo-orthogonal codes and code-modulated waveforms. The codes can be used in a variety of applications including, but not limited to, communication systems such as spread spectrum communication systems, encryption of data, pictures, and audio, and the generation of signals for radar applications.
BACKGROUND OF THE INVENTION
Pseudo-noise codes are used in various applications, including those listed above. So-called “spread spectrum” communication uses noise-like carrier waves, and a bandwidth that is much wider than conventional point-to-point communication at the same data rate. Among the advantages are: excellent noise immunity, relatively low power consumption, and reduction or elimination of the effects of multipath fading. Code division multiple access (“CDMA”) is a form of spread spectrum that has gained popular acceptance by cellular radio system operators as a technique that increases system capacity and service quality. Different users can occupy the same communication channel; this being achieved by assigning to each user a distinctive pseudo-noise code that can be recognized by the intended user but is, ideally, received as noise by the other users.
The ability to quickly generate families of pseudo-noise codes with minimal computation and cost is very advantageous for the described types of applications, but has been difficult to achieve in the prior art. Accordingly, it is among the objects of the present invention to provide a method and apparatus for efficiently generating families of pseudo-noise codes and code signals.
SUMMARY OF THE INVENTION
The present invention employs a multi-scale shuffle in the generation of orthogonal and pseudo-orthogonal codes. Interleaving operations are used that are of a type related to so-called “Finite Gelfand Pairs”.
In accordance with an embodiment of the invention, a method is provided for generating a family of pseudo-random orthogonal or pseudo-orthogonal code signals, comprising the following steps: generating a seed matrix of original dimensions; performing a plurality of expansions on the seed matrix, each successive expansion producing a next generation matrix of larger dimensions, the last of the expansions producing a final matrix; at least some of the expansions including replication and shuffling of a parent generation matrix to produce a child generation matrix; and outputting rows of the final matrix as the family of code signals.
In a preferred embodiment of the invention, the shuffling comprises a pseudo-random re-ordering of matrix column indices. In a form of this embodiment, the replication and shuffling comprises forming a child generation matrix by operations that include combining a reproduction of the parent matrix and a shuffled reproduction of the parent matrix. In another form of this embodiment, the replication and shuffling comprises forming an intermediate matrix by operations that include combining a reproduction of the parent matrix, a modified reproduction of the parent matrix, a shuffled reproduction of the parent matrix, and a modified shuffled reproduction of the parent matrix, and then shuffling the intermediate matrix to form the child matrix.
The code generation hereof has several advantages, among which are the following: (1) The codes have additive white Gaussian white noise (AWGN) statistics and present ideal noise-like auto- and cross-correlation properties. (2) The codes exhibit full non-linearity; that is, the codes are not generated with linear transformations, such as shift-register sequences or Gold-codes. This enhances their use for covert-comm applications. (3) The codes have the property of non-detectability; that is an overlayed version of the codes is non-detectable in the sense of Knuth's R4 property. (4) Flexibility is provided in the choice of the number of phases. The codes can be chosen to have any number 2·n phases to adapt to different applications, and do not have to be quantized in order to be implemented. This results in a better performance at the auto- and cross-correlation level. (5) The technique hereof provides fast generation. The complete frame of N multiscale codes of length N requires only N·log N computations, for any number of phases.
Further features and advantages of the invention will become more readily apparent from the following detailed description when taken in conjunction with the accompanying drawings.
REFERENCES:
patent: 4513288 (1985-04-01), Weathers
patent: 5311176 (1994-05-01), Gurney
patent: 5327365 (1994-07-01), Fujisaki et al.
patent: 5515307 (1996-05-01), Aiello
patent: 5541996 (1996-07-01), Ridenour
patent: 5727063 (1998-03-01), Aiello et al.
patent: 5796776 (1998-08-01), Lomp et al.
patent: 6091760 (2000-07-01), Giallorenzi et al.
patent: 6115410 (2000-09-01), Naruse
patent: 6240143 (2001-05-01), Shanbhag
Cooper & Dunham LLP
Maldonado Robert T.
Williams Howard L.
LandOfFree
Method and apparatus for generating families of code signals... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for generating families of code signals..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for generating families of code signals... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2942096