US20020012386A1 - Method and apparatus for the construction and transmission of binary quasi orthogonal vectors - Google Patents
Method and apparatus for the construction and transmission of binary quasi orthogonal vectors Download PDFInfo
- Publication number
- US20020012386A1 US20020012386A1 US09/922,391 US92239101A US2002012386A1 US 20020012386 A1 US20020012386 A1 US 20020012386A1 US 92239101 A US92239101 A US 92239101A US 2002012386 A1 US2002012386 A1 US 2002012386A1
- Authority
- US
- United States
- Prior art keywords
- matrix
- vectors
- code
- sequence
- vector
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/102—Combining codes
- H04J13/105—Combining codes by extending
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
- H04J13/004—Orthogonal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
- H04J13/0022—PN, e.g. Kronecker
- H04J13/0025—M-sequences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0074—Code shifting or hopping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/16—Code allocation
- H04J13/18—Allocation of orthogonal codes
Definitions
- This invention relates to the field of communications systems and, in particular, to the field of transmission of spread coded message signals within communications systems.
- the total number of binary code vectors having a length n is 2 n .
- n the total number of binary vectors 2 n within the total vector space.
- the size of the code vectors still places a limitation on the size of the communications system.
- each vector w i is a column vector using a 0/1 alphabet or, equivalently, a ⁇ 1/+1 alphabet.
- a set of code vectors using the 0/1 alphabet is expressed as W b,n and a set using the ⁇ 1/+1 alphabet is expressed as W n .
- x and y can have any values between 1 and n
- the mobile station receives the total transmission signal S and tries to eliminate all message signals except its own.
- the mobile station can multiply signal S by the transpose of its own Walsh code vector.
- the separation of the transmitted message signals at the receiver depends on a zero correlation between the wanted signal and all of the other message signals.
- Quasi orthogonal vectors are vectors that are in addition to the n orthogonal vectors. Quasi orthogonal vectors have been selected from the remaining code vectors in the total binary 2 n vector space in order to provide as little interference as possible. Specifically, quasi orthogonal vectors are selected to provide a level of interference that is within acceptable limits, even though the level of interference is not zero.
- a computer search can be performed within the total 2 n vector space for binary (+1/ ⁇ 1 alphabet) masks.
- the masks can be applied to the orthogonal vectors to form a new set of vectors that are quasi orthogonal vectors.
- Applying a total of M masks to a set of Walsh code vectors w n the number of quasi orthogonal functions produced is: (M+1)n.
- Applying a mask m to a code vector w ⁇ W n includes a component by component multiplication of the mask m and the orthogonal code vector w to give the new code vector:
- the interference resulting from the use of the new code vectors can be tested and the code vectors that provide the lowest correlation can be selected to provide a set of quasi orthogonal vectors.
- a plurality of such masking functions can be found in order to provide a plurality of sets of quasi orthogonal vectors from a single set of orthogonal vectors.
- the quasi orthogonal vectors should be mutually orthogonal with respect to each other. There is a non-zero correlation between at least one code vector in the orthogonal set and one vector in the quasi orthogonal set.
- the goal in picking quasi orthogonal vectors v is to pick the vectors such that max 1 ⁇ i ⁇ n ⁇ ⁇ ⁇ ⁇ ( v _ , w _ i ) ⁇ ⁇
- the interference of the best quasi orthogonal vectors found in the odd power of two case using the computer search technique is ⁇ square root ⁇ square root over (2) ⁇ times the theoretical limit. Furthermore, with respect to any two sets of quasi orthogonal functions there is some non zero correlation between one pair of code vectors.
- the correlation between a pair of quasi orthogonal function sets is defined as the maximum absolute correlation between two such code vectors belonging to the two sets.
- a transmission method in a communications system has an orthogonal code vector for transmitting message signals.
- a first vector matrix is formed using a first series of cyclic shifts of a sequence having a characteristic polynomial wherein the characteristic polynomial of the sequence is a primitive polynomial having a degree r.
- a second vector matrix is formed using a second series of cyclic shifts in accordance with whether r is odd or even.
- the first vector matrix is permuted to provide an orthogonal code.
- the permuting operations are determined.
- the determined permuting operations are applied to the second matrix to provide a binary quasi orthogonal code vector.
- the binary quasi orthogonal code vector is applied to a message signal to provide an encoded message signal for transmission in the communications system.
- the binary quasi orthogonal code vector us applied at a receiver to decode the transmitted message signal.
- the transmission method also includes forming a vector matrix using a series of cyclic shifts of a sequence having a characteristic polynomial.
- the characteristic polynomial of the sequence is a primitive polynomial having a degree r.
- the method further includes permuting the vector matrix to form an orthogonal code to thereby provide a permutation matrix.
- the permutation matrix is applied to a message signal to provide an encoded message signal and the encoded message signal is transmitted in the communications system.
- An inverse process is applied at a receiver to decode the transmitted message signal.
- FIG. 1 shows a block diagram representation of a permutation matrix algorithm suitable for use in the method of the present invention
- FIG. 2 shows a block diagram representation of the quasi orthogonal mask generation algorithm of the present invention
- FIG. 3 shows a block diagram representation of a method for mapping vectors that is suitable for use in the method of the present invention
- FIG. 4 is a block diagram representation of the quasi orthogonal mask generation algorithm of the present invention in a form suitable for use in the binary case;
- FIG. 5 is a more detailed representation of a matrix generation step of one embodiment of the mask generation algorithm of FIG. 4.
- FIG. 6 is a more detailed representation of the matrix generation step in another embodiment of the mask generation algorithm of FIG. 4.
- FIG. 7 is a block diagram of the components of an exemplary CDMA mobile station used for implementing the message encoding system of the present invention.
- FIG. 8 is a block diagram of the components of an exemplary CDMA base station used for implementing the message encoding system of the present invention.
- masks m are constructed and applied to orthogonal code vectors in order to provide quasi orthogonal code vectors, wherein the masks are four phase or quaternary phase shift keying (QSPK) masks.
- the signal transmission method of the present invention can require two masks m when transmitting a message signal. One of the two masks can be used for the in phase (I) channel and one can be used for the out of phase (Q) channel.
- the new masks m can be generated using linear feedback shift registers (LFSR).
- LFSR linear feedback shift registers
- a 2 k -ary LFSR sequence s[t] is a sequence having symbols ⁇ 0, 1 , . . . , 2 k ⁇ 1 ⁇ where k is limited to the value 1 in the binary case and two in the quaternary case.
- r ⁇ 1 is the degree of the recursion.
- the coefficients c j belong to the set ⁇ 0, 1, . . . , 2 k ⁇ 1 ⁇ and c r ⁇ 0.
- the sequence s[t] is periodic with a period that is less than or equal to 2 r ⁇ 1. If the period of the sequence s[t] reaches the maximum value 2 r ⁇ 1, the characteristic polynomial of s[t] is defined as a primitive polynomial and the sequence s[t] is an m-sequence. Sequences of this type are taught in S. W. Golomb, “Shift Register Sequences,” Holden Day, San Francisco, Calif., 1967.
- a code matrix C′ includes one period of an m-sequence and one period of each of its cyclic shifts.
- the size of the code matrix C′ is 2 r ⁇ 1.
- the code matrix C′ can be extended by appending a zero bit to each code word in matrix C′. The zero is appended at the same bit location of each code word. The inclusion of an all zero vector in this manner forms the code matrix C from the code matrix C′.
- the code matrix C has a length 2 r and a size 2 r .
- the code matrix C can be columnwise and rowwise permuted to create the Walsh code W b,2 r of size 2 r . However, it is sufficient to obtain permutation matrix P such that the set of row vectors of the matrix product CP are the same as the set of row vectors of W b,2 r .
- permutation matrix algorithm 10 which is suitable for use in the present invention.
- a submatrix W of matrix W b,2 r is formed as shown in block 12.
- the submatrix W includes r rows having indices 1, 2, 4, . . . , 2 r ⁇ 1 .
- the indexing of W b,2 r is zero based and ranges from 0 to 2 r ⁇ 1.
- Matrix W therefore has r rows and 2 r columns. Every column of matrix W is distinct from all of the other columns.
- a submatrix M of code matrix C is then formed as shown in block 14 of permutation matrix algorithm 10 .
- Submatrix M has r rows and 2 r columns.
- an intermediate submatrix M′ having r rows and 2 r ⁇ 1 columns is formed.
- Submatrix M′ is formed by adding a column containing all zeros to submatrix M.
- the first row of submatrix M′ can be any cyclic shift of the m-sequence used in constructing code C.
- the r ⁇ 1 rows of submatrix M′ following the first row are successive shifts by one time unit in each case beginning with the first row. Every column of submatrix M is distinct.
- Permutation matrix P is the required output of algorithm 10 . Because submatrices M and W have the same set of distinct columns the determination of P in this manner is straightforward.
- permutation matrix P can be determined using a matrix computation technique. It will be understood by those skilled in the art that the rows of the matrix CP are the same as the rows of W b,2 r .
- a sequence known as Family A can be determined.
- the Family A sequence is taught, for example, in S. Boztas, P. V. Kumar, R, Hammons, “4-Phase Sequences with Near-Optimum Correlation Properties,” IEEE Transactions on Information Theory, IT-38 No. 3 (May 1992), pp 1101-1113.
- c(y) be a binary primitive polynomial of degree r.
- a polynomial g(x) having coefficients in the set ⁇ 0, 1, 2, 3 ⁇ can be lifted from the polynomial c(x) as follows:
- Such a lift of the binary polynomial c(x) to the quaternary polynomial g(x) is a special case of the Hensel lift of polynomials. For example, see B, R, MacDonald, “Finite Rings with Identity,” Marcel Dekker, Inc., New York, 1974.
- the LFSR sequence with the characteristic polynomial g(x) is defined to be a Family A sequence. The sequence has a period 2 r ⁇ 1.
- Quasi orthogonal mask generation algorithm 50 can be used to construct four-phase masks for forming quasi orthogonal vectors of length 2 r .
- a binary primitive polynomial c(x) of degree r is provided as shown in block 52 .
- primitive polynomial c(x) as its characteristic polynomial, a period of an m-sequence is constructed as shown in block 56 .
- Matrix M′ having dimensions (2 r ⁇ 1) ⁇ (2 r ⁇ 1) is constructed as shown in block 58 .
- the rows of matrix M′ each contain a period of the m-sequence of block 56 along with all of its cyclic shifts.
- Matrix M′ is then extended to form matrix M as shown in block 62 .
- the extension of matrix M′ is performed by adding an all zero column and an all zero row to matrix M′.
- the dimensions of matrix M are therefore 2 r ⁇ 2 r .
- the first column of matrix M can be the all zero column.
- a permutation P is found which column permutes the matrix M to contain the same row vectors as those contained in W b,2 r .
- the permutation matrix method taught hereinabove, or any other method known to those skilled in the art, can be used to perform the operations of block 66 .
- a Hensel lift is then performed on the primitive polynomial c(x) obtained in block 52 of mask generation algorithm 50 to provide the polynomial g(x) as described hereinabove.
- the Hensel lift operation is shown in block 72 .
- One period of the Family A sequences with the polynomial g(x) as its characteristic polynomial is generated as shown in block 78 .
- a sequence of the Family A sequences is selected. The selected sequence can be any one of the Family A sequences having at least one symbol equal to one or three.
- a vector N′ of length (2 r ⁇ 1) is constructed.
- the vector N′ consists of a period of the Family A sequence selected according to block 78 .
- a vector N of length 2 r is formed in step 82 by appending a zero bit at the first bit location to vector N′.
- the vector N is then column permuted using the permute P found in block 66 .
- the resulting permuted code word can be used (step 84 ) as a masking function for generating quasi orthogonal vectors according to the method of the present invention.
- the quasi orthogonal vectors generated in this manner can be used with symbol mapping to (+1, ⁇ 1, +j, ⁇ j).
- a total of 127 masks can be generated in this manner for a length 128 Walsh code.
- vector mapping function 100 As shown in vector mapping function 100 a quasi orthogonal vector mask can be represented equivalently with symbols from the ⁇ 0, 1, 2, 3 ⁇ alphabet or with symbols from ⁇ +1, ⁇ 1, +j, ⁇ j ⁇ alphabet of Table I using the mapping:
- mapping block 108 As shown in blocks 102 , 104 , respectively, the (0/1) Walsh code vectors (multiplied by two) and the masks in the ⁇ 0, 1, 2, 3 ⁇ alphabet can be added using modulo 4 adder 106 . The result of the addition is mapped into a ⁇ +1, ⁇ 1, +j, ⁇ j ⁇ alphabet as shown in mapping block 108 . The output of mapping block 108 can be applied to coded QPSK symbols by mixer 110 to provide a coded message signal output for transmission.
- the method of quasi orthogonal mask generation algorithm 50 can be generalized to all powers of two to yield the optimal quasi orthogonal vectors for each power of two.
- Table II sets forth the correlations and the number of masks provided according to the method of the present invention for several powers of two.
- the present invention provides for the construction and transmission of binary quasi orthogonal code vectors using masking functions obtained using the present invention.
- the method of the present invention provides quasi orthogonal functions having the optimal correlation between every pair of quasi orthogonal sets.
- the length of the masking function is an odd power of two, the correlation between any pair of sets is as least as good as the known results using binary alphabets.
- s[t] is a sequence with symbols ⁇ 0, 1, . . . , 2 k ⁇ 1 ⁇ that satisfies the relationship set forth hereinabove.
- Such a sequence s[t] has a characteristic polynomial c(x) that is defined as also set forth hereinabove.
- the sequence s[t] is periodic with a period less than or equal to 2 r ⁇ 1. If the period of the sequence s[t] reaches the maximum value 2 r ⁇ 1 the characteristic polynomial of s[t] can be defined as a binary primitive polynomial. In this case the sequence s[t] is defined as an m-sequence.
- a code matrix C′ can be defined to consist of one period of an m-sequence m1 with characteristic polynomial c(x) and one period of all of the cyclic shifts of the m-sequence m1.
- the size of the code matrix C′ is 2 r ⁇ 1.
- the code matrix C′ can be extended by appending a zero bit to each code word within matrix C′ at the same bit location of each code word. In the preferred embodiment, the appended zero bits can be placed at the first bit location of each code word within matrix C.
- code matrix C When the all zeros vector is applied to code matrix C′ in this manner, code matrix C is formed.
- Code matrix C has a size of 2r ⁇ 2r.
- Code matrix C can be columnwise and rowwise permuted to form the Walsh code and a record of the permutation operations required to form W b,2 r can be made.
- the permutation matrix P can be applied to form the dot product CP and obtain the same vectors as the set of row vectors of W b,2 r .
- Binary quasi orthogonal mask generation algorithm 120 can be used to construct two phase masks for forming quasi orthogonal vectors of length 2 r .
- a binary primitive polynomial c(x) of degree r is provided as shown in block 122 .
- primitive polynomial c(x) as its characteristic polynomial, a period of an m-sequence is constructed as shown in block 126 .
- Matrix M′ having dimensions (2 r ⁇ 1) ⁇ (2 r ⁇ 1) is constructed as shown in block 128 .
- the rows of matrix M′ each contain a period of the m-sequence of block 126 along with all of the cyclic shifts of the m-sequence.
- Matrix M′ is then extended to form matrix M as shown in block 132 .
- the extension of matrix M′ is performed by adding an all zero column and an all zero row to the matrix M′.
- the dimensions of matrix M are therefore 2 r ⁇ , 2 r .
- the first column of the matrix M can be the all zero column.
- a permutation P is found that column permutes the matrix M to contain the same row vectors as those contained in W b,2 r and a record of the required permutation operations can be made.
- a code matrix C G or a code matrix C K is then formed as shown in block 142 of binary quasi orthogonal mask generation algorithm 120 .
- the code matrix C G is formed in cases where the degree of the primitive polynomial r is odd and the code matrix C K is formed when r is even.
- FIG. 5 there is shown a more detailed representation of block 142 in the case where r is odd.
- a preferred m-sequence m1 is obtained.
- a sequence m2 that forms a preferred pair with the m-sequence m1 is then obtained.
- the sequence m2 can have a period 2 r ⁇ 1 and can be obtained by extending the sequence m1.
- the extending of the sequence m1 is shown in block 164 .
- the code matrix C′ G is then formed from the sequence m2 as shown in block 168 . It is a matrix having one period of each of the m-sequence m2 and all of its distinct cyclic shifts.
- the number of rows in matrix C′ G is 2 r ⁇ 1 and the number of columns is 2 r ⁇ 1.
- the code matrix C G is formed from the code matrix C′ G by extending the matrix C′ G as shown in block 172 .
- the extension of the matrix C′ G can be performed by appending a zero bit at the same bit location of each code word in the matrix C′ G .
- the bit location used for appending the zero can be the first bit location.
- the number of rows in code matrix C G is 2 r ⁇ 1 and the number of columns is 2 r .
- FIG. 6 there is shown a more detailed representation of block 142 of binary quasi orthogonal mask generation algorithm 120 in the case wherein the degree of the primitive polynomial r is even.
- a code matrix C is obtained as previously described.
- the code matrix C is then decimated by a factor of 1 ⁇ 2 r/2 .
- the sequence m3 is the m-sequence obtained from the m-sequence m1 by decimating the sequence m1 by a factor 1+2 r/2 .
- the sequence m3 has a period of 2 r/2 ⁇ 1.
- a code matrix C K ′ is formed as shown in block 188 .
- the formation of the matrix C K ′ is begun in step 192 by inserting 2 r/2 ⁇ 1 periods each of m3 sequence and all its distinct cyclic shifts. This forms the first 2 r/2 ⁇ 1 columns of code matrix C K ′.
- the first 2 r/2 ⁇ 1 columns are then repeated 2 r/2 +1 times as shown in block 196 .
- a code matrix C K can then be obtained by appending a zero bit at the first location of each code word within the matrix C K ′ as shown in block 200 .
- the size of the code matrix C K can be 2 r/2 ⁇ 1.
- the number of masking functions obtained using binary quasi orthogonal mask generation algorithm 120 for some exemplary values of length n are set forth in Table III along with the maximum absolute correlation with the Walsh code and the correlation spectrum.
- execution of binary mask generation algorithm 120 proceeds from block 142 , which is described in more detail in FIGS. 5 and 6.
- a row vector f of either code matrix CG or code matrix CK is selected.
- the permutation P determined herein is then applied to the row vector f as shown in block 140 .
- a mask can be provided according to the permutation.
- the mask can be applied to orthogonal vectors to provide quasi orthogonal vectors which can be used as described above to provide a coded message signal output for transmission.
- FIG. 7 there is a block diagram showing the components of an exemplary code division multiple access (CDMA) mobile station 300 used for implementing the message encoding and decoding system of the present invention.
- the mobile station includes an antenna system 330 , which is coupled through diplexer 332 to analog receiver 334 and transmit power amplifier 336 .
- Antenna system 330 and diplexer 332 are of standard design and permit simultaneous reception and transmission through one or more antennas.
- Antenna system 330 optionally includes one antenna for voice traffic, and a separate antenna for receiving GPS signals.
- Antenna system 330 collects signals transmitted to the mobile station from one or more base stations and the GPS system, and provides the signals through diplexer 332 to analog receiver 334 .
- Receiver 334 is also provided with an analog to digital converter (not shown). Receiver 334 receives RF signals from diplexer 332 , amplifies and frequency downconverts the signals, and provides a digitized output signal to digitial data receivers 340 , 342 and to search receiver 344 . It will be understood that, although in the embodiment in FIG. 7 only two digital data receivers are shown, a low performance mobile station might have only a single digitial data receiver while higher performance units will have two or more digital data receivers to permit diversity reception.
- the outputs of receivers 340 and 342 are provided to diversity and combiner circuitry 348 which time adjusts the two streams of data received from the receivers 340 and 342 , adds the streams together and decodes the result.
- An output signal is provided from the decoder 348 to control processor 346 .
- the control processor 346 includes software that decodes the output of decoder 348 in accordance with quasi orthogonal vectors generated in accordance with the present invention. More particularly, the control processor 346 decodes messages that have been encoded using the quasi orthogonal vectors of the present invention and sent to mobile station 300 via a transmitter site such as base station 400 described below.
- the control processor 346 further includes software for encoding messages using such quasi orthogonal vectors and transmitting such encoded messages to a further station via antenna 330 .
- the mobile station 300 can store the quasi orthogonal vectors used for encoding and decoding in memory to reduce processing requirements during transmission and reception of the message signals.
- the quasi orthogonal vectors can be generated in real time (i.e., during the message encoding and decoding processes) in mobile station 300 in order to, for example, conserve available memory space.
- FIG. 8 there is shown a block diagram of the components of an exemplary CDMA base station 400 used for implementing the message encoding system of the present invention.
- two receiver systems are utilized with each having a separate antenna and analog receiver for diversity reception.
- the signals are processed identically until the signals undergo a diversity combination process.
- the elements within the dashed lines correspond to elements corresponding to the communications between the base station and one mobile station.
- the first receiver system is comprised of antenna 460 , analog receiver 462 , searcher receiver 464 and digital data receivers 466 and 468 .
- the second receiver system includes antenna 470 , analog receiver 472 , searcher receiver 474 and digital data receiver 476 .
- Cell-site control processor 478 is used for signal processing and control.
- Both receiver systems are coupled to diversity combiner and decoder circuitry 480 .
- a digital link 482 is used to communicate signals from and to a base station controller or data router under the control of control processor 478 .
- Signals received on antenna 460 are provided to analog receiver 462 , when the signals are amplified, frequency translated and digitized in a process identical to that described in connection with the mobile station analog receiver.
- the output from the analog receiver 462 is provided to digital data receivers 466 and 468 and searcher receiver 464 .
- the second receiver system i.e., analog receiver 472 , searcher receiver 474 and digital data receiver 476 ) processes the received signals in a manner similar to the first receiver system.
- the outputs of the digital data receivers 466 , 476 are provided to diversity combiner and decoder circuitry 480 , which processes the signals in accordance with a decoding algorithm. Details concerning the operation of the first and second receiver systems and the diversity combiner and decoder 480 are described in U.S. Pat. No. 5,101,501 entitled “Method and Apparatus for Providing A Soft Handoff In Communications In A CDMA Cellular Telephone System”, incorporated above. Signals for transmission to mobile units are provided to a transmit modulator 484 under the control of processor 478 .
- a message encoding system such as that shown in connection with FIGS. 1 - 6 is preferably implemented in software in cell-site control processor 478 .
- a message encoding system such as that shown in connection with FIGS. 1 -6 is preferably implemented in software in cell-site control processor 478 .
- Transmit modulator 484 modulates the data for transmission to the intended recipient mobile station.
- the control processor 478 also includes software that decodes the output decorder 480 in accordance with quasi orthogonal vectors generated in accordance with the present invention. More particulaly, the control processor 478 decodes messages that have been encoded using the quasi orthogonal vectors of the present invention and sent to base station 400 via a transmitter site such as mobile station 300 described above.
- the base station 400 can store the quasi orthogonal vectors used for encoding and decoding in memory to reduce processing requirements during transmission and reception of the message signals.
- the quasi orthogonal vectors can be generated in real time (i.e., during the message encoding and decoding processes) in base station 400 in order to, for example, conserve available memory space.
Abstract
A transmission method in a communications system having an orthogonal code vector for transmitting message signals. A first vector matrix is formed using a first series of cyclic shifts of a sequence having a characteristic polynomial wherein the characteristic polynomial of the sequence is a primitive polynomial having a degree r. A second vector matrix is formed using a second series of cyclic shifts in accordance with whether r is odd or even. The first vector matrix is permuted to provide an orthogonal code. The permuting operations are determined. The determined permuting operations are applied to the second matrix to provide a binary quasi orthogonal code vector. The binary quasi orthogonal code vector is applied to a message signal to provide an encoded message signal for transmission in the communications system.
Description
- This application is a continuation application of co-pending application Ser. No. 09/208,336, filed Dec. 9, 1998, entitled “A Method and Apparatus for the Construction and Transmission of Binary Quasi Orthogonal Vectors,” and currently assigned to the assignee of the present application.
- I. Field of the Invention
- This invention relates to the field of communications systems and, in particular, to the field of transmission of spread coded message signals within communications systems.
- II. Description of the Prior Art
- It is well known in the art of communications to mix message signals to be transmitted with spreading code vectors. The use of spreading code vectors permits the message signals to be combined, transmitted, and separated from each other after transmission. The most useful feature of a set of code vectors suitable for this purpose is that the spreading code vectors are mutually orthogonal. This permits a theoretical interference of zero between the message signals. The code vectors most commonly used for this purpose are Walsh code vectors.
- The total number of binary code vectors having a length n is 2n. However, of the total number of
binary vectors 2n within the total vector space, only n are mutually orthogonal. For example, when n=8 there are 256 different binary vectors. Only 8 of the 256 vectors are mutually orthogonal. Therefore, in a system wherein n=8 usually only 8 message signals can be combined and separated in this manner and only 8 users can be supported simultaneously. Likewise, if n=128 then 128 users can be supported simultaneously. Some of the vectors can be idle some of the time, thereby permitting more than n users to be serviced. However, the size of the code vectors still places a limitation on the size of the communications system. -
- wherein each vector wi is a column vector using a 0/1 alphabet or, equivalently, a −1/+1 alphabet. Hereinbelow, a set of code vectors using the 0/1 alphabet is expressed as Wb,n and a set using the −1/+1 alphabet is expressed as Wn.
- Since all vectors w in the set W are orthgonal to each other, the dot product of any two vectors in the set must be zero. This can be represented as:
- (wx,wy)=0
-
-
-
- The mobile station receives the total transmission signal S and tries to eliminate all message signals except its own.
-
-
- Thus, the separation of the transmitted message signals at the receiver depends on a zero correlation between the wanted signal and all of the other message signals.
- In order to utilize communications systems as effectively as possible it is desirable to simultaneously transmit and separate as many message signals as possible. However, it is only possible to mix n message signals and separate them with zero interference because only n orthogonal vectors are available, as previously described. To overcome this limitation it is known to use quasi orthogonal functions. Quasi orthogonal vectors are vectors that are in addition to the n orthogonal vectors. Quasi orthogonal vectors have been selected from the remaining code vectors in the total binary 2n vector space in order to provide as little interference as possible. Specifically, quasi orthogonal vectors are selected to provide a level of interference that is within acceptable limits, even though the level of interference is not zero.
- In order to select quasi orthogonal vectors a computer search can be performed within the total 2n vector space for binary (+1/−1 alphabet) masks. The masks can be applied to the orthogonal vectors to form a new set of vectors that are quasi orthogonal vectors. Applying a total of M masks to a set of Walsh code vectors wn, the number of quasi orthogonal functions produced is: (M+1)n. Applying a mask m to a code vector wεWn includes a component by component multiplication of the mask m and the orthogonal code vector w to give the new code vector:
- w m =w·m
- The interference resulting from the use of the new code vectors can be tested and the code vectors that provide the lowest correlation can be selected to provide a set of quasi orthogonal vectors. A plurality of such masking functions can be found in order to provide a plurality of sets of quasi orthogonal vectors from a single set of orthogonal vectors. In order to permit message signals mixed with the quasi orthogonal vectors found by the computer search to be separated from each other, the quasi orthogonal vectors should be mutually orthogonal with respect to each other. There is a non-zero correlation between at least one code vector in the orthogonal set and one vector in the quasi orthogonal set.
-
-
- is as small as possible.
-
- The correlation between two orthogonal vectors is zero. A lower absolute value of correlation results in better separation between message signals mixed with the orthogonal vectors and the ones mixed with quasi orthogonal vectors. Better signal separation results in lower interference between the signals at the time of decoding.
- The mean square correlation between orthogonal vectors and their corresponding quasi orthogonal vectors where n is a power of two is 1/n. The lower bound on the absolute value of correlation can be shown to have the value, 1/{square root}{square root over (n)}. This quantity is referred to as the Holtzman lower bound. Masks have been found that meet the lower bound for cases wherein n is an even power of two. However, in cases where n is an odd power of two this bound has not been met with an equality. The lowest correlation found in the latter case is {square root}{square root over (2)}/{square root}{square root over (n)}. Therefore, the interference of the best quasi orthogonal vectors found in the odd power of two case using the computer search technique is {square root}{square root over (2)} times the theoretical limit. Furthermore, with respect to any two sets of quasi orthogonal functions there is some non zero correlation between one pair of code vectors. The correlation between a pair of quasi orthogonal function sets is defined as the maximum absolute correlation between two such code vectors belonging to the two sets.
- Thus it desirable to find additional quasi orthogonal vectors having lower correlation with the orthogonal vectors for the case wherein n is an odd power of two, in order to expand the capacity of communications systems while maintaining acceptably low amounts of interference.
- A transmission method in a communications system has an orthogonal code vector for transmitting message signals. A first vector matrix is formed using a first series of cyclic shifts of a sequence having a characteristic polynomial wherein the characteristic polynomial of the sequence is a primitive polynomial having a degree r. A second vector matrix is formed using a second series of cyclic shifts in accordance with whether r is odd or even. The first vector matrix is permuted to provide an orthogonal code. The permuting operations are determined. The determined permuting operations are applied to the second matrix to provide a binary quasi orthogonal code vector. The binary quasi orthogonal code vector is applied to a message signal to provide an encoded message signal for transmission in the communications system. The binary quasi orthogonal code vector us applied at a receiver to decode the transmitted message signal.
- The transmission method also includes forming a vector matrix using a series of cyclic shifts of a sequence having a characteristic polynomial. The characteristic polynomial of the sequence is a primitive polynomial having a degree r. The method further includes permuting the vector matrix to form an orthogonal code to thereby provide a permutation matrix. The permutation matrix is applied to a message signal to provide an encoded message signal and the encoded message signal is transmitted in the communications system. An inverse process is applied at a receiver to decode the transmitted message signal.
- The features, objects, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify corresponding elements throughout and wherein:
- FIG. 1 shows a block diagram representation of a permutation matrix algorithm suitable for use in the method of the present invention;
- FIG. 2 shows a block diagram representation of the quasi orthogonal mask generation algorithm of the present invention;
- FIG. 3 shows a block diagram representation of a method for mapping vectors that is suitable for use in the method of the present invention;
- FIG. 4 is a block diagram representation of the quasi orthogonal mask generation algorithm of the present invention in a form suitable for use in the binary case;
- FIG. 5 is a more detailed representation of a matrix generation step of one embodiment of the mask generation algorithm of FIG. 4; and
- FIG. 6 is a more detailed representation of the matrix generation step in another embodiment of the mask generation algorithm of FIG. 4; and
- FIG. 7 is a block diagram of the components of an exemplary CDMA mobile station used for implementing the message encoding system of the present invention.
- FIG. 8 is a block diagram of the components of an exemplary CDMA base station used for implementing the message encoding system of the present invention.
- In the signal transmission method of the present invention, masks m are constructed and applied to orthogonal code vectors in order to provide quasi orthogonal code vectors, wherein the masks are four phase or quaternary phase shift keying (QSPK) masks. Thus the masks m have an alphabet of four elements, {±1, ±j}, rather than two elements, where j={square root}{square root over (−1)} is the imaginary root of unity. It will be understood that the signal transmission method of the present invention can require two masks m when transmitting a message signal. One of the two masks can be used for the in phase (I) channel and one can be used for the out of phase (Q) channel.
-
-
- When k=1, the sequence s[t] is periodic with a period that is less than or equal to 2r−1. If the period of the sequence s[t] reaches the
maximum value 2r−1, the characteristic polynomial of s[t] is defined as a primitive polynomial and the sequence s[t] is an m-sequence. Sequences of this type are taught in S. W. Golomb, “Shift Register Sequences,” Holden Day, San Francisco, Calif., 1967. - A code matrix C′ includes one period of an m-sequence and one period of each of its cyclic shifts. Thus, the size of the code matrix C′ is 2r−1. The code matrix C′ can be extended by appending a zero bit to each code word in matrix C′. The zero is appended at the same bit location of each code word. The inclusion of an all zero vector in this manner forms the code matrix C from the code matrix C′. The code matrix C has a
length 2r and asize 2r. In one embodiment the code matrix C can be columnwise and rowwise permuted to create the Walsh code Wb,2 r ofsize 2r. However, it is sufficient to obtain permutation matrix P such that the set of row vectors of the matrix product CP are the same as the set of row vectors of Wb,2 r . - Referring now to FIG. 1, there is shown permutation matrix algorithm10 which is suitable for use in the present invention. In permutation matrix algorithm 10 a submatrix W of matrix Wb,2 r is formed as shown in
block 12. The submatrix W includes rrows having indices - A submatrix M of code matrix C is then formed as shown in
block 14 of permutation matrix algorithm 10. Submatrix M has r rows and 2r columns. In order to form submatrix M an intermediate submatrix M′ having r rows and 2r−1 columns is formed. Submatrix M′ is formed by adding a column containing all zeros to submatrix M. The first row of submatrix M′ can be any cyclic shift of the m-sequence used in constructing code C. The r−1 rows of submatrix M′ following the first row are successive shifts by one time unit in each case beginning with the first row. Every column of submatrix M is distinct. - A permutation matrix P such that MP=W is then determined as set forth in
block 16 of permutation matrix algorithm 10. Permutation matrix P is the required output of algorithm 10. Because submatrices M and W have the same set of distinct columns the determination of P in this manner is straightforward. In an alternate embodiment of the invention permutation matrix P can be determined using a matrix computation technique. It will be understood by those skilled in the art that the rows of the matrix CP are the same as the rows of Wb,2 r. - When k=2, and sequences therefore have a quaternary alphabet, a sequence known as Family A can be determined. The Family A sequence is taught, for example, in S. Boztas, P. V. Kumar, R, Hammons, “4-Phase Sequences with Near-Optimum Correlation Properties,” IEEE Transactions on Information Theory, IT-38 No. 3 (May 1992), pp 1101-1113. In order to obtain a Family A sequence, let c(y) be a binary primitive polynomial of degree r. A polynomial g(x) having coefficients in the set {0, 1, 2, 3} can be lifted from the polynomial c(x) as follows:
- g(x 2)=(−1)r c(x)c(−x)(mod 4)
- Such a lift of the binary polynomial c(x) to the quaternary polynomial g(x) is a special case of the Hensel lift of polynomials. For example, see B, R, MacDonald, “Finite Rings with Identity,” Marcel Dekker, Inc., New York, 1974. The LFSR sequence with the characteristic polynomial g(x) is defined to be a Family A sequence. The sequence has a
period 2r−1. - Referring now to FIG. 2, there is shown quasi orthogonal
mask generation algorithm 50. Quasi orthogonalmask generation algorithm 50 can be used to construct four-phase masks for forming quasi orthogonal vectors oflength 2r. In mask generation algorithm 50 a binary primitive polynomial c(x) of degree r is provided as shown inblock 52. Using primitive polynomial c(x) as its characteristic polynomial, a period of an m-sequence is constructed as shown inblock 56. - Matrix M′ having dimensions (2r−1)×(2r−1) is constructed as shown in
block 58. The rows of matrix M′ each contain a period of the m-sequence ofblock 56 along with all of its cyclic shifts. Matrix M′ is then extended to form matrix M as shown inblock 62. The extension of matrix M′ is performed by adding an all zero column and an all zero row to matrix M′. The dimensions of matrix M are therefore 2r×2r. For convenience, the first column of matrix M can be the all zero column. As set forth in block 66 a permutation P is found which column permutes the matrix M to contain the same row vectors as those contained in Wb,2 r . The permutation matrix method taught hereinabove, or any other method known to those skilled in the art, can be used to perform the operations of block 66. - A Hensel lift is then performed on the primitive polynomial c(x) obtained in
block 52 ofmask generation algorithm 50 to provide the polynomial g(x) as described hereinabove. The Hensel lift operation is shown inblock 72. One period of the Family A sequences with the polynomial g(x) as its characteristic polynomial is generated as shown inblock 78. A sequence of the Family A sequences is selected. The selected sequence can be any one of the Family A sequences having at least one symbol equal to one or three. - A vector N′ of length (2r−1) is constructed. The vector N′ consists of a period of the Family A sequence selected according to
block 78. A vector N oflength 2r is formed instep 82 by appending a zero bit at the first bit location to vector N′. The vector N is then column permuted using the permute P found in block 66. The resulting permuted code word can be used (step 84) as a masking function for generating quasi orthogonal vectors according to the method of the present invention. The quasi orthogonal vectors generated in this manner can be used with symbol mapping to (+1, −1, +j, −j). A total of 127 masks can be generated in this manner for alength 128 Walsh code. Two of the masks generated according to quasiorthogonal mask algorithm 50 are set forth in Table I below.TABLE I [1j1j1j1j1j1j1j1j1j1j1j1j−1−j−1−j−1−j−1−j1j1j−1−j−1−j1j1j−1−j −1−j1j1j−1−j−1−j−1−j−1−j1j1j1j−1−j1j−1−j1j−1−j1j−1−j1j−1−j1j−1 −j−1−j1j−1−j1j1j−1−j−1−j1j1j−1−j−1−j1j1j−1−j−1−j1j−1−j1j1j−1−j] [1j1j1j1j−1−j−1−j1j1j1j−1−j1j−1−j1j−1−j−1−j1j1−j1−j−1j−1j−1j−1j −1j−1j1−j−1j−1j1−j1−j−1j1−j−1j−j1j−1−j1j−1j−1−j1−j1j−1−j1−j1−j1 −j1−j1−j1j−1j−1j1−j−1−j−1j1−j−1j1−j−1j1j1j1−j−1−j−1j1j1j1j1] - Referring now to FIG. 3, there is shown
vector mapping function 100. As shown in vector mapping function 100 a quasi orthogonal vector mask can be represented equivalently with symbols from the {0, 1, 2, 3} alphabet or with symbols from {+1, −1, +j, −j} alphabet of Table I using the mapping: - 0→1
- 1→j
- 2→−1
- 3→−j
- As shown in
blocks adder 106. The result of the addition is mapped into a {+1, −1, +j, −j} alphabet as shown inmapping block 108. The output ofmapping block 108 can be applied to coded QPSK symbols bymixer 110 to provide a coded message signal output for transmission. - The correlation between any code vector in the Walsh code and any code vector obtained by applying the masks of Table I to the Walsh code vectors is
- {±1/16±j/16}.
-
- and the theoretical lower bound on the correlation set forth hereinabove is met with equality. Furthermore, the method of quasi orthogonal
mask generation algorithm 50 can be generalized to all powers of two to yield the optimal quasi orthogonal vectors for each power of two. Table II sets forth the correlations and the number of masks provided according to the method of the present invention for several powers of two.TABLE II Maximum Absolute Correlation With Correlation Number Of Length Walsh code Spectrum Available Masks 32 0.177 31 64 0.125 63 128 0.0833 127 256 0.0625 255 512 0.0442 511 - In addition to the four phase case described herein, the present invention provides for the construction and transmission of binary quasi orthogonal code vectors using masking functions obtained using the present invention. When the length of a masking function in the binary case is an even power of two the method of the present invention provides quasi orthogonal functions having the optimal correlation between every pair of quasi orthogonal sets. When the length of the masking function is an odd power of two, the correlation between any pair of sets is as least as good as the known results using binary alphabets.
- It will be recalled that in a 2k-ary linear feedback shift register s[t] is a sequence with symbols {0, 1, . . . , 2k−1} that satisfies the relationship set forth hereinabove. Such a sequence s[t] has a characteristic polynomial c(x) that is defined as also set forth hereinabove. The method for forming binary quasi orthogonal vectors is restricted to the case corresponding to k=1.
- When k=1 the sequence s[t] is periodic with a period less than or equal to 2r−1. If the period of the sequence s[t] reaches the
maximum value 2r−1 the characteristic polynomial of s[t] can be defined as a binary primitive polynomial. In this case the sequence s[t] is defined as an m-sequence. - A code matrix C′ can be defined to consist of one period of an m-sequence m1 with characteristic polynomial c(x) and one period of all of the cyclic shifts of the m-sequence m1. Thus the size of the code matrix C′ is 2r−1. The code matrix C′ can be extended by appending a zero bit to each code word within matrix C′ at the same bit location of each code word. In the preferred embodiment, the appended zero bits can be placed at the first bit location of each code word within matrix C.
- When the all zeros vector is applied to code matrix C′ in this manner, code matrix C is formed. Code matrix C has a size of 2r×2r. Code matrix C can be columnwise and rowwise permuted to form the Walsh code and a record of the permutation operations required to form Wb,2 r can be made. However, in the method of the present invention the permutation matrix P can be applied to form the dot product CP and obtain the same vectors as the set of row vectors of Wb,2 r .
- Referring now to FIG. 4, there is shown binary quasi orthogonal
mask generation algorithm 120. Binary quasi orthogonalmask generation algorithm 120 can be used to construct two phase masks for forming quasi orthogonal vectors oflength 2r. In mask generation algorithm 120 a binary primitive polynomial c(x) of degree r is provided as shown inblock 122. Using primitive polynomial c(x) as its characteristic polynomial, a period of an m-sequence is constructed as shown inblock 126. - Matrix M′ having dimensions (2r−1)×(2r−1) is constructed as shown in
block 128. The rows of matrix M′ each contain a period of the m-sequence ofblock 126 along with all of the cyclic shifts of the m-sequence. Matrix M′ is then extended to form matrix M as shown inblock 132. The extension of matrix M′ is performed by adding an all zero column and an all zero row to the matrix M′. The dimensions of matrix M are therefore 2r×, 2r. In the preferred embodiment, the first column of the matrix M can be the all zero column. As set forth in block 136 a permutation P is found that column permutes the matrix M to contain the same row vectors as those contained in Wb,2 r and a record of the required permutation operations can be made. - The permutation matrix method taught hereinabove, or any other method known to those skilled in the art, can be used to perform the operations of
block 136. A code matrix CG or a code matrix CK is then formed as shown inblock 142 of binary quasi orthogonalmask generation algorithm 120. The code matrix CG is formed in cases where the degree of the primitive polynomial r is odd and the code matrix CK is formed when r is even. - Referring now to FIG. 5, there is shown a more detailed representation of
block 142 in the case where r is odd. As shown inblock 160 of FIG. 5, a preferred m-sequence m1 is obtained. A sequence m2 that forms a preferred pair with the m-sequence m1 is then obtained. The sequence m2 can have aperiod 2r−1 and can be obtained by extending the sequence m1. The extending of the sequence m1 is shown inblock 164. - The code matrix C′G is then formed from the sequence m2 as shown in
block 168. It is a matrix having one period of each of the m-sequence m2 and all of its distinct cyclic shifts. The number of rows in matrix C′G is 2r−1 and the number of columns is 2r−1. The code matrix CG is formed from the code matrix C′G by extending the matrix C′G as shown inblock 172. The extension of the matrix C′G can be performed by appending a zero bit at the same bit location of each code word in the matrix C′G. The bit location used for appending the zero can be the first bit location. The number of rows in code matrix CG is 2r−1 and the number of columns is 2r. - Referring now to FIG. 6, there is shown a more detailed representation of
block 142 of binary quasi orthogonalmask generation algorithm 120 in the case wherein the degree of the primitive polynomial r is even. Inblock 180 of FIG. 6 a code matrix C is obtained as previously described. The code matrix C is then decimated by a factor of 1−2r/2. The sequence m3 is the m-sequence obtained from the m-sequence m1 by decimating the sequence m1 by afactor 1+2r/2. The sequence m3 has a period of 2r/2−1. - In the decimation process of
block 184 predetermined columns of C are selected and the remaining columns are not selected as follows. If Ci is the ith column of code matrix C and C K, i is the ith column of code matrix C formed by decimating the code matrix C then: - Ck,1=C1
- Ck,2=C1+2 r/2
- Ck,3=C2(1+2 r/2 )
- Ck,i=C(i−1)(1+2 r/2 )
- A code matrix CK′ is formed as shown in
block 188. The formation of the matrix CK′ is begun instep 192 by inserting 2r/2−1 periods each of m3 sequence and all its distinct cyclic shifts. This forms the first 2r/2−1 columns of code matrix CK′. The first 2r/2−1 columns are then repeated 2r/2+1 times as shown inblock 196. A code matrix CK can then be obtained by appending a zero bit at the first location of each code word within the matrix CK′ as shown inblock 200. The size of the code matrix CK can be 2r/2−1. - Thus, using the method of the present invention it is possible to construct quasi orthogonal functions for all powers of two in the binary case wherein k=1. Additionally, the method of the present invention can provide many more masking functions than were available in the prior art because of the size of the matrices. The number of masking functions obtained using binary quasi orthogonal
mask generation algorithm 120 for some exemplary values of length n are set forth in Table III along with the maximum absolute correlation with the Walsh code and the correlation spectrum.TABLE III Maximum Absolute Correlation With Correlation Number Of Length Walsh code Spectrum Available Masks 32 0.25 31 64 0.125 7 128 0.125 127 256 0.0625 15 512 0.0625 511 - Returning now to FIG. 4, execution of binary
mask generation algorithm 120 proceeds fromblock 142, which is described in more detail in FIGS. 5 and 6. Inblock 148 of mask generation algorithm 120 a row vector f of either code matrix CG or code matrix CK is selected. The permutation P determined herein is then applied to the row vector f as shown in block 140. As set forth inblock 154, and previously described herein, a mask can be provided according to the permutation. The mask can be applied to orthogonal vectors to provide quasi orthogonal vectors which can be used as described above to provide a coded message signal output for transmission. - Referring now to FIG. 7, there is a block diagram showing the components of an exemplary code division multiple access (CDMA)
mobile station 300 used for implementing the message encoding and decoding system of the present invention. The mobile station includes anantenna system 330, which is coupled throughdiplexer 332 toanalog receiver 334 and transmitpower amplifier 336.Antenna system 330 anddiplexer 332 are of standard design and permit simultaneous reception and transmission through one or more antennas.Antenna system 330 optionally includes one antenna for voice traffic, and a separate antenna for receiving GPS signals.Antenna system 330 collects signals transmitted to the mobile station from one or more base stations and the GPS system, and provides the signals throughdiplexer 332 toanalog receiver 334.Receiver 334 is also provided with an analog to digital converter (not shown).Receiver 334 receives RF signals fromdiplexer 332, amplifies and frequency downconverts the signals, and provides a digitized output signal todigitial data receivers receiver 344. It will be understood that, although in the embodiment in FIG. 7 only two digital data receivers are shown, a low performance mobile station might have only a single digitial data receiver while higher performance units will have two or more digital data receivers to permit diversity reception. The outputs ofreceivers combiner circuitry 348 which time adjusts the two streams of data received from thereceivers digital data receivers search receiver 344, and the diversity comobiner anddecoder circuitry 348 are described in U.S. Pat. No. 5,101,501 entitled “Method and Apparatus for Providing A Soft Handoff In Communications In A CDMA Cellular Telephone System”, which is assigned to the assignee of the present invention and incorporated herein by reference. - An output signal is provided from the
decoder 348 to controlprocessor 346. Thecontrol processor 346 includes software that decodes the output ofdecoder 348 in accordance with quasi orthogonal vectors generated in accordance with the present invention. More particularly, thecontrol processor 346 decodes messages that have been encoded using the quasi orthogonal vectors of the present invention and sent tomobile station 300 via a transmitter site such asbase station 400 described below. Thecontrol processor 346 further includes software for encoding messages using such quasi orthogonal vectors and transmitting such encoded messages to a further station viaantenna 330. In one embodiment, themobile station 300 can store the quasi orthogonal vectors used for encoding and decoding in memory to reduce processing requirements during transmission and reception of the message signals. Alternatively, the quasi orthogonal vectors can be generated in real time (i.e., during the message encoding and decoding processes) inmobile station 300 in order to, for example, conserve available memory space. - Referring now to FIG. 8, there is shown a block diagram of the components of an exemplary
CDMA base station 400 used for implementing the message encoding system of the present invention. At the base station, two receiver systems are utilized with each having a separate antenna and analog receiver for diversity reception. In each of the receiver systems, the signals are processed identically until the signals undergo a diversity combination process. The elements within the dashed lines correspond to elements corresponding to the communications between the base station and one mobile station. Referring still to FIG. 8, the first receiver system is comprised ofantenna 460,analog receiver 462,searcher receiver 464 anddigital data receivers antenna 470,analog receiver 472, searcher receiver 474 anddigital data receiver 476. Cell-site control processor 478 is used for signal processing and control. - Both receiver systems are coupled to diversity combiner and
decoder circuitry 480. Adigital link 482 is used to communicate signals from and to a base station controller or data router under the control ofcontrol processor 478. Signals received onantenna 460 are provided toanalog receiver 462, when the signals are amplified, frequency translated and digitized in a process identical to that described in connection with the mobile station analog receiver. The output from theanalog receiver 462 is provided todigital data receivers searcher receiver 464. The second receiver system (i.e.,analog receiver 472, searcher receiver 474 and digital data receiver 476) processes the received signals in a manner similar to the first receiver system. The outputs of thedigital data receivers decoder circuitry 480, which processes the signals in accordance with a decoding algorithm. Details concerning the operation of the first and second receiver systems and the diversity combiner anddecoder 480 are described in U.S. Pat. No. 5,101,501 entitled “Method and Apparatus for Providing A Soft Handoff In Communications In A CDMA Cellular Telephone System”, incorporated above. Signals for transmission to mobile units are provided to a transmitmodulator 484 under the control ofprocessor 478. A message encoding system such as that shown in connection with FIGS. 1-6 is preferably implemented in software in cell-site control processor 478. A message encoding system such as that shown in connection with FIGS. 1-6 is preferably implemented in software in cell-site control processor 478. Transmitmodulator 484 modulates the data for transmission to the intended recipient mobile station. Thecontrol processor 478 also includes software that decodes theoutput decorder 480 in accordance with quasi orthogonal vectors generated in accordance with the present invention. More particulaly, thecontrol processor 478 decodes messages that have been encoded using the quasi orthogonal vectors of the present invention and sent tobase station 400 via a transmitter site such asmobile station 300 described above. In one embodiemt, thebase station 400 can store the quasi orthogonal vectors used for encoding and decoding in memory to reduce processing requirements during transmission and reception of the message signals. Alternatively, the quasi orthogonal vectors can be generated in real time (i.e., during the message encoding and decoding processes) inbase station 400 in order to, for example, conserve available memory space. - The previous description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention. The various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without the use of the inventive faculty. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. For example, it will be understood that the permutation method set forth herein is not limited to use in forming two phase and four phase quasi orthogonal vectors. Rather, it can be used as part of forming any kind of encoded message signal for any kind of signal within a communications system.
Claims (1)
1. A transmission method in a communications system for transmitting message signals, comprising the steps of:
(a) forming a vector matrix using a series of cyclic shifts of a sequence wherein the sequence has a characteristic polynomial that is a primitive polynomial;
(b) permuting the vector matrix to form an orthogonal code and thereby provide a permutation matrix;
(c) applying the permutation matrix to a message signal to provide an encoded message signal; and
(d) transmitting the encoded message signal within the communications system.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/922,391 US20020012386A1 (en) | 1998-12-09 | 2001-08-03 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/208,336 US6314125B1 (en) | 1998-12-09 | 1998-12-09 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
US09/922,391 US20020012386A1 (en) | 1998-12-09 | 2001-08-03 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/208,336 Continuation US6314125B1 (en) | 1998-12-09 | 1998-12-09 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
Publications (1)
Publication Number | Publication Date |
---|---|
US20020012386A1 true US20020012386A1 (en) | 2002-01-31 |
Family
ID=22774208
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/208,336 Expired - Fee Related US6314125B1 (en) | 1998-12-09 | 1998-12-09 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
US09/922,391 Abandoned US20020012386A1 (en) | 1998-12-09 | 2001-08-03 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/208,336 Expired - Fee Related US6314125B1 (en) | 1998-12-09 | 1998-12-09 | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
Country Status (8)
Country | Link |
---|---|
US (2) | US6314125B1 (en) |
EP (1) | EP1138134A2 (en) |
JP (1) | JP2002532947A (en) |
KR (1) | KR20010080734A (en) |
CN (1) | CN1329784A (en) |
AU (1) | AU3114500A (en) |
HK (1) | HK1040020A1 (en) |
WO (1) | WO2000035119A2 (en) |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040151235A1 (en) * | 2001-11-19 | 2004-08-05 | Olson Eric S. | Interference cancellation in a signal |
US20050222762A1 (en) * | 2004-03-31 | 2005-10-06 | International Business Machines Corporation | Method and system for automated incident traffic reporting and dynamic routing |
US7075968B1 (en) * | 2001-06-06 | 2006-07-11 | At&T Corp. | Method for whitening spread spectrum codes |
FR2913548A1 (en) * | 2007-03-09 | 2008-09-12 | France Telecom | METHOD FOR GENERATING MUTUALLY ORTHOGONAL SIGNALS WHERE THE SPECTRUM IS CONTROLLED |
US20090097587A1 (en) * | 2007-07-23 | 2009-04-16 | Huawei Technologies Co., Ltd. | Vector coding method and apparatus and computer program |
WO2011120233A1 (en) * | 2010-04-02 | 2011-10-06 | 富士通株式会社 | Apparatus and method for orthogonal cover code (occ) generation, and apparatus and method for occ mapping |
US20120321086A1 (en) * | 2011-06-17 | 2012-12-20 | Microsoft Corporation | Cloud key escrow system |
US8627508B2 (en) | 2011-06-17 | 2014-01-07 | Microsoft Corporation | Cloud key directory for federating data exchanges |
TWI475835B (en) * | 2012-09-28 | 2015-03-01 | Raydium Semiconductor Corp | Orthogonal code matrix generation method and orthogonal code matrix generation circuit |
US20180122021A1 (en) * | 2015-03-03 | 2018-05-03 | Uop Llc | Chemical refinery performance optimization |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1034665B1 (en) * | 1998-09-25 | 2004-04-28 | Samsung Electronics Co., Ltd. | Device and method for generating quasi-orthogonal code and spreading channel signals in mobile communication system |
KR100547838B1 (en) * | 1998-11-17 | 2006-03-23 | 삼성전자주식회사 | Handoff Method of Dedicated Control Channel in Code Division Multiple Access Communication System |
KR100315709B1 (en) * | 1998-12-29 | 2002-02-28 | 윤종용 | Channel Spreader and Method in Mobile Communication System |
US6671251B1 (en) * | 1999-01-11 | 2003-12-30 | Samsung Electronics Co., Ltd. | Method for generating complex quasi-orthogonal code and apparatus and method for spreading channel data using the quasi-orthogonal code in CDMA communication system |
US6545975B1 (en) * | 1999-04-19 | 2003-04-08 | Lucent Technologies Inc. | Method of enhancing security for the transmission of information |
KR100362579B1 (en) * | 1999-05-12 | 2002-11-29 | 삼성전자 주식회사 | Method for supporting a discontinuous transmission mode in a base station in a mobile communication system |
DE19924017A1 (en) * | 1999-05-26 | 2000-12-07 | Siemens Ag | Method and device for simplex data transmission |
US8290098B2 (en) * | 2001-03-30 | 2012-10-16 | Texas Instruments Incorporated | Closed loop multiple transmit, multiple receive antenna wireless communication system |
KR101082171B1 (en) * | 2005-05-23 | 2011-11-09 | 아주대학교산학협력단 | Method and apparatus for orthogonal frequency division multiplex |
CN101170337B (en) * | 2006-10-25 | 2012-04-11 | 中国科学院上海微系统与信息技术研究所 | Multi-antenna and multi-speed transmitter with optimized throughput and its transmission method |
US11032061B2 (en) * | 2018-04-27 | 2021-06-08 | Microsoft Technology Licensing, Llc | Enabling constant plaintext space in bootstrapping in fully homomorphic encryption |
Citations (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4315309A (en) * | 1979-06-25 | 1982-02-09 | Coli Robert D | Integrated medical test data storage and retrieval system |
US5325293A (en) * | 1992-02-18 | 1994-06-28 | Dorne Howard L | System and method for correlating medical procedures and medical billing codes |
US5528492A (en) * | 1991-09-06 | 1996-06-18 | Kabushiki Kaisha Toshiba | Method of managing medical diagnostic data with reference relationship |
US5549117A (en) * | 1994-05-23 | 1996-08-27 | Enact Health Management Systems | System for monitoring and reporting medical measurements |
US5581460A (en) * | 1990-11-06 | 1996-12-03 | Kabushiki Kaisha Toshiba | Medical diagnostic report forming apparatus capable of attaching image data on report |
US5704371A (en) * | 1996-03-06 | 1998-01-06 | Shepard; Franziska | Medical history documentation system and method |
US5729620A (en) * | 1993-09-29 | 1998-03-17 | Wang; Shih-Ping | Computer-aided diagnosis system and method |
US5761650A (en) * | 1995-12-29 | 1998-06-02 | Csg Systems, Inc. | Billing system and method |
US5807256A (en) * | 1993-03-01 | 1998-09-15 | Kabushiki Kaisha Toshiba | Medical information processing system for supporting diagnosis |
US5832504A (en) * | 1994-05-03 | 1998-11-03 | Xerox Corporation | Automatic enhanced report generation system |
US5832450A (en) * | 1993-06-28 | 1998-11-03 | Scott & White Memorial Hospital | Electronic medical record using text database |
US5895461A (en) * | 1996-07-30 | 1999-04-20 | Telaric, Inc. | Method and system for automated data storage and retrieval with uniform addressing scheme |
US5911133A (en) * | 1997-10-22 | 1999-06-08 | Rush-Presbyterian -St. Luke's Medical Center | User interface for echocardiographic report generation |
US5913820A (en) * | 1992-08-14 | 1999-06-22 | British Telecommunications Public Limited Company | Position location system |
US5950207A (en) * | 1995-02-07 | 1999-09-07 | Merge Technologies Inc. | Computer based multimedia medical database management system and user interface |
US5970499A (en) * | 1997-04-11 | 1999-10-19 | Smith; Kurt R. | Method and apparatus for producing and accessing composite data |
US5971767A (en) * | 1996-09-16 | 1999-10-26 | The Research Foundation Of State University Of New York | System and method for performing a three-dimensional virtual examination |
US5986662A (en) * | 1996-10-16 | 1999-11-16 | Vital Images, Inc. | Advanced diagnostic viewer employing automated protocol selection for volume-rendered imaging |
US5995937A (en) * | 1997-11-07 | 1999-11-30 | Deroyal Industries, Inc. | Modular health-care information management system utilizing reusable software objects |
US6029138A (en) * | 1997-08-15 | 2000-02-22 | Brigham And Women's Hospital | Computer system for decision support in the selection of diagnostic and therapeutic tests and interventions for patients |
US6049622A (en) * | 1996-12-05 | 2000-04-11 | Mayo Foundation For Medical Education And Research | Graphic navigational guides for accurate image orientation and navigation |
US6055494A (en) * | 1996-10-28 | 2000-04-25 | The Trustees Of Columbia University In The City Of New York | System and method for medical language extraction and encoding |
US6061695A (en) * | 1996-12-06 | 2000-05-09 | Microsoft Corporation | Operating system shell having a windowing graphical user interface with a desktop displayed as a hypertext multimedia document |
US6083162A (en) * | 1994-10-27 | 2000-07-04 | Wake Forest University | Method and system for producing interactive, three-dimensional renderings of selected body organs having hollow lumens to enable simulated movement through the lumen |
US6122351A (en) * | 1997-01-21 | 2000-09-19 | Med Graph, Inc. | Method and system aiding medical diagnosis and treatment |
US6133918A (en) * | 1993-06-11 | 2000-10-17 | Apple Computer, Inc. | Computer system with graphical user interface including drawer-like windows |
US6161080A (en) * | 1997-11-17 | 2000-12-12 | The Trustees Of Columbia University In The City Of New York | Three dimensional multibody modeling of anatomical joints |
US6182029B1 (en) * | 1996-10-28 | 2001-01-30 | The Trustees Of Columbia University In The City Of New York | System and method for language extraction and encoding utilizing the parsing of text data in accordance with domain parameters |
US6304848B1 (en) * | 1998-08-13 | 2001-10-16 | Medical Manager Corp. | Medical record forming and storing apparatus and medical record and method related to same |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4685132A (en) * | 1985-07-30 | 1987-08-04 | Sperry Corporation | Bent sequence code generator |
US5101501A (en) | 1989-11-07 | 1992-03-31 | Qualcomm Incorporated | Method and system for providing a soft handoff in communications in a cdma cellular telephone system |
JP2527104B2 (en) | 1990-01-22 | 1996-08-21 | 三菱電機株式会社 | Orthogonal sequence generator and radar apparatus including orthogonal sequence generator |
US5659569A (en) | 1990-06-25 | 1997-08-19 | Qualcomm Incorporated | Data burst randomizer |
US5550809A (en) | 1992-04-10 | 1996-08-27 | Ericsson Ge Mobile Communications, Inc. | Multiple access coding using bent sequences for mobile radio communications |
US5463657A (en) | 1994-02-15 | 1995-10-31 | Lockheed Missiles & Space Company, Inc. | Detection of a multi-sequence spread spectrum signal |
US5606322A (en) | 1994-10-24 | 1997-02-25 | Motorola, Inc. | Divergent code generator and method |
US6091760A (en) * | 1998-06-29 | 2000-07-18 | L-3 Communications Corporation | Non-recursively generated orthogonal PN codes for variable rate CDMA |
US6157611A (en) | 1998-08-18 | 2000-12-05 | Qualcomm Inc. | Method and apparatus for transmission and construction of quasi orthogonal vectors |
US6240143B1 (en) | 1998-08-18 | 2001-05-29 | Qualcomm Inc. | Method and apparatus for the reflection and transmission of quasi orthogonal vectors |
EP1034665B1 (en) * | 1998-09-25 | 2004-04-28 | Samsung Electronics Co., Ltd. | Device and method for generating quasi-orthogonal code and spreading channel signals in mobile communication system |
-
1998
- 1998-12-09 US US09/208,336 patent/US6314125B1/en not_active Expired - Fee Related
-
1999
- 1999-12-07 CN CN99814231A patent/CN1329784A/en active Pending
- 1999-12-07 AU AU31145/00A patent/AU3114500A/en not_active Abandoned
- 1999-12-07 WO PCT/US1999/029094 patent/WO2000035119A2/en not_active Application Discontinuation
- 1999-12-07 JP JP2000587469A patent/JP2002532947A/en active Pending
- 1999-12-07 EP EP99965171A patent/EP1138134A2/en not_active Withdrawn
- 1999-12-07 KR KR1020017007188A patent/KR20010080734A/en not_active Application Discontinuation
-
2001
- 2001-08-03 US US09/922,391 patent/US20020012386A1/en not_active Abandoned
-
2002
- 2002-02-27 HK HK02101501.8A patent/HK1040020A1/en unknown
Patent Citations (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4315309A (en) * | 1979-06-25 | 1982-02-09 | Coli Robert D | Integrated medical test data storage and retrieval system |
US5581460A (en) * | 1990-11-06 | 1996-12-03 | Kabushiki Kaisha Toshiba | Medical diagnostic report forming apparatus capable of attaching image data on report |
US5528492A (en) * | 1991-09-06 | 1996-06-18 | Kabushiki Kaisha Toshiba | Method of managing medical diagnostic data with reference relationship |
US5325293A (en) * | 1992-02-18 | 1994-06-28 | Dorne Howard L | System and method for correlating medical procedures and medical billing codes |
US5913820A (en) * | 1992-08-14 | 1999-06-22 | British Telecommunications Public Limited Company | Position location system |
US5807256A (en) * | 1993-03-01 | 1998-09-15 | Kabushiki Kaisha Toshiba | Medical information processing system for supporting diagnosis |
US6133918A (en) * | 1993-06-11 | 2000-10-17 | Apple Computer, Inc. | Computer system with graphical user interface including drawer-like windows |
US5832450A (en) * | 1993-06-28 | 1998-11-03 | Scott & White Memorial Hospital | Electronic medical record using text database |
US5729620A (en) * | 1993-09-29 | 1998-03-17 | Wang; Shih-Ping | Computer-aided diagnosis system and method |
US5832504A (en) * | 1994-05-03 | 1998-11-03 | Xerox Corporation | Automatic enhanced report generation system |
US5549117A (en) * | 1994-05-23 | 1996-08-27 | Enact Health Management Systems | System for monitoring and reporting medical measurements |
US6083162A (en) * | 1994-10-27 | 2000-07-04 | Wake Forest University | Method and system for producing interactive, three-dimensional renderings of selected body organs having hollow lumens to enable simulated movement through the lumen |
US5950207A (en) * | 1995-02-07 | 1999-09-07 | Merge Technologies Inc. | Computer based multimedia medical database management system and user interface |
US5761650A (en) * | 1995-12-29 | 1998-06-02 | Csg Systems, Inc. | Billing system and method |
US5704371A (en) * | 1996-03-06 | 1998-01-06 | Shepard; Franziska | Medical history documentation system and method |
US5895461A (en) * | 1996-07-30 | 1999-04-20 | Telaric, Inc. | Method and system for automated data storage and retrieval with uniform addressing scheme |
US5971767A (en) * | 1996-09-16 | 1999-10-26 | The Research Foundation Of State University Of New York | System and method for performing a three-dimensional virtual examination |
US5986662A (en) * | 1996-10-16 | 1999-11-16 | Vital Images, Inc. | Advanced diagnostic viewer employing automated protocol selection for volume-rendered imaging |
US6055494A (en) * | 1996-10-28 | 2000-04-25 | The Trustees Of Columbia University In The City Of New York | System and method for medical language extraction and encoding |
US6182029B1 (en) * | 1996-10-28 | 2001-01-30 | The Trustees Of Columbia University In The City Of New York | System and method for language extraction and encoding utilizing the parsing of text data in accordance with domain parameters |
US6049622A (en) * | 1996-12-05 | 2000-04-11 | Mayo Foundation For Medical Education And Research | Graphic navigational guides for accurate image orientation and navigation |
US6061695A (en) * | 1996-12-06 | 2000-05-09 | Microsoft Corporation | Operating system shell having a windowing graphical user interface with a desktop displayed as a hypertext multimedia document |
US6122351A (en) * | 1997-01-21 | 2000-09-19 | Med Graph, Inc. | Method and system aiding medical diagnosis and treatment |
US5970499A (en) * | 1997-04-11 | 1999-10-19 | Smith; Kurt R. | Method and apparatus for producing and accessing composite data |
US6029138A (en) * | 1997-08-15 | 2000-02-22 | Brigham And Women's Hospital | Computer system for decision support in the selection of diagnostic and therapeutic tests and interventions for patients |
US5911133A (en) * | 1997-10-22 | 1999-06-08 | Rush-Presbyterian -St. Luke's Medical Center | User interface for echocardiographic report generation |
US5995937A (en) * | 1997-11-07 | 1999-11-30 | Deroyal Industries, Inc. | Modular health-care information management system utilizing reusable software objects |
US6161080A (en) * | 1997-11-17 | 2000-12-12 | The Trustees Of Columbia University In The City Of New York | Three dimensional multibody modeling of anatomical joints |
US6304848B1 (en) * | 1998-08-13 | 2001-10-16 | Medical Manager Corp. | Medical record forming and storing apparatus and medical record and method related to same |
Cited By (32)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7075968B1 (en) * | 2001-06-06 | 2006-07-11 | At&T Corp. | Method for whitening spread spectrum codes |
US7039136B2 (en) * | 2001-11-19 | 2006-05-02 | Tensorcomm, Inc. | Interference cancellation in a signal |
US20040151235A1 (en) * | 2001-11-19 | 2004-08-05 | Olson Eric S. | Interference cancellation in a signal |
US20050222762A1 (en) * | 2004-03-31 | 2005-10-06 | International Business Machines Corporation | Method and system for automated incident traffic reporting and dynamic routing |
US20100103811A1 (en) * | 2007-03-09 | 2010-04-29 | France Telecom | Method for generating mutually orthogonal signals having a controlled spectrum |
FR2913548A1 (en) * | 2007-03-09 | 2008-09-12 | France Telecom | METHOD FOR GENERATING MUTUALLY ORTHOGONAL SIGNALS WHERE THE SPECTRUM IS CONTROLLED |
WO2008122744A1 (en) * | 2007-03-09 | 2008-10-16 | France Telecom | Method for generating mutually orthogonal signals having a controlled spectrum |
US8154984B2 (en) | 2007-03-09 | 2012-04-10 | France Telecom | Method for generating mutually orthogonal signals having a controlled spectrum |
US20090097565A1 (en) * | 2007-07-23 | 2009-04-16 | Huawei Technologies Co., Ltd. | Vector coding/decoding apparatus and stream media player |
US7738559B2 (en) | 2007-07-23 | 2010-06-15 | Huawei Technologies Co., Ltd. | Vector decoding method and apparatus and computer program |
US7738558B2 (en) | 2007-07-23 | 2010-06-15 | Huawei Technologies Co., Ltd. | Vector coding method and apparatus and computer program |
US7746932B2 (en) | 2007-07-23 | 2010-06-29 | Huawei Technologies Co., Ltd. | Vector coding/decoding apparatus and stream media player |
US20090097595A1 (en) * | 2007-07-23 | 2009-04-16 | Huawei Technologies Co., Ltd. | Vector decoding method and apparatus and computer program |
US20090097587A1 (en) * | 2007-07-23 | 2009-04-16 | Huawei Technologies Co., Ltd. | Vector coding method and apparatus and computer program |
US9001639B2 (en) | 2010-04-02 | 2015-04-07 | Fujitsu Limited | Apparatus and method for orthogonal cover code (OCC) generation, and apparatus and method for OCC mapping |
WO2011120233A1 (en) * | 2010-04-02 | 2011-10-06 | 富士通株式会社 | Apparatus and method for orthogonal cover code (occ) generation, and apparatus and method for occ mapping |
CN102783065A (en) * | 2010-04-02 | 2012-11-14 | 富士通株式会社 | Apparatus and method for orthogonal cover code (OCC) generation, and apparatus and method for OCC mapping |
US9716535B2 (en) | 2010-04-02 | 2017-07-25 | Fujitsu Limited | Transmission apparatus, transmission method, and wireless communication system for orthogonal cover code (OCC) generation and OCC mapping |
US9264164B2 (en) | 2010-04-02 | 2016-02-16 | Fujitsu Limited | Transmission apparatus, transmission method, wireless communication system for orthogonal cover code (OCC) generation and OCC mapping |
US20120321086A1 (en) * | 2011-06-17 | 2012-12-20 | Microsoft Corporation | Cloud key escrow system |
US8935810B2 (en) | 2011-06-17 | 2015-01-13 | Microsoft Corporation | Cloud key directory for federating data exchanges |
US9224005B2 (en) | 2011-06-17 | 2015-12-29 | Microsoft Technology Licensing, Llc | Cloud key directory for federating data exchanges |
US8891772B2 (en) * | 2011-06-17 | 2014-11-18 | Microsoft Corporation | Cloud key escrow system |
US9558370B2 (en) | 2011-06-17 | 2017-01-31 | Microsoft Technology Licensing, Llc | Cloud key directory for federating data exchanges |
US9667599B2 (en) | 2011-06-17 | 2017-05-30 | Microsoft Technology Licensing, Llc | Cloud key escrow system |
US8627508B2 (en) | 2011-06-17 | 2014-01-07 | Microsoft Corporation | Cloud key directory for federating data exchanges |
US9900288B2 (en) | 2011-06-17 | 2018-02-20 | Microsoft Technology Licensing, Llc | Cloud key escrow system |
US9992191B2 (en) | 2011-06-17 | 2018-06-05 | Microsoft Technology Licensing, Llc | Cloud key directory for federating data exchanges |
US10348696B2 (en) | 2011-06-17 | 2019-07-09 | Microsoft Technology Licensing, Llc | Cloud key escrow system |
US10425402B2 (en) | 2011-06-17 | 2019-09-24 | Microsoft Technology Licensing, Llc | Cloud key directory for federating data exchanges |
TWI475835B (en) * | 2012-09-28 | 2015-03-01 | Raydium Semiconductor Corp | Orthogonal code matrix generation method and orthogonal code matrix generation circuit |
US20180122021A1 (en) * | 2015-03-03 | 2018-05-03 | Uop Llc | Chemical refinery performance optimization |
Also Published As
Publication number | Publication date |
---|---|
HK1040020A1 (en) | 2002-05-17 |
EP1138134A2 (en) | 2001-10-04 |
WO2000035119A3 (en) | 2000-09-08 |
WO2000035119A2 (en) | 2000-06-15 |
CN1329784A (en) | 2002-01-02 |
JP2002532947A (en) | 2002-10-02 |
US6314125B1 (en) | 2001-11-06 |
AU3114500A (en) | 2000-06-26 |
KR20010080734A (en) | 2001-08-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6314125B1 (en) | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors | |
US7706348B2 (en) | Apparatus and method for encoding/decoding transport format combination indicator in CDMA mobile communication system | |
US6721349B1 (en) | Method and apparatus for reducing peak-to-average ratio in a CDMA communication system | |
JP3181440B2 (en) | CDMA communication device | |
EP1266459B1 (en) | Encoding apparatus and method in cdma communication system | |
US6611566B2 (en) | Reflection and transmission of quasi orthogonal vectors | |
AU2001244764A1 (en) | Encoding apparatus and method in CDMA communication system | |
EP1981195B1 (en) | Apparatus for construction of quasi orthogonal vectors | |
MXPA01001737A (en) | Method and apparatus for transmission and construction of quasi orthogonal vectors |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |