U.S. patent number RE37,802 [Application Number 09/151,604] was granted by the patent office on 2002-07-23 for multicode direct sequence spread spectrum.
This patent grant is currently assigned to Wi-LAN Inc.. Invention is credited to Michel T. Fattouche, Hatim Zaghloul.
United States Patent |
RE37,802 |
Fattouche , et al. |
July 23, 2002 |
**Please see images for:
( Certificate of Correction ) ( Reexamination Certificate
) ** |
Multicode direct sequence spread spectrum
Abstract
In this patent, we present MultiCode Direct Sequence Spread
Spectrum (MC-DSSS) which is a modulation scheme that assigns up to
N DSSS codes to an individual user where N is the number of chips
per DSSS code. When viewed as DSSS, MC-DSSS requires up to N
correlators (or equivalently up to N Matched Filters) at the
receiver with a complexity of the order of N.sup.2 operations. In
addition, a non ideal communication channel can cause InterCode
Interference (ICI), i.e., interference between the N DSSS codes. In
this patent, we introduce new DSSS codes, which we refer to as the
"MC" codes. Such codes allow the information in a MC-DSSS signal to
be decoded in a sequence of low complexity parallel operations
which reduce the ICI. In addition to low complexity decoding and
reduced ICI. MC-DSSS using the MC codes has the following
advantages: (1) it does not require the stringent synchronization
DSSS requires, (2) it does not require the stringent carrier
recovery DSSS requires and (3) it is spectrally efficient.
Inventors: |
Fattouche; Michel T. (Calgary,
CA), Zaghloul; Hatim (Calgary, CA) |
Assignee: |
Wi-LAN Inc. (Calgary,
CA)
|
Family
ID: |
26882408 |
Appl.
No.: |
09/151,604 |
Filed: |
September 10, 1998 |
Related U.S. Patent Documents
|
|
|
|
|
|
|
Application
Number |
Filing Date |
Patent Number |
Issue Date |
|
Reissue of: |
186784 |
Jan 24, 1994 |
05555268 |
Sep 10, 1996 |
|
|
Current U.S.
Class: |
375/141; 370/209;
375/219; 380/34 |
Current CPC
Class: |
H04B
1/707 (20130101); H04J 11/00 (20130101); H04J
13/0077 (20130101); H04L 5/026 (20130101); H04L
27/2602 (20130101); H04L 27/2628 (20130101); H04L
27/265 (20130101); H04B 1/709 (20130101); H04B
2201/70703 (20130101) |
Current International
Class: |
H04L
27/26 (20060101); H04L 5/02 (20060101); H04B
1/707 (20060101); H04J 13/00 (20060101); H04B
001/707 (); H04B 001/69 () |
Field of
Search: |
;375/200,201,202,203,204,206,207,208,209,210,130-153,271,279,280,322,329,332
;380/34,46 ;370/203,204,205,206,207,208,209,210,211
;364/717.01,717.02,717.03,717.04,717.05,717.06,717.07 ;331/78
;714/746,752,778,781,782 |
References Cited
[Referenced By]
U.S. Patent Documents
Foreign Patent Documents
|
|
|
|
|
|
|
1 203 576 |
|
Aug 1977 |
|
CA |
|
0 562 868 |
|
Sep 1993 |
|
EP |
|
0 567 771 |
|
Nov 1993 |
|
EP |
|
2 146 875 |
|
Apr 1985 |
|
GB |
|
Other References
Jinkang Zhu, Hongbin Zhang, Yucong Gu, Principle and Performance of
Variable Rate Multi-code CDMA Method, 1995 Fourth IEEE
International Conference on Universal Personal Communications.
Record. Gateway to the 21st Century (Cat. No. 95TH8128). IEEE, pp.
256-259, New York, NY, USA, 1995. .
Proakis, J.G., Digital Communication, 2d ed., 1991, Chap. 8,
"Spread Spectrum Signals for Digital Communications," pp. 800-891.
.
Gledhill, J.J., et al., "The Transmission of Digital Television In
The UHF Band Using Orthogonal Frequency Division Multiplexing," pp.
175-180, No Date. .
Duch, Krzysztof M., "Baseband Signal Processing," Network Magazine,
pp. 39-43; Nov. 1991. .
Ananasso, Fulvio, et al., "Clock Synchronous Multicarrier
Demodulator For Multi-Frequency TDMA Communication Satellites," pp.
1059-1063; 1990. .
Saito, Masafumi, et al., "A Digital Modulation Method For
Terrestrial Digital TV Broadcasting Using Trellis Coded OFDM And
Its Performance," pp. 1694-1698; Globecom '92 Conference; 1992.
.
Alard, M., et al., "A New System Of Sound Broadcasting To Mobile
Receivers," pp. 416-420; 1988. .
Chow, Jacky S., et al., "A Discrete Multitone Tranceiver System for
HDSL Applications," pp. 895-908; "IEEE Journal on Selected Areas In
Communications"; Aug. 1991. .
Chow, Peter S., et al., "Performance Evaluation of a Multichannel
Transceiver System for ADSL and VHDSL Services," pp. 909-919; IEEE
Journal on Selected Areas in Communications; Aug. 1991. .
Pupolin, Silvano, et al., "Performance Analysis Of Digital Radio
Links With Nonlinear Transmit Amplifier And Data Predistorter With
Memory," pp. 9.6.1-9.6.5; 1989. .
Bingham, J.A.C.; "Multicarrier Modulation for Data Transmission: An
Idea Whose Time Has Come", IEEE Communications Magazine, pp. 5-14,
May 1990. .
Spracklen, C.T. and C. Smythe, "The Application of Code Division
Multiplexing Techniques to Local Area Networks," pp. 767-770, May
1987. .
Scott L. Miller and Weerakhan Tantiphaiboontana, Code Division
Multiplexing--Efficient Modulation for High Data Rate Transmission
Over Wireless Channels, Proceedings of 2000 IEEE International
Conference on Communications, pp. 1487-1491. .
Shigenobu Sasaki, Jinkang Zhu, and Gen Marubayashi, Performance of
Parallel Combinatory Spread Spectrum Multiple Access Communication
Systems, Proceedings of 1991 IEEE International Symposium on
Personal, Indoor and Mobile Radio Communications (PIMRC), pp.
204-208. .
Jinkang Zhu and Gen Marubayashi, Properties and Application of
Parallel Combinatory SS Communication System, IEEE Second
International Symposium on Spread Spectrum Techniques and
Applications (ISSSTA '92), Yokohama, Japan, pp. 227-230, Nov.
29-Dec. 2, 1992. .
K. Ben Letaief, J. C-I Chuang, and R.D. Murch, Multicode High-Speed
Transmission for Wireless Mobile Communications, Proceedings of the
1995 IEEE Global Telecommunications Conference GLOBEOM'95,
Singapore, pp. 1835-1839, Nov. 14-16, 1995. .
Reduction of Multipath Fading Effects in Single Variable
Modulations, M.A. Poletti and R.G. Vaughan, ISSPA 90 Signal
Processing Theories, Implementations and Applications, Gold Coast,
Australia Aug. 27-31, 1990, 672-676. .
OFDM for Data Communication over Mobile Radio FM Channels; Part I:
Analysis and Experimental Results, E.F. Casas and C. Leung, IEEE
Transactions on Communications, vol. 39, No. 5, May 1991. .
OFDM for Data Communication over Mobile Radio FM Radio Channels;
Part II: Performance Improvement, E.F. Casas and C. Leung, Dept. of
Electrical Engineering, University of British Columbia, Vancouver,
BC, Canada, 1991. .
Performance of an RCPC-Coded OFDM-Based Digital Audio Broadcasting
(DAB) System, P. Hoeher, J. Hagenauer, E. Offer, Ch. Rapp, H.
Schulze, Globecom '91, CH 2980-1/91/0000-0040, pp. 0040-0046. .
The Multitone Channel, Irving Kalet, IEEE Transactions on
Communications, vol. 37, No. 2, Feb. 1989. .
Optimized Decision Feedback Equalization Versus Optimized
Orthogonal Frequency Division Multiplexing for High-Speed Data
Transmission Over the Local Cable Network, Nikolaos A. Zervos and
Irving Kalet, CH2655-9/89/0000-1989 IEEE, pp. 1080-1085. .
Advanced Groupband Data Modem Using Orthogonally Multiplexed QAM
Technique, Botaro Hirosaki, Satoshi Hasegawa and Akio Sabato, IEEE
Transactions on Communications, vol. Com-34, No. 6, Jun. 1996, pp.
587-592. .
A 19.2 kbps Voiceband Data Modem Based on Orthogonally Multiplexed
QAM Techniques, B. Hirosaki, A. Yoshida, O. Tanaka, S. Hasegawa, K.
Inoue and K. Watanabe, CH2175-8/85/0000-0661 IEEE, pp. 661-665.
.
Analysis and Stimulation of a Digital Mobile Channel Using
Orthogonal Frequency Division Multiplexing, Leonard J. Cimini, Jr.,
IEEE Transactions on Communications, vol. Comm-33, No. 7, Jul.
1985, pp. 665-675. .
An Orthogonally Multiplexed QAM System Using the Discrete Fourier
Transform, Botaro Hirosaki, IEEE Transactions on Communications,
vol. Com-29, No. 7, Jul. 1981, pp. 982-989. .
An Analysis of Automatic Equalizers of Orthogonally Multiplexed QAM
Systems, Botaro Hirosaki, IEEE Transactions on Communications, vol.
Com-28, No. 1, Jan. 1980, pp. 73-83. .
An Improved Method for Digital SSB-FDM Modulation and Demodulation,
Rikio Maruta and Atsushi Tomozawa, IEEE Transactions on
Communications, vol. Com-26, No. 5, May 1978, pp. 720-725. .
Data Transmission by Frequency-Division Multiplexing Using the
Discrete Fourier Transform, S.B. Weinstein and Paul M. Ebert, IEEE
Transactions on Communications, vol. Com-19, No. 5, Oct. 1971, pp.
628-634. .
Performance of an Efficient Parallel Data Transmission System,
Burton R. Saltzberg, IEEE Transactions on Communication Technology,
vol. Com-15, No. 6, Dec. 1967, pp. 805-811. .
A Theoretical Study of Performance of an Orthogonal Multiplexing
Data Transmission Scheme, Robert W. Chang and Richard A. Gibby,
IEEE Transactions on Communication Technology, vol. Com.-16, No. 4,
Aug. 1968, pp. 529-540. .
Synthesis of Band-Limited Orthogonal Signals for Multichannel Data
Transmission, Robert W. Chang, The Bell System Technical Journal,
Dec. 1966, pp. 1775-1796..
|
Primary Examiner: Gregory; Bernarr E.
Attorney, Agent or Firm: Christensen O'Connor Johnson
Kindness PLLC
Parent Case Text
.Iadd.This application is a REISSUE of Ser. No. 08/186,784 filed
Jan. 24, 1994 is a continuation-in-part of U.S. application Ser.
No. 07/861,725 filed Mar. 31, 1992, now U.S. Pat. No. 5,282,222,
the benefit of the filing date of which is hereby claimed under 35
U.S.C. .sctn.120..Iaddend.
Claims
We claim:
1. A transceiver for transmitting a first stream of data symbols,
the transceiver comprising: a converter for converting the first
stream of data symbols into plural sets of N data symbols each;
first computing means for operating on the plural sets of N data
symbols to produce modulated data symbols corresponding to an
invertible randomized spreading of the first stream of data
symbols; and means to combine the modulated data symbols for
transmission.
2. The transceiver of claim 1 in which the first computing means
.[.includes.]. .Iadd.comprises.Iaddend.: a source of .[.N.].
.Iadd.more than one and up to M .Iaddend.direct sequence spread
spectrum .[.code symbols.]. .Iadd.codes, where M is the number of
chips per direct sequence spread spectrum code.Iaddend.; and a
modulator to modulate each .[.ith.]. data symbol from each set of
.[.N.]. data symbols with .[.the ith.]. .Iadd.a .Iaddend.code
.[.symbol.]. from the .[.N code symbol.]. .Iadd.up to M direct
sequence spread spectrum codes .Iaddend.to generate .[.N.].
modulated data symbols, and thereby spread each .[.ith data
symbol.]. .Iadd.set of data symbols .Iaddend.over a separate code
.[.symbol.]. .
3. The transceiver of claim 2 in which the .[.code symbols.].
.Iadd.direct sequence spread spectrum codes .Iaddend.are generated
by operation of a non-trivial .[.N point.]. transform on a sequence
of input signals.
4. The transceiver of claim 1 in which the first computing means
.[.includes.]. .Iadd.comprises.Iaddend.: a transformer for
operating on each set of N data symbols to generate .[.N.].
modulated data symbols as output, the .[.N.]. modulated data
symbols corresponding to spreading of each .[.ith.]. data symbol
over a separate code .[.symbol.]. .Iadd.selected from a set of more
than one and up to M codes, where M is the number of chips per
code; and .Iaddend. .Iadd.means to combine the modulated data
symbols for transmission.Iaddend..
5. The transceiver of claim 4 in which the transformer effectively
applies a first transform selected from the group .[.comprising.].
.Iadd.consisting of .Iaddend.a Fourier transform and a Walsh
transform to the N data symbols.
6. The transceiver of claim 5 in which the first transform is a
Fourier transform and it is followed by a randomizing
transform.
7. The transceiver of claim 6 in which the first transform is a
Fourier transform and it is followed by a randomizing transform and
a second transform selected from the group .[.comprising.].
.Iadd.consisting of .Iaddend.a Fourier transform and a Walsh
transform.
8. The transceiver of claim 4 in which the transformer effectively
applies a first inverse transform selected from the group
.[.comprising.]. .Iadd.consisting of .Iaddend.a randomizer
transform, a Fourier transform and a Walsh transform to the N data
symbols, followed by a first equalizer and a second inverse
transform selected from the group .[.comprising.]. .Iadd.consisting
of .Iaddend.a Fourier transform and a Walsh transform.
9. The transceiver of claim 8 in which the second transform is
followed by a second equalizer.
10. The transceiver of claim 1 further .[.including.].
.Iadd.comprising.Iaddend.: means for receiving a sequence of
modulated data symbols, the modulated data symbols having been
generated by invertible randomized spreading of a second stream of
data symbols; .Iadd.and .Iaddend. second computing means for
operating on the sequence of modulated data symbols to produce an
estimate of the second stream of data symbols.
11. The transceiver of claim 10 further .[.including.].
.Iadd.comprising .Iaddend.means to apply diversity to the modulated
data symbols before transmission, and means to combine received
diversity signals.
12. The transceiver of claim 10 in which the second computing means
.[.includes.]. .Iadd.comprises.Iaddend.: a correlator for
correlating each .[.ith.]. modulated data symbol from the received
sequence of modulated data symbols with .[.the ith code symbol.].
.Iadd.a code .Iaddend.from .[.the.]. .Iadd.a .Iaddend.set of .[.N
code symbols.]. .Iadd.more than one and up to M codes, where M is
the number of chips per code.Iaddend.; and a detector for detecting
an estimate of the data symbols from output of the correlator.
13. The transceiver of claim 10 in which the second computing means
.[.includes.]. .Iadd.comprises .Iaddend.an inverse transformer for
regenerating an estimate of the .[.N.]. data symbols.
14. The transceiver of claim 1 further .[.including.].
.Iadd.comprising .Iaddend.a shaper for shaping the combined
modulated data symbols for transmission.
15. The transceiver of claim 1 further .[.including.].
.Iadd.comprising .Iaddend.means to apply diversity to the combined
modulated data symbols before transmission.
16. The transceiver of claim 1 in which the .[.N.]. data symbols
include a pilot frame and a number of data frames, and is preceded
by a request frame, wherein the request frame is used to wake up
receiving transceivers, synchronize reception of the .[.N.]. data
symbols and convey protocol information.
17. A transceiver for transmitting a first stream of data symbols
and receiving a second stream of data symbols, the transceiver
comprising: a converter for converting the first stream of data
symbols into plural sets of N data symbols each; first computing
means for operating on the plural sets of N data symbols to produce
sets of .[.N.]. modulated data symbols corresponding to an
invertible randomized spreading of each set of N data symbols over
.[.N code symbols.]. .Iadd.more than one and up to M direct
sequence spread spectrum codes.Iaddend.; means to combine the
modulated data symbols for transmission; means for receiving a
sequence of modulated data symbols, the modulated data symbols
having been generated by an invertible randomized spreading of a
second stream of data symbols over .[.N code symbols.]. .Iadd.more
than one and up to M direct sequence spread spectrum
codes.Iaddend.; second computing means for operating on the
sequence of modulated data symbols to produce an estimate of the
second stream of data symbols; and means to combine output from the
second computing means.
18. The transceiver of claim 17 in which the first computing means
.[.includes.]. .Iadd.comprises.Iaddend.: a source of .[.N.].
.Iadd.the .Iaddend.direct sequence spread spectrum .[.code
symbols.]. .Iadd.codes.Iaddend.; and a modulator to modulate each
.[.ith.]. data symbol from each set of N data symbols with .[.the
ith code symbol.]. .Iadd.a code .Iaddend.from the .[.N code
symbol.]. .Iadd.up to M direct sequence spread spectrum codes
.Iaddend.to generate .[.N.]. modulated data symbols, and thereby
spread each .[.ith.]. data symbol over a separate .Iadd.direct
sequence spread spectrum .Iaddend.code .[.symbol.]. .
19. The transceiver of claim 18 in which the .[.code symbols.].
.Iadd.direct sequence spread spectrum codes .Iaddend.are generated
by operation of plural non-trivial .[.N point.]. transforms on a
random sequence of input signals.
20. The transceiver of claim 17 in which the first computing means
.[.includes.]. .Iadd.comprises.Iaddend.: a transformer for
operating on each set of N data symbols to generate .[.N.].
modulated data symbols as output, the .[.N.]. modulated data
symbols corresponding to spreading of each .[.ith.]. data symbol
over a separate code .[.symbol.]. .
21. The transceiver of claim 17 in which the second computing means
.[.includes.]. .Iadd.comprises.Iaddend.: a correlator for
correlating each .[.ith.]. modulated data symbol from the received
sequence of modulated data symbols with .[.the ith code symbol.].
.Iadd.a code .Iaddend.from the .[.set of N code symbols.]. .Iadd.up
to M direct sequence spread spectrum codes.Iaddend.; and a detector
for detecting an estimate of the data symbols from the output of
the correlator.
22. The transceiver of claim 17 in which the second computing means
.[.includes.]. .Iadd.comprises .Iaddend.an inverse transformer for
regenerating an estimate of the N data symbols.
23. A method of exchanging data streams between a plurality of
transceivers, the method comprising the steps of: converting a
first stream of data symbols into plural sets of N data symbols
each; operating on the plural sets of N data symbols to produce
modulated data symbols corresponding to a spreading of the first
stream of data symbols over .[.N code symbols.]. .Iadd.more than
one and up to M direct sequence spread spectrum codes.Iaddend.;
combining the modulated data symbols for transmission; and
transmitting the modulated data symbols from a first transceiver at
a time when no other of the plurality of transceivers is
transmitting.
24. The method of claim 23 in which the spreading is an invertible
randomized spreading and operating on the plural sets of N data
symbols .[.includes.]. .Iadd.comprises .Iaddend.modulating each
.[.ith.]. data symbol from each set of N data symbols with .[.the
ith code symbol.]. .Iadd.a code .Iaddend.from the .[.N code
symbols.]. .Iadd.up to M direct sequence spread spectrum codes
.Iaddend.to generate .[.N.]. modulated data symbols, and thereby
spread each .[.ith.]. data symbol over a separate code .[.symbol.].
.
25. The method of claim 23 in which the spreading is an invertible
randomized spreading and operating on the plural sets of N data
symbols .[.includes.]. .Iadd.comprises.Iaddend.: transforming, by
application of a transform, each set of N data symbols to generate
.[.N.]. modulated data symbols as output.
26. The method of claim 25 in which transforming each set of N data
symbols .[.includes.]. .Iadd.comprises .Iaddend.applying to each
set of N data symbols a randomizing transform and a transform
selected from the group .[.comprising.]. .Iadd.consisting of
.Iaddend.a Fourier transform and a Walsh transform.
27. The method of claim 25 in which transforming each set of N data
symbols .[.includes.]. .Iadd.comprises .Iaddend.applying to each
set of N data symbols a Fourier transform, a randomizing transform
and a transform selected from the group .[.comprising.].
.Iadd.consisting of .Iaddend.a Fourier transform and a Walsh
transform.
28. The method of claim 25 in which transforming each set of N data
symbols .[.includes.]. .Iadd.comprises .Iaddend.applying to each
set of N data symbols a first transform selected from the group
.[.comprising.]. .Iadd.consisting of .Iaddend.a Fourier transform
and a Walsh transform, a randomizing transform and a second
transform selected from the group .[.comprising.]. .Iadd.consisting
of .Iaddend.a Fourier transform and a Walsh transform.
29. The method of claim 23 further .[.including.]. .Iadd.comprising
.Iaddend.the step of: receiving, at a transceiver distinct from the
first transceiver, the sequence of modulated data symbols; and
operating on the sequence of modulated data symbols to produce an
estimate of the first stream of data symbols.
30. The method of claim 29 in which operating on the sequence of
modulated data symbols .[.includes.]. .Iadd.comprises .Iaddend.the
steps of: correlating each .[.ith.]. modulated data symbol from the
received sequence of modulated data symbols with .[.the ith code
symbol from the set of N code symbols.]. .Iadd.a code from the up
to M direct sequence spread spectrum codes.Iaddend.; and detecting
an estimate of the first stream of data symbols from output of the
correlator.
31. The method of claim 23 further .[.including.]. .Iadd.comprising
the step of .Iaddend.shaping the modulated data symbols before
transmission.
32. The method of claim 23 further .[.including.]. .Iadd.comprising
the step of .Iaddend.applying diversity to the modulated data
symbols before transmission..Iadd.
33. A transceiver for transmitting a first stream of data symbols,
the transceiver comprising: a converter for converting the first
stream of data symbols into plural sets of data symbols each; first
computing means for operating on the plural sets of data symbols to
produce modulated data symbols corresponding to an invertible
randomized spreading of the first stream of data symbols over more
than one and up to M direct sequence spread spectrum codes, where
each direct sequence spread spectrum code has M chips; and means to
combine the modulated data symbols for
transmission..Iaddend..Iadd.
34. The transceiver of claim 33 further comprising: means for
receiving a sequence of modulated data symbols, the modulated data
symbols having been generated by invertible randomized spreading of
a second stream of data symbols; and second computing means for
operating on the sequence of modulated data symbols to produce an
estimate of the second stream of data symbols..Iaddend..Iadd.
35. The transceiver of claim 34 further comprising means to apply
diversity to the modulated data symbols before transmission, and
means to combine received diversity signals..Iaddend..Iadd.
36. The transceiver of claim 34 in which the second computing means
comprises: a correlator for correlating each modulated data symbol
from the received sequence of modulated data symbols with a code
from the set of up to M direct sequence spread spectrum codes; and
a detector for detecting an estimate of the data symbols from
output of the correlator..Iaddend..Iadd.
37. The transceiver of claim 34 in which the second computing means
comprises an inverse transformer for regenerating an estimate of
the data symbols..Iaddend..Iadd.
38. The transceiver of claim 33 further comprising a shaper for
shaping the combined modulated data symbols for
transmission..Iaddend..Iadd.
39. The transceiver of claim 33 further comprising means to apply
diversity to the combined modulated data symbols before
transmission..Iaddend..Iadd.
40. The transceiver of claim 33 in which the data symbols include a
pilot frame and a number of data frames, and is preceded by a
request frame, wherein the request frame is used to wake up
receiving transceivers, synchronize reception of the data symbols
and convey protocol information..Iaddend.
Description
FIELD OF THE INVENTION
The invention deals with the field of multiple access
communications using Spread Spectrum modulation. Multiple access
can be classified as either random access, polling, TDMA, FDMA,
CDMA or any combination thereof. Spread Spectrum can be classified
as Direct Sequence, Frequency-Hopping or a combination of the
two.
BACKGROUND OF THE INVENTION
Commonly used spread spectrum techniques are Direct Sequence Spread
Spectrum (DSSS) and Code Division Multiple Access (CDMA) as
explained in Chapter 8 of "Digital Communication" by J. G. Proakis,
Second Edition, 1991, McGraw Hill, DSSS is a communication scheme
in which information bits are spread over code bits (generally
called chips). It is customary to use noise-like codes called
pseudo random noise (PN) sequences. These PN sequences have the
property that their auto-correlation is almost a delta function and
their cross-correlation with other codes is almost null. The
advantages of this information spreading are: 1. The transmitted
signal can be buried in noise and thus has a low probability of
intercept. 2. The receiver can recover the signal from interferers
(such as other transmitted codes) with a jamming margin that is
proportional to the spreading code length. 3. DSSS codes of
duration longer than the delay spread of the propagation channel
can lead to multipath diversity implementable using a Rake
receiver. 4. The FCC and the DOC have allowed the use of unlicensed
low power DSSS systems of code lengths greater than or equal to 10
in some frequency bands (the ISM bands).
It is the last advantage (i.e., advantage 4. above) that has given
much interest recently to DSSS.
An obvious limitation of DSSS systems is the limited throughput
they can offer. In any given bandwidth, B, a code of length N will
reduce the effective bandwidth to B/N. To increase the overall
bandwidth efficiency, system designers introduced Code Division
Multiple Access (CDMA) where multiple DSSS communication links can
be established simultaneously over the same frequency band provided
each link uses a unique code that is noise-like. CDMA problems are:
1. The near-far problem: a transmitter "near" the receiver sending
a different code than the receiver's desired code produces in the
receiver a signal comparable with that of a "far" transmitter
sending the desired code. 2. Synchronization of the receiver and
the transmitter is complex (especially) if the receiver does not
know in advance which code is being transmitted.
SUMMARY OF THE INVENTION
We have recognized that low power DSSS systems complying with the
FCC and the DOC regulations for the ISM bands would be ideal
communicators provided the problems of CDMA could be resolved and
the throughput could be enhanced. To enhance the throughput, we
allow a single link (i.e., a single transceiver) to use more than
one code at the same time. To avoid the near-far problem only one
transceiver transmits at a time. In this patent, we present
Multi-Code Direct Sequence Spread Spectrum (MC-DSSS) which is a
modulation scheme that assigns up to N codes to an individual
transceiver where N is the number of chips per DSSS code. When
viewed as DSSS, MC-DSSS requires up to N correlators (or
equivalently up to N Matched Filters) at the receiver with a
complexity of the order of N.sup.2 operations. When N is large,
this complexity is prohibitive. In addition, a nonideal
communication channel can cause InterCode Interference (ICI), i.e.,
interference between the N DSSS codes at the receiver. In this
patent, we introduce new codes, which we refer to as "MC" codes.
Such codes allow the information in a MC-DSSS signal to be decoded
in a sequence of low complexity parallel operations while reducing
the ICI. In addition to low complexity decoding and ICI reduction,
our implementation of MC-DSSS using the MC codes has the following
advantages: 1. It does not require the stringent synchronization
DSSS requires. Conventional DSSS systems requires synchronization
to within a fraction of a chip whereas MC-DSSS using the MC codes
requires synchronization to within two chips. 2. It does not
require the stringent carrier recovery DSSS requires. Conventional
DSSS requires the carrier at the receiver to be phase locked to the
received signal whereas MC-DSSS using the MC codes does not require
phase locking the carriers. Commercially available crystals have
sufficient stability for MC-DSSS. 3. It is spectrally
efficient.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic showing for the Baseband Transmitter for the
xth MC-DSSS frame: d(k)=[d(1,x) d(2,x) . . . d(N,k)] where
c(i)=[c(1,i) c(2,i)] is the ith code and Sym(k)=[sym(1,k) sym(N,k)]
is the kth information-bearing vector containing N symbols.
FIG. 2 is a schematic showing a Baseband Receiver for the kth
received MC-DSSS frame: d'(k)=[d'(1,k) d'(2,k) . . . d'(N,k)] where
c(i)=[c(1,i) c(2,i) . . . c(N,i)] is the ith code, Sym(k)=[sym(1,k)
sym(2,k) . . . sym(N,k)] is the estimate of the Kth
information-bearing vector Sym(k) and ##STR1##
FIG. 3 is a schematic showing of the ith MC code c(i)=[c(i,1)
c(i,2) . . . c(i,NO) where i can take one of the N values: 1,2, . .
. N corresponding to the position of the single `1` at the input of
the first N-point transform.
FIG. 4 is a schematic showing the alternate transmitter for the kth
MC-DSSS frame: d(k)=[d(1,k), d(2,k) . . . d(N,k)] using the MC
codes generated in FIG. 3 where Sym(k)=[Sym(1,k)Sym(2k) . . .
Sym(N,k)] is the kth information-bearing vector contacting N
symbols.
FIG. 5 is the alternate receiver for the kth received MC-DSSS frame
d'(k)=[d'(1k)d'(2,K) . . .d'(N,k)] using MC codes generated in FIG.
3 where Sym(k)=[sym(1,k) sym(2k) . . . sym(N,k)] is the estimate of
the information-bearing vetor Sym(k).
FIG. 6 is a schematic showing the Baseband Transmitter of the kth
Data Frame X(k) where Sym(N)=[sym(1,k) sym(2,k) . . . sym(N,k)] is
the kth information-bearing vector d(k)=[c(1,k) d(2,k) . . .
d(N,k)] is the kth MC-DSSS frame v(k)=[v(1,k) v(2,k) . . .
v((1+.beta.)MN,k)], .beta..epsilon.(0,1), M=1,2,3 . . . and
X(k)=[x(1k) x(2,k)], Z=Z=1, 2, 3, . . . .
FIG. 7 is a schematic showing the Baseband Receiver for the kth
received Data Frame X'(k) where Sym(N)=[sym(1,k)] sym(2,k) . . .
sym(N,k)] is the estimate of the kth information-bearing vector
d'(k)=[d'(1,k) d'(2k) . . . d'(N,k)] is the kth received MC-DSSS
frame v'(k)=[v'(1,k) v(2k) . . . v'((1+.beta.) MN,k)],
B.epsilon.(0,1), M=1,2,3, . . . and X'(k)=[x'(1,k) x'(2,k) . . .
r'(Z,k)], Z=1,2,3 . . . .
FIG. 8 is a schematic showing the Randomizer Transform (RT) where a
(1) a (2) . . . a (N) are complex constants chosen randomly.
FIG. 9 is a schematic showing the Permutation Transform (PT).
FIG. 10 is a schematic showing (a) the shaping of a MC-DSSS frame
and (b) the unshaping of a MC-DSSS frame where d(k)=[d(1,k) d(2,k)
. . . d(N,k)] is the kth MC-DSSS frame g(k)=[g(1,k) g(2k) . . .
g(MN,k)], M=1,2,3, . . . , v(k)=[v(1,k) v(2,k) . . . v((1+.beta.)
MN,k)], B.epsilon.(0,1) d'(k)=[d(1,k) d(2,k) . . . d(N,K)] is the
kth received MC-DSSS frame g'(k)=[g'(1,k) g'(2,k) . . . g'(M'N,k)]
and v'(k)=[v(1,k) v'(2,k) . . . v'((1+.beta.) M'N,k)], M'=1,2,3, .
. . .
FIG. 11 is a schematic showing (a) Description of the alias/window
operation (b) Description of dealias/dewindow operation, where 1/T
is the symbol rate.
FIG. 12 is a schematic showing the frame structure for data
transmission from source (Node A) to destination (Node B).
FIG. 13 is a schematic showing the baseband transmitter for one
request frame v where c=[c(1) c(2) . . . c(1)] is the DSSS code,
v=[v(1) v(2) . . . v((1+.beta.)MI)], .beta..epsilon.(0,1), M=1,2, .
. . and I is the length of the DSSS code.
FIG. 14 is a schematic showing the baseband receiver for the
received request frame where c=[c(1) c(2) . . . c(1)] is the DSSS
code for the request frame, d'=[d(1) d(2) . . . d(1)] is the
received request frame, v'=[v'(1) v'((1+.beta.) MI)],
.beta..epsilon.(0,1), M=1,2, . . . and l is the length of the DSSS
code.
FIG. 15 is a schematic showing the baseband transmitter for one
address frame where c=[c(1) c(2) . . . c(1)] is the CDMA code for
the address frame, v=[v(1) v(2) . . . v(1+.beta.) MI)],
.beta..epsilon.(0,1), M=1,2, . . . and l' is the length of the CDMA
code.
FIG. 16 is a schematic showing the baseband receiver the address
where c=[c(1) c(2) . . . c(I')] is the CDMA code for the address
frame, d'=[d(1) d(2) . . . d(I)] is the received address frame,
v'[v'(1) v'(2) . . . v'((1+.beta.) MI')], .beta..epsilon.(0,1),
M=1,2, . . . and I' is the length of the CDMA code.
FIG. 17 is a schematic showing the baseband transmitter for Ack.
Frame where c=[c(1) c(2) . . . c(I')] is the DSSS code for the Ack.
frame, v=[v(1) v(2) . . . v((I+.beta.) MI')] .beta..epsilon.(0,1),
M=1,2,3, . . . and I' is the length of the DSSS code.
FIG. 18 is a schematic showing the baseband receiver for the ack.
frame where c=[c(1) c(2) . . . c(I")] is the DSSS code for the Ack.
frame, d'=[d(1) d(2) . . . d'(I")] is the received Ack. frame,
v'=[v'(1) v(2) . . . v'(1+.beta.) MI")], .beta..epsilon.(0,1),
M=1,2, . . . and I" is the length of the DSSS code.
FIG. 19 is a schematic showing the passband transmitter for a
packet where f.sub.o is the IF frequency and f.sub.o +f.sub.c is
the RF frequency.
FIG. 20 is a schematic showing the passband receiver for a packet
where f.sub.o is the IF frequency and f.sub.o +f.sub.c is the RF
frequency.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS OF THE
INVENTION
FIG. 1 illustrates the transmitter of the MC-DSSS modulation
technique generating the kth MC-DSSS frame bearing N symbols of
information. The symbols can be either analog or digital.
A converter 10 converts a stream of data symbols into plural sets
of N data symbols each. A computing means 12 operates on the plural
sets of N data symbols to produce modulated data symbols
corresponding to an invertible randomized spreading of the stream
of data symbols. A combiner 14 combines the modulated data symbols
for transmission. The computing means shown in FIG. 1 includes a
source 16 of N direct sequence spread spectrum code symbols and a
modulator 18 to modulate each ith data symbol from each set of N
data symbols with the I code symbol from the N code symbol to
generate N modulated data symbols, and thereby spread each I data
symbol over a separate code symbol.
FIG. 2 illustrates the receiver of the MC-DSSS modulation
techniques accepting the kth MC-DSSS frame and generating estimates
for the corresponding N symbols of information. The dot product in
FIG. 2 can be implemented as a correlator. The detector can make
either hard decisions or soft decisions.
A sequence of modulated data symbols is received at 22 in which the
sequence of modulated data symbols has been generated by the
transmitter such as is shown in FIG. 1 or 4. A second computing
means 24 operates on the sequence of modulated data symbols to
produce an estimate of the second string of data symbols. The
computing means 24 shown in FIG. 2 includes a correlator 26 for
correlating each I modulated data symbol from the received sequence
of modulated data symbols with the I code symbol from the set of N
code symbols and a detector 28 for detecting an estimate of the
data symbols from output of the correlator 26.
FIG. 3 illustrates the code generator of the MC codes. Any one of
the P N-point transforms in FIG. 3 consists of a reversible
transform to the extent of the available arithmetic precision. In
other words, with finite precision arithmetic, the transforms are
allowed to add a limited amount of irreversible error.
One can use the MC-DSSS transmitter in FIG. 1 and the MC-DSSS
receiver in FIG. 2 together with the MC codes generated using the
code generator in FIG. 3 in order to implement MC-DSSS using the MC
codes.
An alternative transmitter to the one in FIG. 1 using the MC codes
in FIG. 3 is shown in FIG. 4.
The alternative transmitter shown in FIG. 4 includes a transformer
20 for operating on each set of N data symbols to generate N
modulated data symbols as output. A series of transforms are
shown.
An alternative receiver to the one in FIG. 2 using the MC codes in
FIG. 3 is shown in FIG. 5. L pilots are required in FIG. 5 for
equalization.
Both transmitters in FIGS. 1 and 4 allow using shaper 30 in
diversity module 32 shaping and time diversity of the MC-DSSS
signal as shown in FIG. 6. We will refer to the MC-DSSS frame with
shaping and time diversity as a Data frame.
Both receivers in FIGS. 2 and 5 allow diversity combining followed
by the unshaping of the Data frame as shown in FIG. 7. A Synch. is
required in FIG. 7 for frame synchronization.
In addition to the Data frames, we need to transmit (1) all of the
L pilots used in FIG. 5 to estimate and equalize for the various
types of channel distortions, (2) the Synch. signal used in FIG. 7
for frame synchronization, and (3) depending on the access
technique employed, the source address, destination address and
number of Data frames. We will refer to the combination of all
transmitted frames as a packet.
PREFERRED EMBODIMENTS OF THE INVENTION
Examples of the N-point transforms in FIG. 3 are a Discrete Fourier
Transform (DFT), a Fast Fourier Transform (FFT), a Walsh Transform
(WT), a Hilbert Transform (HT), a Randomizer Transform (RT) as the
one illustrated in FIG. 8, a Permutator Transform (PT) as the one
illustrated in FIG. 9, an Inverse DFT (IDFT), an Inverse FFT
(IFFT), an Inverse WT (IWT), an Inverse HT (IHT), an Inverse RT
(IRT), an Inverse PT (IPT), and any other reversible transform.
When L=2 with the first N-point transform being a DFT and the
second being a RT, we have a system identical to the patent:
"Method and Apparatus for Multiple Access between Transceivers in
Wireless Communications using OFDM Spread Spectrum" by M. Fattouche
and H. Zaghloul, filed in the U.S. Pat Office in Mar. 31, 1992,
Ser. No. 07/861,725.
Preferred shaping in FIG. 6 consists of an Mth order interpolation
filter followed by an alias/window operation as shown in FIG. 10a.
The Alias/window operation is described in FIG. 11a where a
raised-cosine pulse of rolloff .beta. is applied. The interpolation
filter in FIG. 10a can be implemented as an FIR filter or as an
NM-point IDFT where the first N(M-1)/2 points and the last N(M-1)/2
points at the input of the IDFT are zero. Preferred values of M are
1,2,3 and 4.
Preferred unshaping in FIG. 7 consists of a dealias/dewindow
operation followed by a decimation filter as shown in FIG. 10b. The
dealias/dewindow operation is described in FIG. 11b.
Time Diversity in FIG. 6 can consist of repeating the MC-DSSS frame
several times. It can also consist of repeating the frame several
times then complex conjugating some of the replicas, or shifting
some of the replicas in the frequency domain in a cyclic
manner.
Diversity combining in FIG. 7 can consist of cophasing, selective
combining, Maximal Ratio combining or equal gain combining.
In FIG. 5, L pilots are used to equalize the effects of the channel
on each information-bearing data frame. The pilot frames can
consist of Data frames of known information symbols to be sent
either before, during or after the data, or of a number of samples
of known values inserted within two transformations in FIG. 4. A
preferred embodiment of the pilots is to have the first pilot
consisting of a number of frames of known information symbols. The
remaining pilots can consist of a number of known information
symbols between two transforms. The L estimators can consist of
averaging of the pilots followed by either a parametric estimation
or a nonparametric one similar to the channel estimator in the
patent: "Method and Apparatus for Multiple Access between
Transceivers in Wireless Communications using OFDM Spread Spectrum"
by M. Fattouche and H. Zaghloul, filed in the U.S. Pat Office in
Mar. 31, 1992, Ser. No. 07/861,725.
When Node A intends to transmit information to Node B, a preferred
embodiment of a packet is illustrated in FIG. 12: a Request frame
40, an Address frame, an Ack. frame, a Pilot frame 36 and a number
of Data frames 38. The Request frame is used (1) as a wake-up call
for all the receivers in the band, (2) for frame synchronization
and (3) for packet synchronization. It can consist of a DSSS signal
using one PN code repeated a number of times and ending with the
same PN code with a negative polarity. FIGS. 13 and 14 illustrate
the transmitter and the receiver for the Request frame
respectively. In FIG. 14, the dot product operation can be
implemented as a correlator with either hard or soft decision (or
equivalently as a filter matched to the PN code followed by a
sample/hold circuit). The Request frame receiver is constantly
generating a signal out of the correlator. When the signal is above
a certain threshold using the level detector, (1) a wake-up call
signal is conveyed to the portion of the receiver responsible for
the Address frame and (2) the frames are synchronized to the
wake-up call. The packet is then synchronized to the negative
differential correlation between the last two PN codes in the
Request frame using a decoder as shown in FIG. 14.
The Address frame can consist of a CDMA signal where one out of a
number of codes is used at a time. The code consists of a number of
chips that indicate the destination address, the source address
and/or the number of Data frames. FIGS. 15 and 16 illustrate the
transmitter and the receiver for the Address frame respectively.
Each receiver differentially detects the received Address frame,
then correlates the outcome with it is own code. If the output of
the correlator is above a certain threshold, the receiver instructs
its transmitter to transmit an Ack. Otherwise, the receiver returns
to its initial (idle) state.
The Ack. frame is a PN code reflecting the status of the receiver,
i.e. whether it is busy or idle. When it is busy, Node A aborts its
transmission and retries some time later. When it is idle, Node A
proceeds with transmitting the Pilot frame and the Data frames.
FIGS. 17 and 18 illustrate the transmitter and the receiver for the
Address frame respectively.
An extension to the MC-DSSS modulation technique consists of
passband modulation where the packet is up-converted from baseband
to RF in the transmitter and later down-converted from RF to
baseband in the receiver. Passband modulation can be implemented
using IF sampling which consists of implementing quadrature
modulation/demodulation in an intermediate Frequency between
baseband and RF, digitally as shown in FIGS. 19 and 20 which
illustrate the transmitter and the receiver respectively. IF
sampling trades complexity of the analog RF components (at either
the transmitter, the receiver or both) with complexity of the
digital components. Furthermore, in passband systems carrier
feed-through is often a problem implying that the transmitter has
to ensure a zero dc component. Such a component reduces the usable
bandwidth of the channel. In IF sampling the usable band of the
channel does not include dc and therefore is the dc component is
not a concern.
A further extension to the MC-DSSS modulation technique consists of
using antenna Diversity in order to improve the Signal-to-Ratio
level at the receiver. A preferred combining technique is maximal
selection combining based on the level of the Request frame at the
receiver.
* * * * *