US4891808A - Self-synchronizing multiplexer - Google Patents

Self-synchronizing multiplexer Download PDF

Info

Publication number
US4891808A
US4891808A US07/138,663 US13866387A US4891808A US 4891808 A US4891808 A US 4891808A US 13866387 A US13866387 A US 13866387A US 4891808 A US4891808 A US 4891808A
Authority
US
United States
Prior art keywords
channel
bit
multiplexer
data
inputs
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.)
Expired - Lifetime
Application number
US07/138,663
Inventor
Arthur B. Williams
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tellabs Operations Inc
Original Assignee
Coherent Communications Systems Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Coherent Communications Systems Corp filed Critical Coherent Communications Systems Corp
Priority to US07/138,663 priority Critical patent/US4891808A/en
Assigned to COHERENT COMMUNICATION SYSTEMS CORP. reassignment COHERENT COMMUNICATION SYSTEMS CORP. ASSIGNMENT OF ASSIGNORS INTEREST. Assignors: WILLIAMS, ARTHUR B.
Application granted granted Critical
Publication of US4891808A publication Critical patent/US4891808A/en
Assigned to TELLABS OPERATIONS, INC. reassignment TELLABS OPERATIONS, INC. MERGER (SEE DOCUMENT FOR DETAILS). Assignors: COHERENT COMMUNICATIONS SYSTEMS CORPORATION
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/04Distributors combined with modulators or demodulators
    • H04J3/047Distributors with transistors or integrated circuits
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/06Synchronising arrangements
    • H04J3/0602Systems characterised by the synchronising information used
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/06Synchronising arrangements
    • H04J3/0635Clock or time synchronisation in a network
    • H04J3/0685Clock or time synchronisation in a node; Intranode synchronisation

Definitions

  • This invention relates to the field of multiplexers operable in time divisions to transmit sampled data from a plurality of parallel input channels on a serial signal line, and to recover the parallel data from the serial signal line. More particularly, the invention relates to such a multiplexer and demultiplexer wherein means are provided to check the recovered data and to re-synchronize the channels such that the respective parallel inputs and outputs always correspond correctly. In the event of disturbance, the sequence of outputs is automatically corrected, without the need to employ framing or stop bits to precede or space frames of sampled data.
  • a variety of digital multiplexers are known wherein parallel input channels are sampled and the content of each sampled channel is placed in turn on a serial output during a time division corresponding to that channel.
  • a counter at the input end repetitively cycles through the channels in order.
  • Gates responsive to the clock are operable for gating the signal on each channel through to the serial signal line during its respective time division.
  • the data is recovered at a receive end by an apparatus operating in the reverse, that is by dividing the serial stream into the individual samples and routing the samples in turn to respective parallel output channels.
  • One pass through all the channels is called a frame.
  • extra transmitted bits or a time lapse are inserted to mark the start and/or stop of a frame.
  • the clock used for de-multiplexing serial data can be derived directly from the data itself. Notwithstanding expected variations in data, over time a phase-locked loop control can derive the sampling clock from the sampled data. While systems of this type are reasonably effective at serializing the parallel data and converting the received serial transmission back into parallel channels, it sometimes happens that the proper order of channels becomes disturbed.
  • Known time division multiplexers synchronize the input and output channels based on the framing or synchronization bits preceding or following the frame.
  • a synchronizing marker is added directly over the data for at least one given channel to be used as a marked or synchronizing channel.
  • the marker is arranged as an "impossible" data pattern and during multiplexing the marker is inserted over a predetermined data pattern on the given channel.
  • the marker pattern is detected and the correct pattern replaced, provided the marker was found in the data for the given channel. Otherwise the sequence of channel demultiplexing is reset. This technique does not require that a gap be opened or that available time divisions be devoted to transmission of extra framing characters.
  • the invention takes advantage of the fact that the multiplexer samples incoming data streams at a rate substantially higher than the frequency at which digital levels change in the data. Where the sampling rate is higher than the rate of change of the data, a group of unchanged bits are transmitted during successive samples for a given input channel.
  • the middle bit is inverted. This impossible data pattern 1-0-1 becomes a marker for that channel. Should the inverted bit be detected in a channel other than the marked one, then the receiver section of the multiplexer/demultiplexer can be reset to re-synchronize the parallel inputs to the parallel outputs, whereupon correct operation resumes.
  • the present invention puts a signalling bit directly into the data, the data being represented by a plurality of samples at the higher sampling rate.
  • the signalling bits need not use up time divisions and need not appear during every transmitted frame.
  • a central bit is inverted and used as a marker for this one channel.
  • the mark channel is the channel transmitted at the beginning of a frame of sampled channels. Accordingly, whenever the marker bit is detected, the counter or the like that advances the demultiplexer through the respective channels when converting the data from serial to parallel can be simply reset.
  • the invention is advantageously embodied as a two channel multiplexer.
  • the means cycling through the input channels i.e., the two parallel inputs
  • a counter and a one-of-n decoder can provide sequencing to gate through samples of the parallel inputs to the serial bit stream.
  • additional flip flops defining an input shift register are provided such that the successive samples for a particular channel, i.e. the synchronizing channel, are stored and compared to a predetermined pattern arranged for insertion of a marker bit.
  • the invention accomplishes synchronization automatically and with minimum of overhead and complexity.
  • FIG. 1 is a schematic illustration of a transmitting (multiplexing) section of a multiplexer/demultiplexer according to the invention.
  • FIG. 2 is a schematic illustration of a receiving (demultiplexing) section according to the invention, operative together with the transmitting section of FIG. 1.
  • FIG. 3 is a schematic diagram of a practical embodiment of a transmit section according to the invention, for a dual channel multiplexer.
  • FIG. 4 is a practical embodiment of a dual channel multiplexer receive section, operable with the embodiment of FIG. 3.
  • FIG. 5 is a timing diagram showing the insertion of timing marker bits in accordance with the embodiment of FIGS. 3 and 4.
  • FIG. 1 A general schematic illustration of the invention is shown in FIG. 1.
  • Digital input signals from a plurality of parallel inputs 22, 24, 26, 28, labelled A through D are to be serialized in time divisions and output on single transmit line 32.
  • the signal on each input line 22, 24, 26, 28 is sampled in turn and via gating the signal at the time of sampling occupies a time division in the serial output signal on transmit line 32.
  • a clock oscillator 30, which may or may not be synchronous with the signals on the input channels, drives ring counter 34, having a plurality of outputs, only one of which outputs is active at any moment.
  • Counter 34 may be connected to a one-of-four decoder, or the counter and decoder can be replaced by a shift register in which a single logical-true bit is shifted through a plurality of flip flops such that the output lines leading to the clock inputs of channel flip flops 36 and to multiplexer channel gates 44 are active one at a time, during their respective time divisions.
  • a given channel When a given channel is selected, its value is loaded into flip flop 36 on that channel, the output of which is likewise gated through via gate 44.
  • An output OR gate 42 then combines the sequentially sampled outputs of multiplexer channel gates 44 into a single serial output signal, labelled "transmit" in FIG. 1.
  • the device of the invention like a typical multiplexer, interleaves parallel binary channel data for transmission as a serial stream which later is separated again into parallel binary channels.
  • the invention also characteristically marks data passing through at least one of the input channels 22, 24, 26, 28 (i.e, channel 22 in the embodiment illustrated in FIG. 1), such that a demultiplexing device at the receive end can always correctly route the serial data to the correct channels, without insertion of start/stop bits, spaces or other characters that would occupy time periods during the time otherwise available for time divisions devoted to data.
  • the device of the invention is especially suited for multiplexing together independent lower speed asynchronous data channels by over sampling them at a higher synchronous speed.
  • the device is relatively uncomplicated to implement, particularly where the number of channels is small. In an embodiment for two channels, the invention can be very economically realized.
  • the present invention proposes to mark one or more of the input channels by transmitting an unnatural data pattern, for example a pattern characteristic of a data rate much higher than expected, which is detected and corrected at the receiving end provided the channels are sequencing correctly.
  • an unnatural data pattern for example a pattern characteristic of a data rate much higher than expected
  • three consecutive mark (logical one) samples of a particular oversampled input channel are detected at the transmit end and the middle sample is inverted to space (logical zero).
  • the 1-0-1 pattern cannot occur in correctly sampled data because it implies a rate of change of data equal to or greater than the sampling rate, which is expected to be much higher than the asynchronous data rate. Therefore, this marking signal can be dependably detected and corrected at the receive end.
  • At least one of the input channels 22 is provided with a bit register 50, which stores a plurality of sequential samples for that one channel.
  • the bit register is a simple shift register made of serial D-flip flops clocked when the channel is sampled.
  • the Q outputs (i.e., the high true outputs) of the D-flip flops are connected as inputs to a digital comparator 52.
  • Comparator 52 compares the bit pattern on the A channel stored in bit register 52, to a predetermined value, for example 1-1-1.
  • a predetermined pattern e.g., three consecutive mark samples
  • the low-true output of comparator 52 which would normally allow data from the A register to pass through the multiplexer channel-select gates 44 and thereafter to output OR gate 42, forces flip flop 36 to be loaded with a zero. Accordingly, whenever there are three consecutive mark samples on channel A, the middle mark is inverted to space.
  • Comparator 52 is illustrated generally in FIG. 1 as a digital comparator comparing the contents of bit register 50 to a pattern of 1-1-1, the other inputs to the comparator being connected to logical 1. It will be appreciated that in the illustrated example, the comparison to all ones is equivalent to operation of a NAND gate having three inputs connected respectively to the outputs of the D-flip flops in bit register 50. Accordingly, provided the selected data pattern is 1-1-1, the comparator can be replaced by a three input NAND gate.
  • FIG. 2 shows a generalized receive section operable with the transmit section of FIG. 1.
  • the data received during each successive time division on the serial input line 80 is to be routed to a next one of the output channels A, B, C and D, which are connected as parallel outputs 122, 124, 126, 128.
  • a ring counter 84 having one output true at any one time, loads the signal from serial receive input 80 into a respective one of the receive section input D-flip flops which comprise the inputs to bit registers 90, 92, 94, 96 on each of the channels A through D, respectively.
  • the ring counter activates a given output, connected as the clock input to one of the receive input section D-flip flops, the signal on serial receive line 80 at that moment is simply loaded into that flip flop.
  • Ring counter 84 can be driven from a clock signal derived from the data on receive line 80, for example by a phase-locked loop clock generator 329.
  • Each of the receive section channels A through D has a bit register and a digital comparator.
  • the bit register stores three consecutive samples and in each case the forced, unnatural bit pattern (e.g., 101) is detected in the bit register by any of the channels.
  • the properly marked channel (channel A in the disclosed embodiment) is expected to have this marker bit set while the other channels are not. Accordingly, when the channel A detector has a 1-0-1 marked pattern, the middle bit is simply inverted at the receive section and the output is shifted onto parallel output 122. However, should one of the other channels detect this unnatural marking code 1-0-1, then the device is not sequencing the channels correctly because only the predetermined channel has been marked.
  • the output of any of the digital comparators detecting the marker pattern other than the marked channel A is routed through an OR gate 114 to reset ring counter 84.
  • the multiplexer is always self synchronizing and will return to proper synchronization every time a marked bit is detected, which may occur repeatedly during sampling.
  • the bit register in the receive section as illustrated in FIG. 2 is similar to the bit register in the transmit section. However, the outputs of the bit register in the receive section are connected such that the inverted output of the middle shift register is used. Accordingly, the comparator again can be embodied as a NAND gate, with the result that the ring counter 84 will be reset whenever the 1-0-1 pattern appears on the bit register Q output.
  • the invention can be applied to any number of channels but is especially effective and easy to implement in a two channel multiplexer.
  • the transmit and receive sections can be embodied in a minimum number of logic components, as shown in FIGS. 3 and 4.
  • FIG. 3 shows a logic diagram of an implementation of the transmit section in two channels.
  • BPS bits per second
  • the instantaneous levels on input 201 for channel A and input 202 for channel B are loaded respectively into flip flops 203 and 204 at alternate times by using different edges of the transmit clock signal.
  • Flip flops 203 and 204 can be positive edge triggered D-flip flops, and can be clocked, for example, by dividing by two the incoming 19.2 KHz transmit clock signal 205 using flip flop 206, which is connected to toggle every time a transition occurs on its input clock line. Since the clock signals for positive edge triggered flip flops 203 and 204 are complementary, the asynchronous input channels 201 and 202 are sampled alternately.
  • the illustrated circuit will insert a space between the first and last marks of any three consecutive marks on channel A.
  • Channel B data is simply clocked through the system during its proper time divisions.
  • Flip flops 203, 207 and 208 form a bit register 250.
  • the flip flops of the shift register are also driven by the 9,600 Hz clock, such that each bit is delayed by one clock period as compared to the B channel. Therefore, the Q outputs of flip flops 207, 203 and 208 represent a given sample of channel A, the next subsequent sample and the next previous sample, respectively.
  • the output of flip flop 207 is gated through NAND gates 209 and 210 and becomes one of the inputs of AND gate 211. At this point, if the data sample was a mark, the logic level at the input to gate 211 would be logic one.
  • the channel B output sample of flip flop 204 is gated through NAND gates 212 and 210, and becomes the input of AND gate 211, i.e., the same input formerly carrying the channel A data. Assuming that the other input to gate 211 is a logic one as a result of a prior preset of flip flop 214, the channel B sample appears at the output 211 and is transmitted along the serial line.
  • Three input NAND gate 213 is responsive to the instantaneous channel A data sample (i.e., the output of flip flop 207, which is also an input to NAND gate 209) as well as the subsequent and previous samples, on flip flops 203 and 208. If all three of the samples are at mark (logic one), the output of NAND gate 13 is low and will reset the flip flop 214 at the next occurrence of the 4,800 signal.
  • Flip flop 215 operates in the toggle mode and divides out the 4,800 (i.e., 4,800 Hz) signal from the 9,600 signal.
  • a time delay block 216 provides a slight propagation delay to ensure stabilization of the D input to flip flop 214 prior to the positive clock transition.
  • the propagation delay can be provided, for example, by a pair of serially-connected inverters or the like. For every alternate sample of the channel A input according to the invention, the output of three input NAND gate 213 is clocked into flip flop 214 by the output of flip flop 215.
  • NAND gate 213 If the output of NAND gate 213 is low (indicating that all three samples at the output of shift registers 203, 207 and 208 are at mark (logic one)), the output of flip flop 214 goes low thus over-riding the mark gated through NAND gates 209 and 210 and forcing a space (logic zero) at the output of AND gate 211.
  • flip flop 214 When the 9,600 signal goes low, flip flop 214 is preset, forcing a logic one at its output and eliminating the forced output space. The output of the transmit section then reflects the B channel data, appearing at the Q output of flip flop 204.
  • the multiplexer transmitting section alternately samples input channels A and B and interleaves the samples in time divisions at the output.
  • a logical zero or space is forced for the A channel sample, provided that the specific sample was a mark (logical one) and that the preceding and subsequent A channel samples were also marks. Since the sampling rate is normally much higher than the data rate (in this case 9,600 Hz versus 1,200 BPS), the space forced to occur during the mark interval is only approximately an eighth of a data bit in duration.
  • the marker is a unique occurrence that cannot occur in the incoming channel A data stream, which is presumed to be clean edged.
  • the output stream of the transmit section consists of alternate sampled bits for both the high and low states of the sampling clock 9,600. Therefore, the actual output bit rate is twice that clock rate (i.e., 19.2K BPS in the illustrated embodiment) because two bits are transmitted per clock period.
  • the corresponding receive section for the multiplexer is shown in FIG. 4.
  • the receive data arriving at 19.2K BPS on serial input line 317 is to be directed bit by bit alternately into the A and B channels, whereupon the data will again pass into parallel asynchronous data channels, as close as possible to the data which was initially at the input to the transmit section.
  • the 19.2K BPS receive data signal on line 317 and its associated clock 318 are applied to flip flops 319 and 320 respectively.
  • the positive edge of the receive clock 318 occurs during the center of the receive data bit 317.
  • the serially-connected flip flops 319, 326, 327, clocked by the 9,600 signal, and flip flops 321, 322, 323 clocked by the inverted version of the 9,600 signal are shift registers that store three successive samples of data on each of the A and B channels.
  • Flip flop 320 operates in the toggle mode and generates the 9,600 and the inverted 9,600 clocks.
  • Flip flops 319 and 321 sample the receive data at the positive edges of their respective clocks, which are directly out of phase. Therefore, adjacent data bits on the 19.2K BPS receive data line are alternately sampled by flip flops 319 and 321, thus separating the serial data into two data streams and reversing the interleaving process that occurred in the transmit section.
  • Flip flops 321, 322, 323 and 319, 326, 327, each forming a three stage shift register, will simply advance the data along bit by bit with the occurrence of clock transitions.
  • the invention immediately corrects this ambiguity whenever it occurs. If the original channel A data stream during initiation (or other malfunction) is presented on the intended channel B path, then three input NAND gate 324 will detect the occurrence of a space sample bit preceded and followed by a mark sample (i.e., 1-0-1), namely the impossible pattern which is used to characteristically mark the A channel. The output of NAND gate 324 will then momentarily go low, thus changing the state of the output of toggle flip flop 320 and in effect resetting flip flop 320 to refer this data to the A channel rather than the B channel and therefore automatically re-synchronizing the receive section.
  • a mark sample i.e., 1-0-1
  • flip flop 322 After a slight propagation delay, effected for example by delay means 325, flip flop 322 is preset, thus forcing the output of three input NAND gate 324 back to logic one. The channel B data stream then correctly appears at the output of flip flop 323 and demultiplexing proceeds correctly.
  • flip flop 320 acts as a two state counter, which is reset upon detection of a marked data progression occurring in the B channel.
  • flip flops 319, 326 and 327 form a three stage shift register in the channel A path.
  • FIG. 5 illustrates a characteristic timing diagram for the transmit and receive sections according to the invention.
  • the A and B channels are asynchronous and have a characteristic rate of change substantially slower than the sampling rate, which sampling rate is shown by the scale marks on the time scale.
  • the MUX signal is developed.
  • a marker bit is available and can be inverted without adding uncertainty, as a means to ensure the correct synchronization or channel order of demultiplexing.
  • the invention can be embodied using any number of channels, provided the sampling rate is sufficiently higher than the characteristic rate of change of data that at least three unchanged samples can be expected to occur in the sample data during a single data bit.
  • the same procedure also can be used, for example with a larger number of unchanged samples in the event that the sampling rate exceeds the data rate by a larger ratio.

