The invention relates to non-packet signal routing or switching systems and more particularly to such systems that apply signals from a selected one of N sources to a selected one of M sinks.
In broadcast systems, video and audio data are transmitted between N originating sources to M destination sinks. Such systems cannot easily rely on packet networking technology because of the need for synchronization of the data. The sources may be recording from CD players, live feeds, digital video files, etc. The control of a broadcast facility may involve rapid switching between many such sources and sinks. Presently, there are three types of routers that are used for such systems: space multiplexing, time multiplexing, and a combination of the two. In space multiplexing, a different physical channel is formed between the source and sink as in a classic telephone switching system. In time multiplexing, all sources and all sinks are connected to the same physical channel, each using a different time slot or slots. In combination systems, the endpoints obtain time-slotted data on multiple physical channels.
When a switching system grows in terms of the number of sources and sinks it must handle, problems attend all three different kinds of systems. In time multiplexed systems, the bandwidth of the common physical channel has to be increased in proportion with the number of routes sharing the channel. Also, each connected device must be connected to the physical channel which presents interference and signal attenuation problems as the physical channel's frequency rises. In space multiplexed systems, the complexity of the switch increases geometrically as the number of endpoints rises. This is because each source must be selectively connectable to each sink, so the number of possible paths grows exponentially with the number of sources and sinks.
There is a perennial need for switches that handle digital data synchronously, and that must remain time aligned, that do not grow in complexity too fast as the endpoint capacity of the switch increases.
A switch using distributed random access memory (RAM) accepts time multiplexed inputs applied to a fast wide buss. The incoming data is imaged simultaneously by a plurality of RAMs. Upon complete imaging of a one bit of each of the inputs (collectively, a “block”) by all the RAMS, another block is stored in successive range of memory cells. As each block is imaged, a respective output controller addresses the memory locations corresponding to the output stream for a respective signal to be time multiplexed on a respective output physical channel. Each RAM makes available to each output all of the incoming data. The output controller may select from a respective RAM only the data it requires to make up a respective output stream.
The technique is possible because of the high speed of large fast data busses and the electronics capable of addressing them. All incoming data on multiple physical channels, each of which may be time multiplexed, is applied to a single large buss. RAM that is capable of storing data on such high speed busses are written to with successive blocks of data from the buss. In a sense, the many-to-many physical switch interconnects characteristic of the spatial multiplexed aspect of the switch are replaced by a single interconnect—the high speed buss—like the hub of a wheel. Thus, interconnect complexity does not scale at the high rate characteristic of spatially multiplexed switches. Rather, the physical switch complexity scales linearly with the number of endpoints. In addition, the frequency demands on the devices driving the receiving and output electronics can be limited as the number of endpoints grows.
The invention will be described in connection with certain preferred embodiments, with reference to the following illustrative figures so that it may be more fully understood. With reference to the figures, it is stressed that the particulars shown are by way of example and for purposes of illustrative discussion of the preferred embodiments of the present invention only, and are presented in the cause of providing what is believed to be the most useful and readily understood description of the principles and conceptual aspects of the invention. In this regard, no attempt is made to show structural details of the invention in more detail than is necessary for a fundamental understanding of the invention, the description taken with the drawings making apparent to those skilled in the art how the several forms of the invention may be embodied in practice.
Referring to
Each RAM 145 is read out by a respective addressing controller 121–124 controlled by a controller 110. As would be understood by a person of ordinary skill, the addressing controller 121–124 may be an addressing RAM (not shown) with a sequencer (not shown) where the controller 110 places a sequence of addresses in the addressing RAM which are sequentially applied to the address lines (not shown explicitly) of the respective RAM 145 in response to the sequencer.
By placing all the data from the buss 150 into RAM 145, portions of the signal on the buss 150 can be randomly accessed to generate a signal on a respective output channel 165 without the timing required if data were to be applied to the output channel 165 directly from the buss 150. The addressing controller 121–124 addresses the appropriate memory locations in each respective RAM 145 in an appropriate sequence on channel 165 to supply all bits required by the bit selector 140. The bit selector 140 finally generates a signal on a respective output channel 160 which may be time demultiplexed to form a final M output channels.
Referring now also to
Time multiplexed data streams 231, 232, and 233 represent N/5 output signals from the multiplexers 180. As illustrated, the first bit of each channel 1–5 are interleaved temporally to produce the mutliplexed data stream 231; the first bit of each channel 6–10 are interleaved temporally to produce the multiplexed data stream 232, and so on. The N/5 multiplexed data streams 231, 232, and 233 are applied to the buss 150. In the example, the buss 150 is J bits wide and the bits are applied in order, J bits per buss cycle, to the five respective buss lines (represented by data streams 240, 242, 244) from the leading end of the multiplexed data streams 121, 122, and 123. The data then on buss 150 is read into a first portion 250, 254 of each of K RAMS 145 to create an identical image in each such first portion 250, 254. The first portion 250, 254 is filled up when N bits are written into them. Then, the address controllers 121–124 read from second portions 252, 256 of the RAMs 145 and respective bit selectors 140 generate the output streams on output channels 160 according to the outputs to be mapped to the respective inputs. The bitstreams 270 and 272 represent the multiplexed streams on output channels 160. After a block of N bits is written to the first portions 250, 254 of the RAMS 145, they switch roles with the second portions 252, 256 and are read while the second portions 250 and 256 are written to. The two portions 252, 256 and 250, 254 alternate between read and write continuously as data is fed through.
Although in the embodiment described above, a single bit from each input channel is read into RAMs 145 before the first and second portions 252, 256 and 250, 254 switch roles, it is obvious that this can be done on any desired schedule as desired. That is, more than one bit input per channel 1-N could be buffered in the RAMs 145. Also, where some channels are characterized by a higher data rate that others, the number of bits buffered in the RAMs 145 need not be the same for each channel 1-N.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Number | Name | Date | Kind |
---|---|---|---|
3761894 | Pile et al. | Sep 1973 | A |
3967070 | Srivastava et al. | Jun 1976 | A |
4301531 | Lubin | Nov 1981 | A |
4320501 | Le Dieu et al. | Mar 1982 | A |
4759010 | Murata et al. | Jul 1988 | A |
4905226 | Kobayashi | Feb 1990 | A |
4941141 | Hayano | Jul 1990 | A |
5130979 | Ohtawa | Jul 1992 | A |
5282196 | Clebowicz | Jan 1994 | A |
5311517 | Senoo | May 1994 | A |
5612633 | Kean | Mar 1997 | A |
5613132 | Clift et al. | Mar 1997 | A |
5646545 | Trimberger et al. | Jul 1997 | A |
5841771 | Irwin et al. | Nov 1998 | A |
5892760 | Athenes et al. | Apr 1999 | A |
5909125 | Kean | Jun 1999 | A |
5933023 | Young | Aug 1999 | A |
5978260 | Trimberger et al. | Nov 1999 | A |
6016315 | Chambers et al. | Jan 2000 | A |
6072796 | Christensen et al. | Jun 2000 | A |
6157751 | Olson et al. | Dec 2000 | A |
6208641 | Ruuskanen et al. | Mar 2001 | B1 |
6430180 | Bohm et al. | Aug 2002 | B1 |
Number | Date | Country |
---|---|---|
WO9709839 | Mar 1997 | WO |
Number | Date | Country | |
---|---|---|---|
20020075864 A1 | Jun 2002 | US |