Method for code division multiple access communication with...

Multiplex communications – Generalized orthogonal or special mathematical techniques – Particular set of orthogonal functions

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S280000, C370S320000

Reexamination Certificate

active

10663062

ABSTRACT:
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.

REFERENCES:
patent: 4291409 (1981-09-01), Weinberg et al.
patent: 4761778 (1988-08-01), Hui
patent: 4817146 (1989-03-01), Szczutkowski et al.
patent: 5327455 (1994-07-01), De Gaudenzi et al.
patent: 5327467 (1994-07-01), De Gaudenzi et al.
patent: 5345472 (1994-09-01), Lee
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5511067 (1996-04-01), Miller
patent: 5559828 (1996-09-01), Armstrong et al.
patent: 5606575 (1997-02-01), Williams
patent: 5675609 (1997-10-01), Johnson
patent: 5734962 (1998-03-01), Hladik et al.
patent: 5742637 (1998-04-01), Kanterakis et al.
patent: 5812607 (1998-09-01), Hutchinson et al.
patent: 5825327 (1998-10-01), Krasner
patent: 5872810 (1999-02-01), Philips et al.
patent: 5950127 (1999-09-01), Nitta et al.
patent: 5982807 (1999-11-01), Snell
patent: 5995537 (1999-11-01), Kondo
patent: 6009325 (1999-12-01), Retzer et al.
patent: 6081697 (2000-06-01), Haartsen
patent: 6097974 (2000-08-01), Camp, Jr. et al.
patent: 6108317 (2000-08-01), Jones et al.
patent: 6122291 (2000-09-01), Robinson et al.
patent: 6125266 (2000-09-01), Matero et al.
patent: 6141373 (2000-10-01), Scott
patent: 6208292 (2001-03-01), Sih et al.
patent: 6208844 (2001-03-01), Abdelgany
patent: 6219341 (2001-04-01), Varanasi
patent: 6252917 (2001-06-01), Freeman
patent: 6272168 (2001-08-01), Lomp et al.
patent: 6282184 (2001-08-01), Lehman et al.
patent: 6307877 (2001-10-01), Philips et al.
patent: 6317422 (2001-11-01), Khaleghi et al.
patent: 6324159 (2001-11-01), Mennekens et al.
patent: 6351236 (2002-02-01), Hasler
patent: 6359940 (2002-03-01), Ciccarelli et al.
patent: 6370669 (2002-04-01), Eroz et al.
patent: 6373831 (2002-04-01), Secord et al.
patent: 6400314 (2002-06-01), Krasner
patent: 6411661 (2002-06-01), Nguyen et al.
patent: 6459693 (2002-10-01), Park et al.
patent: 6480529 (2002-11-01), Sih et al.
patent: 6510173 (2003-01-01), Garmonov et al.
patent: 6542558 (2003-04-01), Schulist et al.
patent: 6549784 (2003-04-01), Kostic et al.
patent: 6563856 (2003-05-01), O'Shea et al.
patent: 6580921 (2003-06-01), Inoue et al.
patent: 6597727 (2003-07-01), Philips et al.
patent: 6614834 (2003-09-01), Meng et al.
patent: 6697350 (2004-02-01), Lomp
patent: 6748010 (2004-06-01), Butler et al.
patent: 6898233 (2005-05-01), Philips et al.
patent: 7099372 (2006-08-01), Nieczyporowicz et al.
patent: 2001/0003530 (2001-06-01), Sriram et al.
patent: 2002/0064142 (2002-05-01), Antonio et al.
patent: 0 511 139 (1992-10-01), None
patent: 0 563 020 (1993-09-01), None
patent: 0 767 544 (1997-04-01), None
patent: 0 820 159 (1998-01-01), None
patent: 0 928 084 (1999-07-01), None
patent: 2 675 968 (1992-10-01), None
patent: WO 96/38993 (1996-12-01), None
patent: WO 97/14056 (1997-04-01), None
patent: WO 98/02758 (1998-01-01), None
Berrou et al.,Near Shannon Liimit Error—Correcting Coding and Decoding: Turbo-Codes(1), Proceedings of the ICC93, Geneva, Switzerland, May 23-26, 1993.
Corazza et al.,Probability of Error in the Return Link of a CDMA Mobile Satellite System,IEEE, pp. 1293-1297, 1996.
De Gaudenzi,Signal Recognition and Signature Code Acquisition in CDMA Mobile Packet Communications,pp. 196-208, IEEE Transactions on Vehicular Technology, vol. 47, No. 1, 1998.
Ojanpera,Wideband CDMA for Third Generation Mobile Communications,Artech House Publishers, 1998, pp. 114-115.
Philips et al.,A Programmable CDMA IF Transceiver ASIC for Wireless Communications,IEEE 1995 Custom Integrated Circuits Conference.
Sirius Communications Press Releases, CDMAX: Sirius Announces World's First Software-Configurable W-CDMA Core for Third Generation Wireless Handsets and Base Stations, Jun. 14, 1999, www.sirius.com.
Van Wyk et al.,Performance Tradeoff Among Spreading, Coding and Multiple-Antenna Transmit Diversity for High Capacity Space-Time Coded DS/CDMA,IEEE, 1999.
R. De Gaudenzi et al.,Bandlimited Quasi-Synchronous CDMA: A Novel Satellite Access Technique for Mobile and Personal Communication Systems,IEEE Journal on Selected Areas in Communication, vol. 10, No. 2, Feb. 1992.
Esmailzadeh, R. et al., “Quasi-synchronous time division duplex CDMA”, 1994, IEEE GLOBCOM '94, vol. 3, pp. 1637-1641.
DaSilva, V. et al., “Performance of orthogonal CDMA codes for quasi-synchronous communication systems”, Aug. 1993, Universal Personal Communications, vol. 2, pp. 995-999.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for code division multiple access communication with... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for code division multiple access communication with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for code division multiple access communication with... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3776162

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.