Abstract

A time division multiplexer is operable to sample data on parallel input channels at a sampling rate at least twice the data rate, to serially transmit the data for each channel in a respective time division, and to recover the data at a receive end. The multiplexer is provided with a bit storage register for successive samples on at least one input channel to be used as a marker channel. Gating connected to the bit storage register forces a detectable unnatural data pattern on the transmitted data for that channel whenever a predetermined bit pattern is stored for that channel. According to one embodiment, when a plurality of unchanged levels (e.g., binary one) appear in the bit storage register, a central bit is inverted to thereby mark that channel. The inverted marker bit is detected and cancelled at the receive end and/or is used to reset the channel counter if detected on a channel other than the marker channel.

Description

BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to the field of multiplexers operable in time divisions to transmit sampled data from a plurality of parallel input channels on a serial signal line, and to recover the parallel data from the serial signal line. More particularly, the invention relates to such a multiplexer and demultiplexer wherein means are provided to check the recovered data and to re-synchronize the channels such that the respective parallel inputs and outputs always correspond correctly. In the event of disturbance, the sequence of outputs is automatically corrected, without the need to employ framing or stop bits to precede or space frames of sampled data.
2. Prior Art
A variety of digital multiplexers are known wherein parallel input channels are sampled and the content of each sampled channel is placed in turn on a serial output during a time division corresponding to that channel. For example, a counter at the input end repetitively cycles through the channels in order. Gates responsive to the clock are operable for gating the signal on each channel through to the serial signal line during its respective time division. The data is recovered at a receive end by an apparatus operating in the reverse, that is by dividing the serial stream into the individual samples and routing the samples in turn to respective parallel output channels. One pass through all the channels is called a frame. Typically, extra transmitted bits or a time lapse are inserted to mark the start and/or stop of a frame.
According to some data transmission techniques, the clock used for de-multiplexing serial data can be derived directly from the data itself. Notwithstanding expected variations in data, over time a phase-locked loop control can derive the sampling clock from the sampled data. While systems of this type are reasonably effective at serializing the parallel data and converting the received serial transmission back into parallel channels, it sometimes happens that the proper order of channels becomes disturbed. Known time division multiplexers synchronize the input and output channels based on the framing or synchronization bits preceding or following the frame.
Additional framing procedures and codes such as inserted gaps, start/stop characters and the like, use time that could be employed for higher frequency sampling and better multiplexing effectiveness. The framing bits or characters are normally inserted and detected using additional circuitry that increases the expense of the multiplexer and reduces the efficiency of the overall device. The present invention avoids the need for extra time devoted to start/stop signalling. A synchronizing marker is added directly over the data for at least one given channel to be used as a marked or synchronizing channel. The marker is arranged as an "impossible" data pattern and during multiplexing the marker is inserted over a predetermined data pattern on the given channel. At the demultiplexing end the marker pattern is detected and the correct pattern replaced, provided the marker was found in the data for the given channel. Otherwise the sequence of channel demultiplexing is reset. This technique does not require that a gap be opened or that available time divisions be devoted to transmission of extra framing characters.
The invention takes advantage of the fact that the multiplexer samples incoming data streams at a rate substantially higher than the frequency at which digital levels change in the data. Where the sampling rate is higher than the rate of change of the data, a group of unchanged bits are transmitted during successive samples for a given input channel. According to the invention, when a predetermined succession of bits is detected during successive samples on a specific channel to be used as a marked channel, for example three unchanged ones in the binary stream, the middle bit is inverted. This impossible data pattern 1-0-1 becomes a marker for that channel. Should the inverted bit be detected in a channel other than the marked one, then the receiver section of the multiplexer/demultiplexer can be reset to re-synchronize the parallel inputs to the parallel outputs, whereupon correct operation resumes.
It is known in the art to insert supervisory signalling or framing bits in extra time slots made available therefor in a digital signal. Reference can be made, for example, to U.S. Pat. Nos. 3,936,609-Waldeck (inserts alarm bits); 3,748,393-Baxter (use extra bit spaces for signalling); 3,873,776-Smith, Jr. et al (insert alarm pulse). These patents use available time which could be used for data transmission, or require extra circuitry to detect when time is available, perhaps compressing the data, and then to insert signalling codes.
It is also known in the art to employ a particular code as a start or stop signal. In U.S. Pat. No. 4,243,930-DeCoursey, for example, three successive zero bits are used to define a time space between frames, for synchronizing the output and the input. Other examples along these lines can be found in U.S. Pat. Nos. 4,538,386-McNesby et al; 3,970,799-Colton et al, and in other disclosures. These also require that time be devoted to the start/stop codes. General purpose bit sampling multiplexers can be found, for example in U.S. Pat. Nos. 3,840,705-Haskett et al and 4,310,922-Lichtenberger.
In U.S. Pat. No. 3,995,120-Pachynski, Jr., the idea is disclosed that where the sampling rate is much higher than the average rate of data change, it is possible to compress the data and thereby open up additional time for signalling. Where the data rate is slower than the sampling rate, Pachynski bunches together samples, leaving a time space before and after the frame of active data channels, for use as signalling and/or framing bits.
Each of the foregoing prior art disclosures has means to accomplish multiplexing and means to retain the proper order of the channels when demultiplexing. However, all do so in ways that require substantial additional circuitry and/or take up time for framing or synchronizing signals. The present invention on the other hand puts a signalling bit directly into the data, the data being represented by a plurality of samples at the higher sampling rate. The signalling bits need not use up time divisions and need not appear during every transmitted frame. Each time the predetermined pattern (e.g., a string of unchanged high levels) appears in the successive samples for the marking one of the parallel inputs, a central bit is inverted and used as a marker for this one channel. Preferably, the mark channel is the channel transmitted at the beginning of a frame of sampled channels. Accordingly, whenever the marker bit is detected, the counter or the like that advances the demultiplexer through the respective channels when converting the data from serial to parallel can be simply reset.
The invention is advantageously embodied as a two channel multiplexer. In this event, the means cycling through the input channels (i.e., the two parallel inputs) can be as simple as a flip flop. In a device in which a large number of channels are used, a counter and a one-of-n decoder can provide sequencing to gate through samples of the parallel inputs to the serial bit stream. Preferably, additional flip flops defining an input shift register are provided such that the successive samples for a particular channel, i.e. the synchronizing channel, are stored and compared to a predetermined pattern arranged for insertion of a marker bit. The invention accomplishes synchronization automatically and with minimum of overhead and complexity.
BRIEF DESCRIPTION OF THE DRAWINGS
There are shown in the drawings examples of embodiments of the invention as presently preferred. It should be understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown in the drawings, wherein:
FIG. 1 is a schematic illustration of a transmitting (multiplexing) section of a multiplexer/demultiplexer according to the invention.
FIG. 2 is a schematic illustration of a receiving (demultiplexing) section according to the invention, operative together with the transmitting section of FIG. 1.
FIG. 3 is a schematic diagram of a practical embodiment of a transmit section according to the invention, for a dual channel multiplexer.
FIG. 4 is a practical embodiment of a dual channel multiplexer receive section, operable with the embodiment of FIG. 3.
FIG. 5 is a timing diagram showing the insertion of timing marker bits in accordance with the embodiment of FIGS. 3 and 4.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
A general schematic illustration of the invention is shown in FIG. 1. Digital input signals from a plurality of parallel inputs 22, 24, 26, 28, labelled A through D, are to be serialized in time divisions and output on single transmit line 32. As is typical of multiplexers generally, the signal on each input line 22, 24, 26, 28 is sampled in turn and via gating the signal at the time of sampling occupies a time division in the serial output signal on transmit line 32. A clock oscillator 30, which may or may not be synchronous with the signals on the input channels, drives ring counter 34, having a plurality of outputs, only one of which outputs is active at any moment. Counter 34 may be connected to a one-of-four decoder, or the counter and decoder can be replaced by a shift register in which a single logical-true bit is shifted through a plurality of flip flops such that the output lines leading to the clock inputs of channel flip flops 36 and to multiplexer channel gates 44 are active one at a time, during their respective time divisions. When a given channel is selected, its value is loaded into flip flop 36 on that channel, the output of which is likewise gated through via gate 44. An output OR gate 42 then combines the sequentially sampled outputs of multiplexer channel gates 44 into a single serial output signal, labelled "transmit" in FIG. 1.
The device of the invention, like a typical multiplexer, interleaves parallel binary channel data for transmission as a serial stream which later is separated again into parallel binary channels. Unlike typical multiplexers, however, the invention also characteristically marks data passing through at least one of the input channels 22, 24, 26, 28 (i.e, channel 22 in the embodiment illustrated in FIG. 1), such that a demultiplexing device at the receive end can always correctly route the serial data to the correct channels, without insertion of start/stop bits, spaces or other characters that would occupy time periods during the time otherwise available for time divisions devoted to data.
The device of the invention is especially suited for multiplexing together independent lower speed asynchronous data channels by over sampling them at a higher synchronous speed. The device is relatively uncomplicated to implement, particularly where the number of channels is small. In an embodiment for two channels, the invention can be very economically realized.
According to the invention, it is recognized that due to the higher speed sampling of the asynchronous data channels, certain characteristic data patterns will not occur during proper operation of the multiplexer. Specifically, in such an over sampling technique, a change of state substantially shorter than the period of the maximum rate of change of the asynchronous data will not occur on any of the sample data channels. This fact is true provided the digital data has reasonably clean bounce-free pulses, for example as typical of digital circuits and not typical of switch closure outputs. Inasmuch as the asynchronous data has a maximum rate of change that still is much slower than the sampling rate, it can be expected that a plurality of identical samples will occur on either side of any transition in the data. Accordingly, without creating any additional jitter or distortion and without substantial additional overhead, the present invention proposes to mark one or more of the input channels by transmitting an unnatural data pattern, for example a pattern characteristic of a data rate much higher than expected, which is detected and corrected at the receiving end provided the channels are sequencing correctly. In the illustrated example, three consecutive mark (logical one) samples of a particular oversampled input channel are detected at the transmit end and the middle sample is inverted to space (logical zero). The 1-0-1 pattern cannot occur in correctly sampled data because it implies a rate of change of data equal to or greater than the sampling rate, which is expected to be much higher than the asynchronous data rate. Therefore, this marking signal can be dependably detected and corrected at the receive end.
According to the invention as illustrated in FIG. 1, at least one of the input channels 22 is provided with a bit register 50, which stores a plurality of sequential samples for that one channel. Whenever the channel select output of ring counter 34 leading to channel 22 is activated, the instantaneous logical value at channel 22 is sampled (i.e., the high or low level is loaded into the initial flip flop in the bit register), and the previous samples are shifted one space towards the transmit output. The bit register is a simple shift register made of serial D-flip flops clocked when the channel is sampled. The Q outputs (i.e., the high true outputs) of the D-flip flops are connected as inputs to a digital comparator 52. Comparator 52 compares the bit pattern on the A channel stored in bit register 52, to a predetermined value, for example 1-1-1. When the predetermined pattern (e.g., three consecutive mark samples) is detected, the low-true output of comparator 52, which would normally allow data from the A register to pass through the multiplexer channel-select gates 44 and thereafter to output OR gate 42, forces flip flop 36 to be loaded with a zero. Accordingly, whenever there are three consecutive mark samples on channel A, the middle mark is inverted to space.
Comparator 52 is illustrated generally in FIG. 1 as a digital comparator comparing the contents of bit register 50 to a pattern of 1-1-1, the other inputs to the comparator being connected to logical 1. It will be appreciated that in the illustrated example, the comparison to all ones is equivalent to operation of a NAND gate having three inputs connected respectively to the outputs of the D-flip flops in bit register 50. Accordingly, provided the selected data pattern is 1-1-1, the comparator can be replaced by a three input NAND gate.
Downstream of the transmit section along the signal path as shown in FIG. 1, the signals on input channels A, B, and C and D occupy time divisions on the transmit output 32. However, the middle one of any three consecutive mark samples on channel A is transmitted as a space. FIG. 2 shows a generalized receive section operable with the transmit section of FIG. 1. On the receive side of the multiplexer, the data received during each successive time division on the serial input line 80 is to be routed to a next one of the output channels A, B, C and D, which are connected as parallel outputs 122, 124, 126, 128. In a manner similar to the transmit section, a ring counter 84 having one output true at any one time, loads the signal from serial receive input 80 into a respective one of the receive section input D-flip flops which comprise the inputs to bit registers 90, 92, 94, 96 on each of the channels A through D, respectively. When the ring counter activates a given output, connected as the clock input to one of the receive input section D-flip flops, the signal on serial receive line 80 at that moment is simply loaded into that flip flop. Ring counter 84 can be driven from a clock signal derived from the data on receive line 80, for example by a phase-locked loop clock generator 329.
Each of the receive section channels A through D has a bit register and a digital comparator. The bit register stores three consecutive samples and in each case the forced, unnatural bit pattern (e.g., 101) is detected in the bit register by any of the channels. The properly marked channel (channel A in the disclosed embodiment) is expected to have this marker bit set while the other channels are not. Accordingly, when the channel A detector has a 1-0-1 marked pattern, the middle bit is simply inverted at the receive section and the output is shifted onto parallel output 122. However, should one of the other channels detect this unnatural marking code 1-0-1, then the device is not sequencing the channels correctly because only the predetermined channel has been marked. The output of any of the digital comparators detecting the marker pattern other than the marked channel A, is routed through an OR gate 114 to reset ring counter 84. In this manner, the multiplexer is always self synchronizing and will return to proper synchronization every time a marked bit is detected, which may occur repeatedly during sampling.
The bit register in the receive section as illustrated in FIG. 2 is similar to the bit register in the transmit section. However, the outputs of the bit register in the receive section are connected such that the inverted output of the middle shift register is used. Accordingly, the comparator again can be embodied as a NAND gate, with the result that the ring counter 84 will be reset whenever the 1-0-1 pattern appears on the bit register Q output.
The invention can be applied to any number of channels but is especially effective and easy to implement in a two channel multiplexer. In this case, the transmit and receive sections can be embodied in a minimum number of logic components, as shown in FIGS. 3 and 4.
FIG. 3 shows a logic diagram of an implementation of the transmit section in two channels. The two input channels A and B, on inputs 201, 202, both for example at 1200 bits per second (BPS), and asynchronous with one another, are oversampled and combined into a serial output at 19.2K BPS. These examples are meant to be illustrative, and other data rates and situations are also possible.
The instantaneous levels on input 201 for channel A and input 202 for channel B, are loaded respectively into flip flops 203 and 204 at alternate times by using different edges of the transmit clock signal. Flip flops 203 and 204 can be positive edge triggered D-flip flops, and can be clocked, for example, by dividing by two the incoming 19.2 KHz transmit clock signal 205 using flip flop 206, which is connected to toggle every time a transition occurs on its input clock line. Since the clock signals for positive edge triggered flip flops 203 and 204 are complementary, the asynchronous input channels 201 and 202 are sampled alternately.
The alternate sampling of the asynchronous input channels will necessarily result in a certain ambiguity or distortion because transitions on inputs 201, 202 must await their positive clock edges before appearing in the output. This distortion is also known as jitter. The general formula for distortion of such a circuit is: ##EQU1## Applying the general formula to the present situation, an ambiguity or distortion of 12.5% is expected (1/9600÷1/1200=1200/9600=12.5%).
The illustrated circuit will insert a space between the first and last marks of any three consecutive marks on channel A. Channel B data is simply clocked through the system during its proper time divisions.
Flip flops 203, 207 and 208 form a bit register 250. The flip flops of the shift register are also driven by the 9,600 Hz clock, such that each bit is delayed by one clock period as compared to the B channel. Therefore, the Q outputs of flip flops 207, 203 and 208 represent a given sample of channel A, the next subsequent sample and the next previous sample, respectively. When the 9,600 signal is high, the output of flip flop 207 is gated through NAND gates 209 and 210 and becomes one of the inputs of AND gate 211. At this point, if the data sample was a mark, the logic level at the input to gate 211 would be logic one.
When 9,600 is low (i.e., when 9,600 or "not 9,600" is high), the channel B output sample of flip flop 204 is gated through NAND gates 212 and 210, and becomes the input of AND gate 211, i.e., the same input formerly carrying the channel A data. Assuming that the other input to gate 211 is a logic one as a result of a prior preset of flip flop 214, the channel B sample appears at the output 211 and is transmitted along the serial line.
Three input NAND gate 213 is responsive to the instantaneous channel A data sample (i.e., the output of flip flop 207, which is also an input to NAND gate 209) as well as the subsequent and previous samples, on flip flops 203 and 208. If all three of the samples are at mark (logic one), the output of NAND gate 13 is low and will reset the flip flop 214 at the next occurrence of the 4,800 signal.
Flip flop 215 operates in the toggle mode and divides out the 4,800 (i.e., 4,800 Hz) signal from the 9,600 signal. A time delay block 216 provides a slight propagation delay to ensure stabilization of the D input to flip flop 214 prior to the positive clock transition. The propagation delay can be provided, for example, by a pair of serially-connected inverters or the like. For every alternate sample of the channel A input according to the invention, the output of three input NAND gate 213 is clocked into flip flop 214 by the output of flip flop 215. If the output of NAND gate 213 is low (indicating that all three samples at the output of shift registers 203, 207 and 208 are at mark (logic one)), the output of flip flop 214 goes low thus over-riding the mark gated through NAND gates 209 and 210 and forcing a space (logic zero) at the output of AND gate 211.
When the 9,600 signal goes low, flip flop 214 is preset, forcing a logic one at its output and eliminating the forced output space. The output of the transmit section then reflects the B channel data, appearing at the Q output of flip flop 204.
As a result of the foregoing circuits, the multiplexer transmitting section alternately samples input channels A and B and interleaves the samples in time divisions at the output. However, for every alternate sample, a logical zero or space is forced for the A channel sample, provided that the specific sample was a mark (logical one) and that the preceding and subsequent A channel samples were also marks. Since the sampling rate is normally much higher than the data rate (in this case 9,600 Hz versus 1,200 BPS), the space forced to occur during the mark interval is only approximately an eighth of a data bit in duration. Thus, the marker is a unique occurrence that cannot occur in the incoming channel A data stream, which is presumed to be clean edged.
The output stream of the transmit section consists of alternate sampled bits for both the high and low states of the sampling clock 9,600. Therefore, the actual output bit rate is twice that clock rate (i.e., 19.2K BPS in the illustrated embodiment) because two bits are transmitted per clock period.
The corresponding receive section for the multiplexer is shown in FIG. 4. In this case, the receive data arriving at 19.2K BPS on serial input line 317 is to be directed bit by bit alternately into the A and B channels, whereupon the data will again pass into parallel asynchronous data channels, as close as possible to the data which was initially at the input to the transmit section. As shown in FIG. 4, the 19.2K BPS receive data signal on line 317 and its associated clock 318, are applied to flip flops 319 and 320 respectively. The positive edge of the receive clock 318 occurs during the center of the receive data bit 317. As in the transmit section, the serially-connected flip flops 319, 326, 327, clocked by the 9,600 signal, and flip flops 321, 322, 323 clocked by the inverted version of the 9,600 signal, are shift registers that store three successive samples of data on each of the A and B channels.
Flip flop 320 operates in the toggle mode and generates the 9,600 and the inverted 9,600 clocks. Flip flops 319 and 321 sample the receive data at the positive edges of their respective clocks, which are directly out of phase. Therefore, adjacent data bits on the 19.2K BPS receive data line are alternately sampled by flip flops 319 and 321, thus separating the serial data into two data streams and reversing the interleaving process that occurred in the transmit section. Flip flops 321, 322, 323 and 319, 326, 327, each forming a three stage shift register, will simply advance the data along bit by bit with the occurrence of clock transitions. However, there is an ambiguity because during initiation of the device and/or following any disturbance that interferes with correct routing of the bits, there is nothing to ensure that the sequence is such that the next bit loaded into flip flop 319 is intended for channel A rather than channel B, or vice versa.
The invention immediately corrects this ambiguity whenever it occurs. If the original channel A data stream during initiation (or other malfunction) is presented on the intended channel B path, then three input NAND gate 324 will detect the occurrence of a space sample bit preceded and followed by a mark sample (i.e., 1-0-1), namely the impossible pattern which is used to characteristically mark the A channel. The output of NAND gate 324 will then momentarily go low, thus changing the state of the output of toggle flip flop 320 and in effect resetting flip flop 320 to refer this data to the A channel rather than the B channel and therefore automatically re-synchronizing the receive section. After a slight propagation delay, effected for example by delay means 325, flip flop 322 is preset, thus forcing the output of three input NAND gate 324 back to logic one. The channel B data stream then correctly appears at the output of flip flop 323 and demultiplexing proceeds correctly.
It will be appreciated that according to the foregoing description, flip flop 320 acts as a two state counter, which is reset upon detection of a marked data progression occurring in the B channel. Similarly, flip flops 319, 326 and 327 form a three stage shift register in the channel A path. When a space sample is detected in the channel A path, preceded and followed by mark samples, the output of three input NAND gate 328 momentarily goes low, forcing a mark at the output of flip flop 326 and thus clearing the artificially-generated space sample inserted by the transmit section and restoring the output of NAND gate 328 to logic one. In this case it is not necessary to adjust the sequence because the marked data has occurred as expected in the A channel. Accordingly, the A channel simply corrects (unmarks) the data by eliminating the forced space.
FIG. 5 illustrates a characteristic timing diagram for the transmit and receive sections according to the invention. The A and B channels are asynchronous and have a characteristic rate of change substantially slower than the sampling rate, which sampling rate is shown by the scale marks on the time scale. As a result of sampling, the MUX signal is developed. At each occurrence of three consecutive marks in the A channel, as shown in the hatched pulses on the MUX signal, a marker bit is available and can be inverted without adding uncertainty, as a means to ensure the correct synchronization or channel order of demultiplexing.
The invention can be embodied using any number of channels, provided the sampling rate is sufficiently higher than the characteristic rate of change of data that at least three unchanged samples can be expected to occur in the sample data during a single data bit. The same procedure also can be used, for example with a larger number of unchanged samples in the event that the sampling rate exceeds the data rate by a larger ratio. A number of other possibilities and variations will now occur to persons skilled in the art made aware of this disclosure. Reference should be made to the appended claims rather than the foregoing specification as indicating the true scope of the invention.

