Method for code division multiple access communication with increased capacity through self-noise reduction
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04J-011/00
H04J-003/00
H04B-007/216
H04B-007/204
출원번호
US-0663062
(2003-09-15)
등록번호
US-7269126
(2007-09-11)
발명자
/ 주소
Mennekens,Jan
Mertens,Carl
Philips,Lieven
Vandermot,Jurgen
Vanhoof,Jan
출원인 / 주소
Agilent Technologies, Inc.
인용정보
피인용 횟수 :
1인용 특허 :
54
초록▼
A method for constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing. The method determines the balanced vectors of length N, being all possible cross-correlation vectors resulting from zero cross-
A method for constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing. The method determines the balanced vectors of length N, being all possible cross-correlation vectors resulting from zero cross-correlation of codes of length N. An arbitrary code of length N is utilized, and a bitwise XOR-ing is performed with all the balanced vectors to produce a set of codes with which the arbitrary code is orthogonal. A bitwise XOR-ing of the original balanced vectors is performed and the code is added to a set of orthogonal codes if the result of the bitwise XOR-ing of the original balanced vectors is balanced. The method is repeated until the set of orthogonal codes is complete.
대표청구항▼
The invention claimed is: 1. A method of constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the method comprising: a) determining the balanced vectors of length N, being all possible cross-c
The invention claimed is: 1. A method of constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the method comprising: a) determining the balanced vectors of length N, being all possible cross-correlation vectors resulting from zero cross-correlation of codes of length N; b) providing an arbitrary code of length N; c) performing bitwise XOR-ing with all the balanced vectors determined in a), to produce a set of codes with which the arbitrary code is orthogonal; d) performing bitwise XOR-ing of the balanced vectors determined in a); e) adding the code to a set of orthogonal codes if the result of d) is balanced; f) performing a) through e) until the set of orthogonal codes contains maximally N orthogonal codes; and g) applying the set of orthogonal codes to a plurality of data streams in the network so as to provide spread spectrum data streams. 2. The method defined in claim 1, wherein the network comprises a satellite communications network having mobile and fixed terminals. 3. The method defined in claim 1, wherein the network comprises a cellular communications network. 4. The method defined in claim 1, wherein the network comprises a short-range terrestrial communications network. 5. A computer usable medium having computer readable program code embodied therein for constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the computer readable code comprising instructions for: a) determining the balanced vectors of length N, being all possible cross-correlation vectors resulting from zero cross-correlation of codes of length N; b) providing an arbitrary code of length N; c) performing bitwise XOR-ing with all the balanced vectors determined in a), to produce a set of codes with which the arbitrary code is orthogonal; d) performing bitwise XOR-ing of the balanced vectors determined in a); e) adding the code to a set of orthogonal codes if the result of d) is balanced; f) performing a) through e) until the set of orthogonal codes contains maximally N orthogonal codes; and g) applying the set of orthogonal codes to a plurality of data streams in the network so as to provide spread spectrum data streams. 6. A system for constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the system comprising: a) means for determining the balanced vectors of length N, being all possible cross-correlation vectors resulting from zero cross-correlation of codes of length N; b) means for providing an arbitrary code of length N; c) means for performing bitwise XOR-ing with all the balanced vectors determined in a), to produce a set of codes with which the arbitrary code is orthogonal; d) means for performing bitwise XOR-ing of the balanced vectors determined in a); e) means for adding the code to a set of orthogonal codes if the result of d) is balanced; f) means for performing a) through e) until the set of orthogonal codes contains maximally N orthogonal codes; and g) means for applying the set of orthogonal codes to a plurality of data streams in the network so as to provide spread spectrum data streams. 7. The system defined in claim 6, wherein the system is embodied as an integrated circuit. 8. A method of constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the method comprising: a) determining the balanced codes of length N, being all possible cross-correlation codes resulting from zero cross-correlation of codes of length N; b) providing an arbitrary code of length N; c) performing bitwise XOR-ing of said arbitrary code with all the balanced codes determined in a), to produce code sets of orthogonal codes, each code set corresponding to the balanced vector used to produce said code set and each including the arbitrary code; d) performing bitwise XOR-ing of one of the set of balanced codes with each of the other members of the set of balanced codes; e) for each of said bitwise XOR-ing operations in d): if the result is balanced, adding said balanced result to a new set of balanced codes and merging the two code sets corresponding to the two balanced codes that resulted in said balanced result in d) to a new code set corresponding to said balanced result; f) replacing said set of balanced codes in d) with said new set of balanced codes obtained in e); g) performing d) through f) until the number of codes in said code sets equals N; and h) applying the set of orthogonal codes to a plurality of data streams in the network so as to provide spread spectrum data streams. 9. The method defined in claim 8, wherein the network comprises a satellite communications network having mobile and fixed terminals. 10. The method defined in claim 8, wherein the network comprises a cellular communications network. 11. The method defined in claim 8, wherein the network comprises a short-range terrestrial communications network. 12. A computer usable medium having computer readable program code embodied therein for constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the computer readable code comprising instructions for: a) determining the balanced codes of length N, being all possible cross-correlation codes resulting from zero cross-correlation of codes of length N;. b) providing an arbitrary code of length N; c) performing bitwise XOR-ing of said arbitrary code with all the balanced codes determined in a), to produce code sets of orthogonal codes, each code set corresponding to the balanced vector used to produce said code set and each including the arbitrary code; d) performing bitwise XOR-ing of one of the set of balanced codes with each of the other members of the set of balanced codes; e) for each of said bitwise XOR-ing operations in d): if the result is balanced, adding said balanced result to a new set of balanced codes and merging the two code sets corresponding to the two balanced codes that resulted in said balanced result in d) to a new code set corresponding to said balanced result; f) replacing said set of balanced codes in d) with said new set of balanced codes obtained in e); g) performing d) through f) until the number of codes in said code sets equals N; and h) applying the set of orthogonal codes to a plurality of data streams in the network so as to provide spread spectrum data streams. 13. A system for constructing orthogonal codes of length N for use in a network utilizing quasi-synchronous code division multiple access combined with time division duplexing, the system comprising: a) means for determining the balanced codes of length N, being all possible cross-correlation codes resulting from zero cross-correlation of codes of length N; b) means for providing an arbitrary code of length N; c) means for performing bitwise XOR-ing of said arbitrary code with all the balanced codes determined in a), to produce code sets of orthogonal codes, each code set corresponding to the balanced vector used to produce said code set and each including the arbitrary code; d) means for performing bitwise XOR-ing of one of the set of balanced codes with each of the other members of the set of balanced codes; e) means for each of said bitwise XOR-ing operations in d): if the result is balanced, adding said balanced result to a new set of balanced codes and merging the two code sets corresponding to the two balanced codes that resulted in said balanced result in d) to a new code set corresponding to said balanced result; f) means for replacing said set of balanced codes in d) with said new set of balanced codes obtained in e); g) means for performing d) through f) until the number of codes in said code sets equals N; and h) means for applying the set of orthogonal codes to a plurality of data streams in the network so as to provide spread spectrum data streams. 14. The system defined in claim 13, wherein the system is embodied as an integrated circuit.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (54)
Lomp, Gary R., Adaptive vector correlator for spread-spectrum communications.
De Gaudenzi Riccardo (Leiderdorp NLX) Viola Roberto (Oegstgeest NLX), Code distribution multiple access communication system with user voice activated carrier and code synchronization.
Lehman Brian James,CAX ; Morris Bradley John,CAX ; Monette Gilles,CAX ; Geddes Blaine,CAX, Common digitizing rate for multiple air interfaces for generic cell sites in cellular radio.
Szczutkowski Craig F. (Forest VA) Zinser ; Jr. Richard L. (Schenectady NY) Kappagantula Satish (Lynchburg VA) Peterson ; III Eugene H. (Forest VA), Cryptographic digital signal transceiver method and apparatus.
Steven C. Ciccarelli ; Saed G. Younis, Method and apparatus for downconverting signals transmitted using a plurality of modulation formats to a common intermediate frequency range.
Kostic, Zoran; Sollenberger, Nelson Ray, Method and apparatus for implementing measurement based dynamic frequency hopping in wireless communication systems.
Berrou Claude (le Conquet FRX) Adde Patrick (Brest FRX), Method for a maximum likelihood decoding of a convolutional code with decision weighting, and corresponding decoder.
Garmonov, Alexandr Vasillevich; Karpitski, Yuri Evgenievich, Method for the orthogonal and offset transmission-reception of a signal and device for realizing the same.
Schulist, Matthias; Gerstenberger, Dirk; Marquardt, Michael, Optimum turbo decoding architecture and method using a constant or quasi-constant signal-to-noise ratio.
Philips Lieven,BEX ; Vanhoof Jan,BEX ; Wouters Maryse,BEX ; De Wulf Rik,BEX ; Derudder Veerle,BEX ; Himbeeck Carl Van,BEX ; Bolsens Ivo,BEX ; De Man Hugo,BEX ; Gyselinckx Bert,BEX, Programmable modem apparatus for transmitting and receiving digital data, design method and use method for said modem.
Philips Lieven,BEX ; Vanhoof Jan,BEX ; Wouters Maryse,BEX ; De Wulf Rik,BEX ; Derudder Veerle,BEX ; Van Himbeeck Carl,BEX ; Bolsens Ivo,BEX ; De Man Hugo,BEX ; Gyselinckx Bert,BEX, Programmable modem apparatus for transmitting and receiving digital data, design method and use method for the modem.
Philips, Lieven; Vanhoof, Jan; Wouters, Maryse; De Wulf, Rik; Derudder, Veerle; Van Himbeeck, Carl; Bolsens, Ivo; De Man, Hugo; Gyselinckx, Bert, Programmable modem apparatus for transmitting and receiving digital data, design method and use method for the modem.
Philips, Lieven; Vanhoof, Jan; Wouters, Maryse; De Wulf, Rik; Derudder, Veerle; Van Himbeeck, Carl; Bolsens, Ivo; De Man, Hugo; Gyselinckx, Bert, Programmable modem apparatus for transmitting and receiving digital data, design method and use method for the modem.
Hladik Stephen Michael ; Check William Alan ; Glinsman Brian James ; Fleming ; III Robert Fleming, Satellite communications system utilizing parallel concatenated coding.
Weinberg Aaron (Potomac MD) Ebert Paul M. (Potomac MD) Fee Joseph J. (Wheaton MD) Kaminsky Yaroslav (Herndon VA) Keblawi Feisal S. (Vienna VA) Scales Walter C. (McLean VA), Spread spectrum communications method and apparatus.
Nieczyporowicz,Leon L.; Ertel,Richard B.; Giallorenzi,Thomas R.; Hall,Eric K., Spreading code hopping for synchronous DS-CDMA system to mitigate interference effects.
Norman P. Secord CA; Mo-Han Fong CA; Geng Wu CA; Leo Strawczynski CA; Ahmad Jalali ; Robert Matyas CA; Ning Guo CA; Wookwon Lee CA; Amir Bigloo CA, Systems and methods of channel coding and inverse-multiplexing for multi-carrier CDMA systems.
Armstrong John T. (297 S. Roosevelt Ave. Pasadena CA 91107) Richert John D. (460 Avocado Crest Rd. La Habra Heights CA 90631), Transmitted reference spread spectrum communication using a single carrier with two mutually orthogonal modulated basis.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.