Bi-orthogonal code division multiple access system
First Claim
Patent Images
1. A bi-orthogonal base station apparatus for communicating in a code division multiple access system, the system comprising a radiotelephone communicating with a plurality of base stations over a channel, the apparatus comprising:
- a memory that stores a plurality of 2n-bit Walsh codes, the memory coupled to and addressed by two n-bit addresses such that a first Walsh code and a second Walsh code, orthogonal to the first Walsh code, are output from the memory, both the first and second Walsh codes being orthogonal to any other system Walsh codes;
a first shift register, coupled to the memory, for receiving the first Walsh code in a parallel format and shifting out the first Walsh code in a serial format;
a second shift register, coupled to the memory, for receiving the second Walsh code in the parallel format and shifting out the second Walsh code in the serial format;
a multiplexer, coupled to the first and second shift registers, for integrating the first and second Walsh codes into a single serial bit stream; and
a quadrature phase shift keying modulator, coupled to the multiplexer, for modulating the serial bit stream for transmission over the channel.
3 Assignments
0 Petitions
Accused Products
Abstract
The present invention assigns a pair of user ID'"'"'s to each user. The user ID'"'"'s are used as addresses to access two orthogonal Walsh codes in a memory. Each Walsh code is 2n-bits in length and the memory size is 2n×2n. The orthogonal codes are then used to cover the information symbols for transmission. This results in the transmitted signal being orthogonal to other users and also orthogonal within the transmitting user'"'"'s own signal bursts.
-
Citations
4 Claims
-
1. A bi-orthogonal base station apparatus for communicating in a code division multiple access system, the system comprising a radiotelephone communicating with a plurality of base stations over a channel, the apparatus comprising:
-
a memory that stores a plurality of 2n-bit Walsh codes, the memory coupled to and addressed by two n-bit addresses such that a first Walsh code and a second Walsh code, orthogonal to the first Walsh code, are output from the memory, both the first and second Walsh codes being orthogonal to any other system Walsh codes;
a first shift register, coupled to the memory, for receiving the first Walsh code in a parallel format and shifting out the first Walsh code in a serial format;
a second shift register, coupled to the memory, for receiving the second Walsh code in the parallel format and shifting out the second Walsh code in the serial format;
a multiplexer, coupled to the first and second shift registers, for integrating the first and second Walsh codes into a single serial bit stream; and
a quadrature phase shift keying modulator, coupled to the multiplexer, for modulating the serial bit stream for transmission over the channel. - View Dependent Claims (2, 3)
-
-
4. A bi-orthogonal data recovery apparatus for communicating in a code division multiple access system, the apparatus comprising:
-
a receiver for receiving a modulated data stream comprising a first and a second Walsh code, the first Walsh code orthogonal to the second Walsh code, both Walsh codes being orthogonal to any other code division multiple access system Walsh codes;
a demodulator, coupled to the receiver, for demodulating the modulated data stream;
a demultiplexer, coupled to the demodulator, for splitting the demodulated data stream into separate paths for the first and the second Walsh codes;
a first shift register, coupled to the demultiplexer, for serially shifting in the first Walsh code and outputting the first Walsh code in a parallel form;
a second shift register, coupled to the demultiplexer, for serially shifting in the second Walsh code and outputting the second Walsh code in the parallel form, a memory, coupled to the demodulator, for storing a plurality of 2n-bit Walsh codes; and
a correlator, coupled to the memory and the first and second shift registers, for comparing the plurality of stored 2n-bit Walsh codes to the received first and second Walsh codes to determine a nearest Walsh code to each of the received first and second Walsh codes.
-
Specification