Claims (17)

What is claimed is:
1. A multiplexer for transmitting time-varying signals from a plurality of parallel inputs over a serial path to a plurality of corresponding outputs, comprising:
means operable repetitively to sample a signal on each of the inputs in turn, at a sampling rate higher than an expected rate of change of the signals on the inputs, thereby defining sample bits, and to place levels corresponding to the sample bits for respective individual ones of the inputs onto the serial path in turn;
a marker operable to sense successive sample bits for at least a certain one of the plurality of inputs and to detect in the successive sample bits a predetermined pattern occurring therein during normal operation, the certain one of the inputs corresponding to a certain one of the outputs, the marker being operable to impose a variation in the levels for the certain one of the inputs, which variation identifies levels intended for said certain one of the outputs;
a receiver operable to receive the successive levels on the serial path and to set each of the outputs, in turn, equal to the sample bit for each of the inputs, in turn; and,
a sequencing means associated with the receiver, the sequencing means detecting the variation marking said certain one of the inputs and routing the corresponding output to said certain one of the outputs;
whereby the multiplexer synchronizes the certain one of the inputs to the certain one of the outputs every time the predetermined pattern appears on the certain one of the inputs.
2. The multiplexer of claim 1, wherein the inputs and the outputs are digital levels having a data rate and the sampling rate is substantially faster than the data rate, the variation imposed by the marker being a change of state imposed at said faster sampling rate, whereby the variation is distinguishable from a change in transmitted data.
3. The multiplexer of claim 2, wherein the inputs are synchronous digital signals at approximately equal bit rates and the sampling rate has a frequency greater than twice said bit rate.
4. The multiplexer of claim 2, wherein the predetermined pattern is a succession of unchanged sampled levels for the certain one of the inputs.
5. The multiplexer of claim 4, wherein the variation is a change of state imposed in the transmitted signal during one of the sample bits of the certain input.
6. The multiplexer of claim 5, wherein the inputs vary in time between mark and space and wherein a space is imposed in a middle one of three sampled mark bits in said certain one of the inputs.
7. A multiplexer, comprising:
a transmitting section having a plurality of input channels and a serial output, the input channels being sampled repetitively in sequence and sampled levels on the input channels occupying time divisions in the serial output, the serial output of the transmitting section being transmitted to become a serial input to a receiving section;
the receiving section having a plurality of parallel outputs and the receiving section being operable to subdivide out signals on the serial input according to time divisions and to set successive ones of the parallel outputs to an instantaneous level of the serial input during successive ones of the time divisions;
the transmitting section having means for storing levels for at least one of the parallel inputs taken during a plurality of successive samples of at least one channel corresponding to said at least one of the parallel inputs, and a comparator means connected to the means for storing levels, the comparator means being operable to detect a predetermined pattern in the levels for a plurality of successive samples of said at least one channel and to impose a change of state in the serial output of the transmitting section during a time division for said at least one channel, whereby data passing through said at least one channel is marked;
the receiving section having means for storing levels for a plurality of successive time divisions applicable to at least one output channel corresponding to said at least one channel, and gating means operable to detect and cancel the change of state in the at least one output channel, the receiving section being operable to re-synchronize to a different output channel when the change of state is detected for a channel other than said at least one channel, whereby the multiplexer is self-synchronizing.
8. The multiplexer of claim 7, wherein the predetermined pattern is a succession of unchanged samples on said at least one channel and the change of state is a reversal of a single one of said samples within the succession of unchanged samples.
9. The multiplexer of claim 8, wherein the channels are set to digital levels, the predetermined pattern being three consecutive unchanged levels, the change of state being a changed level for a middle one of the three consecutive unchanged levels.
10. The multiplexer of claim 7, wherein only an initial channel in a plurality of multiplexed channels is marked and wherein the receiver is reset to the initial channel upon detection of the change of state.
11. A digital multiplexer, comprising a transmitter section having:
means defining a plurality of parallel input channels adapted for digital data transmission at characteristic data rates and a serial output;
a sample rate clock and a time division counter repetitively defining time divisions for each of the parallel input channels, the sample rate clock being faster than the characteristic data rates;
time division gating means connected to each parallel input channel, the time division gating means being responsive to the outputs of the time division counter and operable, at a rate defined by the sample rate clock, to pass data during each of said time divisions onto a corresponding one of the parallel input channels to the serial output;
at least one input bit storage register connected to at least one synchronizing channel of the parallel input channels, the input bit storage register being operable to store bit samples for a plurality of successive samples of the synchronizing channel; and,
marker gating means connected to outputs of the bit storage register, the marker gating means being operable to detect a predetermined bit pattern and to invert a marker bit in the predetermined bit pattern for said synchronizing channel, whereby data passing through that channel is marked.
12. The digital multiplexer of claim 11, further comprising a receiver section, the receiver section having:
a serial input in data communication with said serial output and a plurality of parallel output channels;
a receiver sample clock, and a receiver time division counter operable at a rate defined by the receiver sample clock, the receiver time division counter defining time divisions for the receiver section;
gating means connected to the serial input, the parallel outputs and the counter, the gating means being connected such that data on the serial input during individual time divisions is passed in turn to successive ones of each of the parallel outputs, each of the parallel outputs having an output bit storage register through which successive sampled levels for said parallel outputs are shifted;
at least one of the output bit storage registers corresponding to the synchronizing channel having means operable to detect and re-invert said marker bit, the marker bit appearing on the synchronizing channel when the receiver section is synchronized with the transmitter section, at least one remaining output bit storage register having control means operable to detect the marker bit, the marker bit appearing in said remaining bit storage register when the receiver section is not synchronized with the transmitter section, the control means being operable to reset the receiver time division counter when the marker bit is detected in said remaining bit storage register, whereby the receiver section is automatically re-synchronized with the transmitter section.
13. The multiplexer of claim 12, wherein two parallel inputs and two parallel outputs lead to and from the transmitter section and the receiver section, respectively.
14. The multiplexer of claim 13, wherein the predetermined pattern is at least three unchanged levels in the input storage register and a central one of said at least three bits is inverted by the marker gating means.
15. The multiplexer of claim 3, wherein the sampling rate is eight times the bit rate.
16. The multiplexer of claim 7, further comprising a flip flop and gating connected to the bit register for detecting said predetermined pattern.
17. The multiplexer of claim 7, wherein said comparator means includes gating connected to detect said predetermined pattern in the levels passing through said at least one channel.
US07/138,663 1987-12-24 1987-12-24 Self-synchronizing multiplexer Expired - Lifetime US4891808A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US07/138,663 US4891808A (en) 1987-12-24 1987-12-24 Self-synchronizing multiplexer

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US07/138,663 US4891808A (en) 1987-12-24 1987-12-24 Self-synchronizing multiplexer

