Multiplex communications – Communication over free space – Combining or distributing information via code word channels...
Reexamination Certificate
1999-03-03
2003-07-08
Urban, Edward F. (Department: 2685)
Multiplex communications
Communication over free space
Combining or distributing information via code word channels...
C370S335000, C370S441000, C370S392000, C370S419000, C370S321000, C375S145000, C375S257000, C375S367000
Reexamination Certificate
active
06590889
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates to digital data communications, and more particularly, to systems and methods for accommodating terminals of different throughput capabilities.
Current systems use a variety of schemes for encoding and multiplexing digital data streams for communications between terminals including frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA). Some systems have also been devised which use various combinations of FDMA, TDMA, and CDMA.
One problem with known prior art systems, however, is that they do not readily accommodate terminals having different throughput capabilities in an integrated digital network. In particular, data communications systems using TDMA and satellite relay typically expect or require that all terminals interconnected in the network have similar throughput capabilities and use a common modulation. In addition, these conventional systems cannot accommodate terminals that transmit at significantly different burst rates, and thus require all the terminals to use antennas of approximately the same diameter.
Conventional communications systems using FDMA and satellite relay, or any other form of radio relay, can accommodate multiple isolated point-to-point channels of differing throughput in configurations normally referred to as stove-pipe architectures, where integrated digital networking is not practically feasible.
Conventional TDMA systems that use variable rate burst modems can accommodate channels of differing throughputs. These systems, however, inefficiently use equipment at sites with relatively large antenna diameters by requiring a large number of modems to handle communications with smaller terminals.
Conventional satellite, or any other form of radio relay, systems using CDMA typically cannot handle reception of signals at varying power levels from different terminals, a problem normally referred as the “near-far problem.”
Therefore, there exists a need to overcome the above described problems of the prior art and thus permit a system that accommodates terminals of different throughput capabilities in an integrated digital network.
SUMMARY OF THE INVENTION
Accordingly, the present invention is directed to methods and systems for communicating between nodes that substantially obviates the problems of prior art communications systems.
In accordance with the purposes of the invention, as embodied and broadly described herein, the invention comprises a method for communicating over a network having a plurality of nodes. The method comprises the steps of generating a plurality of codes each being orthogonal to and a circular shifted version of every other one of the codes, assigning a subset of the codes to a first node, and transmitting information from the first node to a second node using the subset of codes.
In another aspect, the invention comprises a node for communicating over a network including means for storing a subset of codes, and means for transmitting information from a first node to a second node using the subset of codes. The subset of codes is derived from a set of codes and each code in the set of codes is orthogonal to and a circular shift of every other code in the set of codes.
In still another aspect, the invention comprises methods for modulating end-user information in symbols wherein each symbol is capable of carrying multiple bits of information.
In still another aspect, the invention comprises systems and methods for communicating between nodes using circulant-unitary matrices.
This summary of the invention and the following detailed description should not restrict the scope of the claimed invention. Both provide examples and explanations to enable others to practice the invention. The accompanying drawings, which form part of the description for carrying out a best mode of the invention, show several embodiments of the invention, and together with the description, explain the principles of the invention.
REFERENCES:
patent: 4455651 (1984-06-01), Baran
patent: RE32905 (1989-04-01), Baran
patent: 4965586 (1990-10-01), O'Neill et al.
patent: 5195090 (1993-03-01), Bolliger et al.
patent: 5195091 (1993-03-01), Farwell et al.
patent: 5260967 (1993-11-01), Schilling
patent: 5276907 (1994-01-01), Meidan
patent: 5278892 (1994-01-01), Bolliger et al.
patent: 5305308 (1994-04-01), English et al.
patent: 5313457 (1994-05-01), Hostetter et al.
patent: 5375140 (1994-12-01), Bustamante et al.
patent: 5410568 (1995-04-01), Schilling
patent: 6005883 (1999-12-01), Trompower
patent: 6104708 (2000-08-01), Bergamo
patent: 6125261 (2000-09-01), Anselmo et al.
patent: 6148176 (2000-11-01), Kolev et al.
patent: 6185246 (2001-02-01), Gilhousen
patent: 6275480 (2001-08-01), Schreier
patent: 6310870 (2001-10-01), Li
patent: 6356555 (2002-03-01), Rakib et al.
patent: 6366609 (2002-04-01), Rossi
Bergamo Marcos Antonio
Preuss Robert David
GTE Internetworking Incorporated
Milord Marceau
Suchyta Leonard Charles
Urban Edward F.
Weixel James K.
LandOfFree
Data communications system and hybrid time-code multiplexing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data communications system and hybrid time-code multiplexing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data communications system and hybrid time-code multiplexing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3087723