Publications (1)

Publication Number Publication Date
US4891808A true US4891808A (en) 1990-01-02

Family

ID=22483069

Family Applications (1)

Application Number Title Priority Date Filing Date
US07/138,663 Expired - Lifetime US4891808A (en) 1987-12-24 1987-12-24 Self-synchronizing multiplexer

Country Status (1)

Country Link
US (1) US4891808A (en)

Cited By (47)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5237573A (en) * 1992-03-31 1993-08-17 Apple Computer, Inc. Method and apparatus for selectively switching between input signals
WO1994001952A1 (en) * 1992-07-01 1994-01-20 Telefonaktiebolaget Lm Ericsson A method of distinguishing in serial digital bit streams between at least two types of time slots in a bit stream receiver
US5299187A (en) * 1991-09-19 1994-03-29 Fujitsu Limited Time-multiplexed highway line designating system
US5483540A (en) * 1993-11-22 1996-01-09 Nec Corporation Demultiplexer for demultiplexing serial multiplexed signal into bits
US5598113A (en) * 1995-01-19 1997-01-28 Intel Corporation Fully asynchronous interface with programmable metastability settling time synchronizer
US5714904A (en) * 1994-06-06 1998-02-03 Sun Microsystems, Inc. High speed serial link for fully duplexed data communication
US5719874A (en) * 1993-09-03 1998-02-17 Alcatel Sel A.G. Time-division-multiplexing method and apparatus
EP0855710A2 (en) * 1997-01-27 1998-07-29 Yazaki Corporation Data modulator and data modulating method
EP0856848A2 (en) * 1997-01-29 1998-08-05 Yazaki Corporation Data demodulator and data demodulating method
US6400727B1 (en) 1998-03-27 2002-06-04 Cirrus Logic, Inc. Methods and system to transmit data acquired at a variable rate over a fixed rate channel
US6636993B1 (en) * 1999-02-12 2003-10-21 Fujitsu Limited System and method for automatic deskew across a high speed, parallel interconnection
US20030229770A1 (en) * 2002-06-07 2003-12-11 Jeddeloh Joseph M. Memory hub with internal cache and/or memory access prediction
US20040024978A1 (en) * 2002-08-05 2004-02-05 Jeddeloh Joseph M. Memory hub and access method having internal row caching
US20040024959A1 (en) * 2002-08-02 2004-02-05 Taylor George R. System and method for optically interconnecting memory devices
US20040034753A1 (en) * 2002-08-16 2004-02-19 Jeddeloh Joseph M. Memory hub bypass circuit and method
US20040251929A1 (en) * 2003-06-11 2004-12-16 Pax George E. Memory module and method having improved signal routing topology
US20040257890A1 (en) * 2002-09-09 2004-12-23 Lee Terry R. Wavelength division multiplexed memory module, memory system and method
US20040260957A1 (en) * 2003-06-20 2004-12-23 Jeddeloh Joseph M. System and method for selective memory module power management
US20050021884A1 (en) * 2003-07-22 2005-01-27 Jeddeloh Joseph M. Apparatus and method for direct memory access in a hub-based memory system
US20050030313A1 (en) * 2000-06-23 2005-02-10 William Radke Apparatus and method for distributed memory control in a graphics processing system
US20050044457A1 (en) * 2003-08-19 2005-02-24 Jeddeloh Joseph M. System and method for on-board diagnostics of memory modules
US20050044304A1 (en) * 2003-08-20 2005-02-24 Ralph James Method and system for capturing and bypassing memory transactions in a hub-based memory system
US20050050255A1 (en) * 2003-08-28 2005-03-03 Jeddeloh Joseph M. Multiple processor system and method including multiple memory hub modules
US20050066136A1 (en) * 2003-09-18 2005-03-24 Schnepper Randy L. Memory hub with integrated non-volatile memory
US20050086441A1 (en) * 2003-10-20 2005-04-21 Meyer James W. Arbitration system and method for memory responses in a hub-based memory system
US20050091464A1 (en) * 2003-10-27 2005-04-28 Ralph James System and method for using a learning sequence to establish communications on a high-speed nonsynchronous interface in the absence of clock forwarding
US20050146943A1 (en) * 2003-08-28 2005-07-07 Jeddeloh Joseph M. Memory module and method having on-board data search capabilities and processor-based system using such memory modules
US20050157718A1 (en) * 2003-01-15 2005-07-21 Masahiro Yoshimoto Method and circuit for asynchronous transmission
US20050172084A1 (en) * 2004-01-30 2005-08-04 Jeddeloh Joseph M. Buffer control system and method for a memory system having memory request buffers
US20050177695A1 (en) * 2004-02-05 2005-08-11 Larson Douglas A. Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US20050216648A1 (en) * 2004-03-25 2005-09-29 Jeddeloh Joseph M System and method for memory hub-based expansion bus
US20050213611A1 (en) * 2004-03-29 2005-09-29 Ralph James Method and system for synchronizing communications links in a hub-based memory system
US20050216677A1 (en) * 2004-03-24 2005-09-29 Jeddeloh Joseph M Memory arbitration system and method having an arbitration packet protocol
US20050216678A1 (en) * 2004-03-29 2005-09-29 Jeddeloh Joseph M Memory hub and method for providing memory sequencing hints
US20050218956A1 (en) * 2004-04-05 2005-10-06 Laberge Paul A Delay line synchronizer apparatus and method
US20050228939A1 (en) * 2004-04-08 2005-10-13 Janzen Jeffery W System and method for optimizing interconnections of components in a multichip memory module
US20050268060A1 (en) * 2004-05-28 2005-12-01 Cronin Jeffrey J Method and system for terminating write commands in a hub-based memory system
US20050283681A1 (en) * 2004-06-04 2005-12-22 Jeddeloh Joseph M Memory hub tester interface and method for use thereof
US20050286506A1 (en) * 2004-06-04 2005-12-29 Laberge Paul A System and method for an asynchronous data buffer having buffer write and read pointers
US20060206667A1 (en) * 2002-08-29 2006-09-14 Ryan Kevin J System and method for optimizing interconnections of memory devices in a multichip module
US7120727B2 (en) 2003-06-19 2006-10-10 Micron Technology, Inc. Reconfigurable memory module and method
US20060288172A1 (en) * 2003-06-20 2006-12-21 Lee Terry R Memory hub and access method having internal prefetch buffers
US7412574B2 (en) 2004-02-05 2008-08-12 Micron Technology, Inc. System and method for arbitration of memory responses in a hub-based memory system
US20080191774A1 (en) * 2007-02-09 2008-08-14 Shaun Lytollis Clock Circuit
US20100195835A1 (en) * 2009-02-05 2010-08-05 D.E. Shaw Research, Llc Link and physical coding sub-layer protocols
US8775764B2 (en) 2004-03-08 2014-07-08 Micron Technology, Inc. Memory hub architecture having programmable lane widths
US8880833B2 (en) 2003-12-29 2014-11-04 Micron Technology, Inc. System and method for read synchronization of memory modules

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3636524A (en) * 1969-12-08 1972-01-18 Tel Tech Corp Multiplex communication system
US3729590A (en) * 1971-02-05 1973-04-24 Ericsson Telefon Ab L M Apparatus for transmitting a data flow by means of a pcm-flow
US3748393A (en) * 1970-02-17 1973-07-24 Int Standard Electric Corp Data transmission over pulse code modulation channels
US3840705A (en) * 1972-08-16 1974-10-08 Northeast Electronics Corp Data channel unit for a pcm tdm system
US3873776A (en) * 1974-01-30 1975-03-25 Gen Electric Alarm arrangement for a time-division multiplex, pulse-code modulation carrier system
US3909540A (en) * 1974-09-03 1975-09-30 Itt Data and signaling multiplexing in PCM systems via the framing code
US3936609A (en) * 1974-02-14 1976-02-03 Gte Automatic Electric Laboratories Incorporated Submultiplex transmission of alarm status signals for a time division multiplex system
US3970799A (en) * 1975-10-06 1976-07-20 Bell Telephone Laboratories, Incorporated Common control signaling extraction circuit
US3995120A (en) * 1975-05-30 1976-11-30 Gte Automatic Electric Laboratories Incorporated Digital time-division multiplexing system
US4132862A (en) * 1976-12-03 1979-01-02 Compagnie Industrielle Des Telecommunications Cit-Alcatel Device for the digital multiplexing of quasi-synchronous trains
US4243930A (en) * 1979-05-23 1981-01-06 Lynch Communication Systems, Inc. Method and means for transmitting low speed signals over a PCM framing code
US4538286A (en) * 1983-07-26 1985-08-27 Gte Communications Products Corporation Data rate conversion and supervisory bit insertion in a data system
US4744082A (en) * 1982-03-09 1988-05-10 Nippon Electric Co., Ltd. Multiplexer apparatus having nBmB coder
US4759018A (en) * 1985-06-17 1988-07-19 At&T Bell Laboratories Higher order digital transmission system including a multiplexer and a demultiplexer
US4792949A (en) * 1987-03-26 1988-12-20 Siemens Transmission Systems, Inc. Service channel circuit for multiplexed telecommunications transmission systems

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3636524A (en) * 1969-12-08 1972-01-18 Tel Tech Corp Multiplex communication system
US3748393A (en) * 1970-02-17 1973-07-24 Int Standard Electric Corp Data transmission over pulse code modulation channels
US3729590A (en) * 1971-02-05 1973-04-24 Ericsson Telefon Ab L M Apparatus for transmitting a data flow by means of a pcm-flow
US3840705A (en) * 1972-08-16 1974-10-08 Northeast Electronics Corp Data channel unit for a pcm tdm system
US3873776A (en) * 1974-01-30 1975-03-25 Gen Electric Alarm arrangement for a time-division multiplex, pulse-code modulation carrier system
US3936609A (en) * 1974-02-14 1976-02-03 Gte Automatic Electric Laboratories Incorporated Submultiplex transmission of alarm status signals for a time division multiplex system
US3909540A (en) * 1974-09-03 1975-09-30 Itt Data and signaling multiplexing in PCM systems via the framing code
US3995120A (en) * 1975-05-30 1976-11-30 Gte Automatic Electric Laboratories Incorporated Digital time-division multiplexing system
US3970799A (en) * 1975-10-06 1976-07-20 Bell Telephone Laboratories, Incorporated Common control signaling extraction circuit
US4132862A (en) * 1976-12-03 1979-01-02 Compagnie Industrielle Des Telecommunications Cit-Alcatel Device for the digital multiplexing of quasi-synchronous trains
US4243930A (en) * 1979-05-23 1981-01-06 Lynch Communication Systems, Inc. Method and means for transmitting low speed signals over a PCM framing code
US4744082A (en) * 1982-03-09 1988-05-10 Nippon Electric Co., Ltd. Multiplexer apparatus having nBmB coder
US4538286A (en) * 1983-07-26 1985-08-27 Gte Communications Products Corporation Data rate conversion and supervisory bit insertion in a data system
US4759018A (en) * 1985-06-17 1988-07-19 At&T Bell Laboratories Higher order digital transmission system including a multiplexer and a demultiplexer
US4792949A (en) * 1987-03-26 1988-12-20 Siemens Transmission Systems, Inc. Service channel circuit for multiplexed telecommunications transmission systems

Cited By (190)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5299187A (en) * 1991-09-19 1994-03-29 Fujitsu Limited Time-multiplexed highway line designating system
US5237573A (en) * 1992-03-31 1993-08-17 Apple Computer, Inc. Method and apparatus for selectively switching between input signals
CN1066877C (en) * 1992-07-01 2001-06-06 艾利森电话股份有限公司 A method of distinguishing in serial digital bit streams between at least two types of time slots in a bit stream receiver
WO1994001952A1 (en) * 1992-07-01 1994-01-20 Telefonaktiebolaget Lm Ericsson A method of distinguishing in serial digital bit streams between at least two types of time slots in a bit stream receiver
US5450398A (en) * 1992-07-01 1995-09-12 Telefonaktiebolaget Lm Ericsson Method of distinguishing in serial digital bit streams between at least two types of time slots in a bit stream receiver
US5719874A (en) * 1993-09-03 1998-02-17 Alcatel Sel A.G. Time-division-multiplexing method and apparatus
US5483540A (en) * 1993-11-22 1996-01-09 Nec Corporation Demultiplexer for demultiplexing serial multiplexed signal into bits
US5714904A (en) * 1994-06-06 1998-02-03 Sun Microsystems, Inc. High speed serial link for fully duplexed data communication
US6107946A (en) * 1994-06-06 2000-08-22 Sun Microsystem, Inc. High speed serial link for fully duplexed data communication
US5598113A (en) * 1995-01-19 1997-01-28 Intel Corporation Fully asynchronous interface with programmable metastability settling time synchronizer
EP0855710A3 (en) * 1997-01-27 1999-12-08 Yazaki Corporation Data modulator and data modulating method
US6094460A (en) * 1997-01-27 2000-07-25 Yazaki Corporation Data modulator and data modulating method
EP0855710A2 (en) * 1997-01-27 1998-07-29 Yazaki Corporation Data modulator and data modulating method
US6094462A (en) * 1997-01-29 2000-07-25 Yazaki Corporation Data demodulator and data demodulating method
EP0856848A2 (en) * 1997-01-29 1998-08-05 Yazaki Corporation Data demodulator and data demodulating method
EP0856848A3 (en) * 1997-01-29 1999-12-08 Yazaki Corporation Data demodulator and data demodulating method
US6400727B1 (en) 1998-03-27 2002-06-04 Cirrus Logic, Inc. Methods and system to transmit data acquired at a variable rate over a fixed rate channel
US6636993B1 (en) * 1999-02-12 2003-10-21 Fujitsu Limited System and method for automatic deskew across a high speed, parallel interconnection
US7180522B2 (en) 2000-06-23 2007-02-20 Micron Technology, Inc. Apparatus and method for distributed memory control in a graphics processing system
US20050030313A1 (en) * 2000-06-23 2005-02-10 William Radke Apparatus and method for distributed memory control in a graphics processing system
US7945737B2 (en) 2002-06-07 2011-05-17 Round Rock Research, Llc Memory hub with internal cache and/or memory access prediction
US7644253B2 (en) 2002-06-07 2010-01-05 Micron Technology, Inc. Memory hub with internal cache and/or memory access prediction
US20110219196A1 (en) * 2002-06-07 2011-09-08 Round Rock Research, Llc Memory hub with internal cache and/or memory access prediction
US8195918B2 (en) 2002-06-07 2012-06-05 Round Rock Research, Llc Memory hub with internal cache and/or memory access prediction
US8499127B2 (en) 2002-06-07 2013-07-30 Round Rock Research, Llc Memory hub with internal cache and/or memory access prediction
US7133972B2 (en) 2002-06-07 2006-11-07 Micron Technology, Inc. Memory hub with internal cache and/or memory access prediction
US20030229770A1 (en) * 2002-06-07 2003-12-11 Jeddeloh Joseph M. Memory hub with internal cache and/or memory access prediction
US20070055817A1 (en) * 2002-06-07 2007-03-08 Jeddeloh Joseph M Memory hub with internal cache and/or memory access prediction
US20090125688A1 (en) * 2002-06-07 2009-05-14 Jeddeloh Joseph M Memory hub with internal cache and/or memory access prediction
US7382639B2 (en) 2002-08-02 2008-06-03 Micron Technology, Inc. System and method for optically interconnecting memory devices
US7200024B2 (en) 2002-08-02 2007-04-03 Micron Technology, Inc. System and method for optically interconnecting memory devices
US20050146946A1 (en) * 2002-08-02 2005-07-07 Taylor George R. System and method for optically interconnecting memory devices
US7289347B2 (en) 2002-08-02 2007-10-30 Micron Technology, Inc. System and method for optically interconnecting memory devices
US20040024959A1 (en) * 2002-08-02 2004-02-05 Taylor George R. System and method for optically interconnecting memory devices
US20070035980A1 (en) * 2002-08-02 2007-02-15 Taylor George R System and method for optically interconnecting memory devices
US7411807B2 (en) 2002-08-02 2008-08-12 Micron Technology, Inc. System and method for optically interconnecting memory devices
US20070025133A1 (en) * 2002-08-02 2007-02-01 Taylor George R System and method for optical interconnecting memory devices
US20050223161A1 (en) * 2002-08-05 2005-10-06 Jeddeloh Joseph M Memory hub and access method having internal row caching
US8954687B2 (en) 2002-08-05 2015-02-10 Micron Technology, Inc. Memory hub and access method having a sequencer and internal row caching
US20040024978A1 (en) * 2002-08-05 2004-02-05 Jeddeloh Joseph M. Memory hub and access method having internal row caching
US7117316B2 (en) 2002-08-05 2006-10-03 Micron Technology, Inc. Memory hub and access method having internal row caching
US20060174070A1 (en) * 2002-08-16 2006-08-03 Jeddeloh Joseph M Memory hub bypass circuit and method
US7149874B2 (en) 2002-08-16 2006-12-12 Micron Technology, Inc. Memory hub bypass circuit and method
US7415567B2 (en) 2002-08-16 2008-08-19 Micron Technology, Inc. Memory hub bypass circuit and method
US20040034753A1 (en) * 2002-08-16 2004-02-19 Jeddeloh Joseph M. Memory hub bypass circuit and method
US7047351B2 (en) 2002-08-16 2006-05-16 Micron Technology, Inc. Memory hub bypass circuit and method
US20050132159A1 (en) * 2002-08-16 2005-06-16 Jeddeloh Joseph M. Memory hub bypass circuit and method
US7805586B2 (en) 2002-08-29 2010-09-28 Micron Technology, Inc. System and method for optimizing interconnections of memory devices in a multichip module
US8190819B2 (en) 2002-08-29 2012-05-29 Micron Technology, Inc. System and method for optimizing interconnections of memory devices in a multichip module
US7836252B2 (en) 2002-08-29 2010-11-16 Micron Technology, Inc. System and method for optimizing interconnections of memory devices in a multichip module
US20060206667A1 (en) * 2002-08-29 2006-09-14 Ryan Kevin J System and method for optimizing interconnections of memory devices in a multichip module
US7106611B2 (en) 2002-09-09 2006-09-12 Micron Technology, Inc. Wavelength division multiplexed memory module, memory system and method
US20040257890A1 (en) * 2002-09-09 2004-12-23 Lee Terry R. Wavelength division multiplexed memory module, memory system and method
US7936792B2 (en) * 2003-01-15 2011-05-03 Fujitsu Limited Method and circuit for asynchronous transmission
US20050157718A1 (en) * 2003-01-15 2005-07-21 Masahiro Yoshimoto Method and circuit for asynchronous transmission
US7746095B2 (en) 2003-06-11 2010-06-29 Round Rock Research, Llc Memory module and method having improved signal routing topology
US20090243649A1 (en) * 2003-06-11 2009-10-01 Pax George E Memory module and method having improved signal routing topology
US20060023528A1 (en) * 2003-06-11 2006-02-02 Pax George E Memory module and method having improved signal routing topology
US20040251929A1 (en) * 2003-06-11 2004-12-16 Pax George E. Memory module and method having improved signal routing topology
US20080036492A1 (en) * 2003-06-11 2008-02-14 Micron Technology, Inc. Memory module and method having improved signal routing topology
US20050030797A1 (en) * 2003-06-11 2005-02-10 Pax George E. Memory module and method having improved signal routing topology
US7282947B2 (en) 2003-06-11 2007-10-16 Micron Technology, Inc. Memory module and method having improved signal routing topology
US7557601B2 (en) 2003-06-11 2009-07-07 Micron Technology, Inc. Memory module and method having improved signal routing topology
US7245145B2 (en) 2003-06-11 2007-07-17 Micron Technology, Inc. Memory module and method having improved signal routing topology
US7242213B2 (en) 2003-06-11 2007-07-10 Micron Technology, Inc. Memory module and method having improved signal routing topology
US20110029746A1 (en) * 2003-06-19 2011-02-03 Round Rock Research, Llc Reconfigurable memory module and method
US7120727B2 (en) 2003-06-19 2006-10-10 Micron Technology, Inc. Reconfigurable memory module and method
US7966444B2 (en) 2003-06-19 2011-06-21 Round Rock Research, Llc Reconfigurable memory module and method
US20070011392A1 (en) * 2003-06-19 2007-01-11 Lee Terry R Reconfigurable memory module and method
US20080140952A1 (en) * 2003-06-19 2008-06-12 Micro Technology, Inc. Reconfigurable memory module and method
US8732383B2 (en) 2003-06-19 2014-05-20 Round Rock Research, Llc Reconfigurable memory module and method
US7818712B2 (en) 2003-06-19 2010-10-19 Round Rock Research, Llc Reconfigurable memory module and method
US8200884B2 (en) 2003-06-19 2012-06-12 Round Rock Research, Llc Reconfigurable memory module and method
US7428644B2 (en) 2003-06-20 2008-09-23 Micron Technology, Inc. System and method for selective memory module power management
US7412566B2 (en) 2003-06-20 2008-08-12 Micron Technology, Inc. Memory hub and access method having internal prefetch buffers
US7260685B2 (en) 2003-06-20 2007-08-21 Micron Technology, Inc. Memory hub and access method having internal prefetch buffers
US8127081B2 (en) 2003-06-20 2012-02-28 Round Rock Research, Llc Memory hub and access method having internal prefetch buffers
US7437579B2 (en) 2003-06-20 2008-10-14 Micron Technology, Inc. System and method for selective memory module power management
US20060206738A1 (en) * 2003-06-20 2006-09-14 Jeddeloh Joseph M System and method for selective memory module power management
US20040260957A1 (en) * 2003-06-20 2004-12-23 Jeddeloh Joseph M. System and method for selective memory module power management
US20060288172A1 (en) * 2003-06-20 2006-12-21 Lee Terry R Memory hub and access method having internal prefetch buffers
US7222197B2 (en) 2003-07-22 2007-05-22 Micron Technology, Inc. Apparatus and method for direct memory access in a hub-based memory system
US7389364B2 (en) 2003-07-22 2008-06-17 Micron Technology, Inc. Apparatus and method for direct memory access in a hub-based memory system
US20050021884A1 (en) * 2003-07-22 2005-01-27 Jeddeloh Joseph M. Apparatus and method for direct memory access in a hub-based memory system
US20090327532A1 (en) * 2003-07-22 2009-12-31 Micron Technology, Inc. Apparatus and method for direct memory access in a hub-based memory system
US20050160201A1 (en) * 2003-07-22 2005-07-21 Jeddeloh Joseph M. Apparatus and method for direct memory access in a hub-based memory system
US8209445B2 (en) 2003-07-22 2012-06-26 Round Rock Research, Llc Apparatus and method for direct memory access in a hub-based memory system
US7966430B2 (en) 2003-07-22 2011-06-21 Round Rock Research, Llc Apparatus and method for direct memory access in a hub-based memory system
US20090106591A1 (en) * 2003-08-19 2009-04-23 Micron Technology, Inc. System and method for on-board diagnostics of memory modules
US7516363B2 (en) 2003-08-19 2009-04-07 Micron Technology, Inc. System and method for on-board diagnostics of memory modules
US7913122B2 (en) 2003-08-19 2011-03-22 Round Rock Research, Llc System and method for on-board diagnostics of memory modules
US7210059B2 (en) 2003-08-19 2007-04-24 Micron Technology, Inc. System and method for on-board diagnostics of memory modules
US20080016401A1 (en) * 2003-08-19 2008-01-17 Micro Technology, Inc. System and method for on-board diagnostics of memory modules
US20050044457A1 (en) * 2003-08-19 2005-02-24 Jeddeloh Joseph M. System and method for on-board diagnostics of memory modules
US7278060B2 (en) 2003-08-19 2007-10-02 Micron Technology, Inc. System and method for on-board diagnostics of memory modules
US20060206766A1 (en) * 2003-08-19 2006-09-14 Jeddeloh Joseph M System and method for on-board diagnostics of memory modules
US20050044304A1 (en) * 2003-08-20 2005-02-24 Ralph James Method and system for capturing and bypassing memory transactions in a hub-based memory system
US7133991B2 (en) 2003-08-20 2006-11-07 Micron Technology, Inc. Method and system for capturing and bypassing memory transactions in a hub-based memory system
US7251714B2 (en) 2003-08-20 2007-07-31 Micron Technology, Inc. Method and system for capturing and bypassing memory transactions in a hub-based memory system
US9082461B2 (en) 2003-08-28 2015-07-14 Round Rock Research, Llc Multiple processor system and method including multiple memory hub modules
US7873775B2 (en) 2003-08-28 2011-01-18 Round Rock Research, Llc Multiple processor system and method including multiple memory hub modules
US20070033317A1 (en) * 2003-08-28 2007-02-08 Jeddeloh Joseph M Multiple processor system and method including multiple memory hub modules
US20050050255A1 (en) * 2003-08-28 2005-03-03 Jeddeloh Joseph M. Multiple processor system and method including multiple memory hub modules
US20110113189A1 (en) * 2003-08-28 2011-05-12 Round Rock Research, Llc Multiple processor system and method including multiple memory hub modules
US7136958B2 (en) 2003-08-28 2006-11-14 Micron Technology, Inc. Multiple processor system and method including multiple memory hub modules
US20050146943A1 (en) * 2003-08-28 2005-07-07 Jeddeloh Joseph M. Memory module and method having on-board data search capabilities and processor-based system using such memory modules
US7386649B2 (en) 2003-08-28 2008-06-10 Micron Technology, Inc. Multiple processor system and method including multiple memory hub modules
US7581055B2 (en) 2003-08-28 2009-08-25 Micron Technology, Inc. Multiple processor system and method including multiple memory hub modules
US8244952B2 (en) 2003-08-28 2012-08-14 Round Rock Research, Llc Multiple processor system and method including multiple memory hub modules
US7194593B2 (en) 2003-09-18 2007-03-20 Micron Technology, Inc. Memory hub with integrated non-volatile memory
US20050066136A1 (en) * 2003-09-18 2005-03-24 Schnepper Randy L. Memory hub with integrated non-volatile memory
US8832404B2 (en) 2003-09-18 2014-09-09 Round Rock Research, Llc Memory hub with integrated non-volatile memory
US7975122B2 (en) 2003-09-18 2011-07-05 Round Rock Research, Llc Memory hub with integrated non-volatile memory
US7490211B2 (en) 2003-09-18 2009-02-10 Micron Technology, Inc. Memory hub with integrated non-volatile memory
US20060200620A1 (en) * 2003-09-18 2006-09-07 Schnepper Randy L Memory hub with integrated non-volatile memory
US20090132781A1 (en) * 2003-09-18 2009-05-21 Schnepper Randy L Memory hub with integrated non-volatile memory
US20050086441A1 (en) * 2003-10-20 2005-04-21 Meyer James W. Arbitration system and method for memory responses in a hub-based memory system
US7120743B2 (en) 2003-10-20 2006-10-10 Micron Technology, Inc. Arbitration system and method for memory responses in a hub-based memory system
US8589643B2 (en) 2003-10-20 2013-11-19 Round Rock Research, Llc Arbitration system and method for memory responses in a hub-based memory system
US20060271746A1 (en) * 2003-10-20 2006-11-30 Meyer James W Arbitration system and method for memory responses in a hub-based memory system
US20050091464A1 (en) * 2003-10-27 2005-04-28 Ralph James System and method for using a learning sequence to establish communications on a high-speed nonsynchronous interface in the absence of clock forwarding
US7234070B2 (en) 2003-10-27 2007-06-19 Micron Technology, Inc. System and method for using a learning sequence to establish communications on a high-speed nonsynchronous interface in the absence of clock forwarding
US7461286B2 (en) 2003-10-27 2008-12-02 Micron Technology, Inc. System and method for using a learning sequence to establish communications on a high-speed nonsynchronous interface in the absence of clock forwarding
US8880833B2 (en) 2003-12-29 2014-11-04 Micron Technology, Inc. System and method for read synchronization of memory modules
US8504782B2 (en) 2004-01-30 2013-08-06 Micron Technology, Inc. Buffer control system and method for a memory system having outstanding read and write request buffers
US20050172084A1 (en) * 2004-01-30 2005-08-04 Jeddeloh Joseph M. Buffer control system and method for a memory system having memory request buffers
US7188219B2 (en) 2004-01-30 2007-03-06 Micron Technology, Inc. Buffer control system and method for a memory system having outstanding read and write request buffers
US8788765B2 (en) 2004-01-30 2014-07-22 Micron Technology, Inc. Buffer control system and method for a memory system having outstanding read and write request buffers
US7412574B2 (en) 2004-02-05 2008-08-12 Micron Technology, Inc. System and method for arbitration of memory responses in a hub-based memory system
US20050177695A1 (en) * 2004-02-05 2005-08-11 Larson Douglas A. Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US20100287323A1 (en) * 2004-02-05 2010-11-11 Larson Douglas A Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US8694735B2 (en) 2004-02-05 2014-04-08 Micron Technology, Inc. Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US20080294862A1 (en) * 2004-02-05 2008-11-27 Micron Technology, Inc. Arbitration system having a packet memory and method for memory responses in a hub-based memory system
US9164937B2 (en) 2004-02-05 2015-10-20 Micron Technology, Inc. Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US7788451B2 (en) 2004-02-05 2010-08-31 Micron Technology, Inc. Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US8291173B2 (en) 2004-02-05 2012-10-16 Micron Technology, Inc. Apparatus and method for data bypass for a bi-directional data bus in a hub-based memory sub-system
US8775764B2 (en) 2004-03-08 2014-07-08 Micron Technology, Inc. Memory hub architecture having programmable lane widths
US9274991B2 (en) 2004-03-08 2016-03-01 Micron Technology, Inc. Memory hub architecture having programmable lane widths
US20070180171A1 (en) * 2004-03-24 2007-08-02 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US8555006B2 (en) 2004-03-24 2013-10-08 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US20080294856A1 (en) * 2004-03-24 2008-11-27 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US7412571B2 (en) 2004-03-24 2008-08-12 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US20050216677A1 (en) * 2004-03-24 2005-09-29 Jeddeloh Joseph M Memory arbitration system and method having an arbitration packet protocol
US8082404B2 (en) 2004-03-24 2011-12-20 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US9032166B2 (en) 2004-03-24 2015-05-12 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US7257683B2 (en) 2004-03-24 2007-08-14 Micron Technology, Inc. Memory arbitration system and method having an arbitration packet protocol
US20070168595A1 (en) * 2004-03-25 2007-07-19 Micron Technology, Inc. System and method for memory hub-based expansion bus
US20100036989A1 (en) * 2004-03-25 2010-02-11 Micron Technology, Inc. System and method for memory hub-based expansion bus
US7206887B2 (en) 2004-03-25 2007-04-17 Micron Technology, Inc. System and method for memory hub-based expansion bus
US20050216648A1 (en) * 2004-03-25 2005-09-29 Jeddeloh Joseph M System and method for memory hub-based expansion bus
US7174409B2 (en) 2004-03-25 2007-02-06 Micron Technology, Inc. System and method for memory hub-based expansion bus
US7120723B2 (en) 2004-03-25 2006-10-10 Micron Technology, Inc. System and method for memory hub-based expansion bus
US7899969B2 (en) 2004-03-25 2011-03-01 Round Rock Research, Llc System and method for memory hub-based expansion bus
US8117371B2 (en) 2004-03-25 2012-02-14 Round Rock Research, Llc System and method for memory hub-based expansion bus
US20060195647A1 (en) * 2004-03-25 2006-08-31 Jeddeloh Joseph M System and method for memory hub-based expansion bus
US7610430B2 (en) 2004-03-25 2009-10-27 Micron Technology, Inc. System and method for memory hub-based expansion bus
US20060179203A1 (en) * 2004-03-25 2006-08-10 Jeddeloh Joseph M System and method for memory hub-based expansion bus
US7222210B2 (en) 2004-03-25 2007-05-22 Micron Technology, Inc. System and method for memory hub-based expansion bus
US7370134B2 (en) 2004-03-25 2008-05-06 Micron Technology, Inc. System and method for memory hub-based expansion bus
US7529273B2 (en) 2004-03-29 2009-05-05 Micron Technology, Inc. Method and system for synchronizing communications links in a hub-based memory system
US7213082B2 (en) 2004-03-29 2007-05-01 Micron Technology, Inc. Memory hub and method for providing memory sequencing hints
US20060218318A1 (en) * 2004-03-29 2006-09-28 Ralph James Method and system for synchronizing communications links in a hub-based memory system
US20050216678A1 (en) * 2004-03-29 2005-09-29 Jeddeloh Joseph M Memory hub and method for providing memory sequencing hints
US20050213611A1 (en) * 2004-03-29 2005-09-29 Ralph James Method and system for synchronizing communications links in a hub-based memory system
US7418526B2 (en) 2004-03-29 2008-08-26 Micron Technology, Inc. Memory hub and method for providing memory sequencing hints
US7447240B2 (en) 2004-03-29 2008-11-04 Micron Technology, Inc. Method and system for synchronizing communications links in a hub-based memory system
US20050218956A1 (en) * 2004-04-05 2005-10-06 Laberge Paul A Delay line synchronizer apparatus and method
US20060066375A1 (en) * 2004-04-05 2006-03-30 Laberge Paul A Delay line synchronizer apparatus and method
US8164375B2 (en) 2004-04-05 2012-04-24 Round Rock Research, Llc Delay line synchronizer apparatus and method
US20100019822A1 (en) * 2004-04-05 2010-01-28 Laberge Paul A Delay line synchronizer apparatus and method
US7605631B2 (en) 2004-04-05 2009-10-20 Micron Technology, Inc. Delay line synchronizer apparatus and method
US6980042B2 (en) * 2004-04-05 2005-12-27 Micron Technology, Inc. Delay line synchronizer apparatus and method
US20050228939A1 (en) * 2004-04-08 2005-10-13 Janzen Jeffery W System and method for optimizing interconnections of components in a multichip memory module
US7590797B2 (en) 2004-04-08 2009-09-15 Micron Technology, Inc. System and method for optimizing interconnections of components in a multichip memory module
US20110103122A1 (en) * 2004-04-08 2011-05-05 Janzen Jeffery W System and method for optimizing interconnections of components in a multichip memory module
US7870329B2 (en) 2004-04-08 2011-01-11 Micron Technology, Inc. System and method for optimizing interconnections of components in a multichip memory module
US8438329B2 (en) 2004-04-08 2013-05-07 Micron Technology, Inc. System and method for optimizing interconnections of components in a multichip memory module
US20050268060A1 (en) * 2004-05-28 2005-12-01 Cronin Jeffrey J Method and system for terminating write commands in a hub-based memory system
US7774559B2 (en) 2004-05-28 2010-08-10 Micron Technology, Inc. Method and system for terminating write commands in a hub-based memory system
US7363419B2 (en) 2004-05-28 2008-04-22 Micron Technology, Inc. Method and system for terminating write commands in a hub-based memory system
US7823024B2 (en) 2004-06-04 2010-10-26 Micron Technology, Inc. Memory hub tester interface and method for use thereof
US7594088B2 (en) 2004-06-04 2009-09-22 Micron Technology, Inc. System and method for an asynchronous data buffer having buffer write and read pointers
US7519788B2 (en) 2004-06-04 2009-04-14 Micron Technology, Inc. System and method for an asynchronous data buffer having buffer write and read pointers
US7310748B2 (en) 2004-06-04 2007-12-18 Micron Technology, Inc. Memory hub tester interface and method for use thereof
US20050286506A1 (en) * 2004-06-04 2005-12-29 Laberge Paul A System and method for an asynchronous data buffer having buffer write and read pointers
US20050283681A1 (en) * 2004-06-04 2005-12-22 Jeddeloh Joseph M Memory hub tester interface and method for use thereof
US8239607B2 (en) 2004-06-04 2012-08-07 Micron Technology, Inc. System and method for an asynchronous data buffer having buffer write and read pointers
US20080191774A1 (en) * 2007-02-09 2008-08-14 Shaun Lytollis Clock Circuit
US20100195835A1 (en) * 2009-02-05 2010-08-05 D.E. Shaw Research, Llc Link and physical coding sub-layer protocols
US9031241B2 (en) * 2009-02-05 2015-05-12 D.E. Shaw Research, Llc Link and physical coding sub-layer protocols

Similar Documents

Publication Publication Date Title
US4891808A (en) Self-synchronizing multiplexer
US4107469A (en) Multiplex/demultiplex apparatus
EP0333122B1 (en) Method and apparatus for frame synchronization
JP2747077B2 (en) Frame synchronization circuit
US4224473A (en) TDMA Multiplexer-demultiplexer with multiple ports
JPH0638597B2 (en) Frame synchronization circuit
US4392234A (en) PCM Signal interface apparatus
US5442636A (en) Circuit and method for alignment of digital information packets
US4943985A (en) Frame synchronization device for a synchronous digital bit stream divided into blocks by means of a block code and structured in frames
GB2079107A (en) Data multiplexing circuit
US4355387A (en) Resynchronizing circuit for time division multiplex system
GB1047639A (en) Improvements in or relating to time division transmission systems
US4247936A (en) Digital communications system with automatic frame synchronization and detector circuitry
US4451917A (en) Method and apparatus for pulse train synchronization in PCM transceivers
US4744081A (en) Frame find circuit and method
GB1407892A (en) Frame synchronization system
US4010325A (en) Framing circuit for digital signals using evenly spaced alternating framing bits
US4203003A (en) Frame search control for digital transmission system
US3480734A (en) Speed conversion systems for pulse signals in a pcm system
US4542504A (en) Shared data receiver
US4394758A (en) Synchronizing unit for receiving section of PCM station
US5781587A (en) Clock extraction circuit
GB1140685A (en) Improved retiming system for asynchronous pulse code trains
KR940011488B1 (en) Device for deriving a synchronizing signal
SU563734A1 (en) Device for monitoring multi-channel communication system with time distribution of channels

Legal Events

Date Code Title Description
AS Assignment

Owner name: COHERENT COMMUNICATION SYSTEMS CORP., 60 COMMERCE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:WILLIAMS, ARTHUR B.;REEL/FRAME:004833/0051

Effective date: 19871217

Owner name: COHERENT COMMUNICATION SYSTEMS CORP.,NEW YORK

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WILLIAMS, ARTHUR B.;REEL/FRAME:004833/0051

Effective date: 19871217

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: PAT HLDR NO LONGER CLAIMS SMALL ENT STAT AS SMALL BUSINESS (ORIGINAL EVENT CODE: LSM2); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: TELLABS OPERATIONS, INC., ILLINOIS

Free format text: MERGER;ASSIGNOR:COHERENT COMMUNICATIONS SYSTEMS CORPORATION;REEL/FRAME:009980/0576

Effective date: 19900210

FPAY Fee payment

Year of fee payment: 12