US5408473A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for transmission of communication signals over two parallel channels
Assignee: Enterasys Networks Inc
•
Filing: 1994-02-25
•
Granted: 1995-04-18
•
Expires: 2014-02-25
Abstract
Abstract A technique for synchronizing run-length-limited data transmitted over two parallel narrowband communication channels, such as in a token ring local area network using fiber distributed data interface (FDDI) protocols. A serial data stream to be transmitted is demultiplexed onto the two channels by sending sequential blocks of equal numbers of bits over alternate channels. In a receiver-multiplexer, block boundary synchronization is established during connection initialization by using a property of a required HALT code to detect block boundaries received in each channel. Skew compensation is effected by comparing the times of detection of the block boundaries in the two channels, and appropriately controlling a variable delay in at least one of the channels. The technique establishes reliable block boundary synchronization and skew error compensation during connection initialization, and if there is subsequent loss of synchronization, detected transmission errors will eventually result in connection reinitialization and reestablishment of synchronization.
Inventors
- 👤 Jerry Hutchison
- 👤 Simon A. Ginzburg
- 👤 William C. Mallard, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 04:23
CPC Classifications
H; H03; H03M; H03M9/00; H04; H04L; H04L25/00; H04L25/02; H04L25/14
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
104 words
A method for transmitting a run-length-limited data stream in parallel over at least two communication channels, comprising the steps of: demultiplexing a serial digital data stream into at least two parallel data streams, by transmitting successive blocks of n bits of data onto cyclically selected communication channels, wherein n is at least four; receiving demultiplexed data signals over the communication channels; detecting block boundaries between successive blocks of data received over each of said channels; and multiplexing said at least two parallel data streams into a single data stream, based on timing signals derived as a result of said step of detecting block boundaries.
Claim 2
Independent Claim
104 words
A method for transmitting a run-length-limited data stream in parallel over at least two communication channels, comprising the steps of: demultiplexing a serial digital data stream into at least two parallel data streams, by transmitting successive blocks of n bits of data onto cyclically selected communication channels, wherein n is at least four; receiving demultiplexed data signals over the communication channels; detecting block boundaries between successive blocks of data received over each of said channels; and multiplexing said at least two parallel data streams into a single data stream, based on timing signals derived as a result of said step of detecting block boundaries.
Claim 3
Dependent Claim
39 words
A method as defined in claim 1, wherein the step of transmitting data over the communication channels is performed using a 4B/5B coding format as defined by the Fiber Distributed Data Interface (FDDI) Token Ring Physical Layer Protocol (PHY).
Claim 4
Dependent Claim
63 words
A method as defined in claim 1, and further comprising the steps of: generating an error signal indicative of any difference between the times of detection of block boundaries in the communication channels; and based on the error signal, applying a controllable time delay to data signals in at least one of the channels, to compensate for any skew error between the channels.
Claim 5
Dependent Claim
27 words
A method as defined in claim 1, wherein: the number of bits (n) in each data block is four; and the number of communication channels is two.
Claim 6
Dependent Claim
27 words
A method as defined in claim 3, wherein: the number of bits (n) in each data block is four; and the number of communication channels is two.
Claim 7
Dependent Claim
36 words
A method as defined in claim 1, wherein the step of detecting block boundaries includes: detecting a binary code sequence received in said each of said channels, said binary code sequence uniquely identifying a block boundary.
Claim 8
Dependent Claim
32 words
A method as defined in claim 6, wherein: the binary code sequence appears in said each of said channels as a result of transmission of a HALT code sequence during ring initialization.
Claim 9
Dependent Claim
48 words
A method as defined in claim 7, wherein: there are two communication channels and the number of bits (n) in each block is four; and the binary code sequence always appears in one of said channels eight data bits after it appears in the other of said channels.
Claim 10
Dependent Claim
141 words
For use in a 4B/5B encoded transmission system, a method for transmitting data in parallel over two communication channels, comprising the steps of: demultiplexing a serial digital data stream into two parallel data streams, by transmitting successive blocks of four bits of data onto alternate communication channels; receiving demultiplexed data signals over the two communication channels; detecting block boundaries between successive blocks of data received over each of said channels; detecting any skew error between the two channels by measuring the phase difference between the block boundaries in the two channels; PG,28 controllably delaying one of the parallel data streams to compensate for any detected skew error between the two channels; and multiplexing said two parallel data streams into a single data stream, based on timing signals derived as a result of the step of detecting block boundaries during the initialization.
Claim 11
Dependent Claim
141 words
For use in a 4B/5B encoded transmission system, a method for transmitting data in parallel over two communication channels, comprising the steps of: demultiplexing a serial digital data stream into two parallel data streams, by transmitting successive blocks of four bits of data onto alternate communication channels; receiving demultiplexed data signals over the two communication channels; detecting block boundaries between successive blocks of data received over each of said channels; detecting any skew error between the two channels by measuring the phase difference between the block boundaries in the two channels; PG,28 controllably delaying one of the parallel data streams to compensate for any detected skew error between the two channels; and multiplexing said two parallel data streams into a single data stream, based on timing signals derived as a result of the step of detecting block boundaries during the initialization.
Claim 12
Dependent Claim
36 words
A method as defined in claim 9, wherein the step of detecting block boundaries includes: detecting a binary code sequence received in said each of said channels, said binary code sequence uniquely identifying a block boundary.
Claim 13
Dependent Claim
31 words
A method as defined in claim 10, wherein: the binary code sequence appears in said each of said channels as a result of transmission of a HALT code sequence during initialization.
Claim 14
Dependent Claim
31 words
A method as defined in claim 11, wherein: the binary code sequence always appears in one of said channels eight data bits after it appears in the other of said channels.
Claim 15
Dependent Claim
61 words
A method as defined in claim 12, wherein: the HALT code sequence comprises alternating groups of five ones and five zeros; after the demultiplexing step, the HALT code sequence appears in said each of said channels as one of two possible repetitive twenty-bit codes; and the binary code sequence that uniquely identifies block boundaries appears in both possible repetitive twenty-bit codes.
Claim 16
Dependent Claim
121 words
For use in transmitting a run-length-limited data stream, apparatus for multiplexing and synchronizing data from two parallel communication channels, on which an original data stream has been encoded by transmitting successive blocks of n bits of the original data stream over alternate channels, the apparatus comprising: means for decoding data received over the two communication channels, to yield two parallel streams of decoded binary data; means for detecting block boundaries using a code sequence established during initialization of the original data stream in each of the parallel streams of data during operation of a token ring network; and means for multiplexing said two parallel streams of decoded binary data, based on the detected block boundaries, to recover the original data stream.
Claim 17
Dependent Claim
121 words
For use in transmitting a run-length-limited data stream, apparatus for multiplexing and synchronizing data from two parallel communication channels, on which an original data stream has been encoded by transmitting successive blocks of n bits of the original data stream over alternate channels, the apparatus comprising: means for decoding data received over the two communication channels, to yield two parallel streams of decoded binary data; means for detecting block boundaries using a code sequence established during initialization of the original data stream in each of the parallel streams of data during operation of a token ring network; and means for multiplexing said two parallel streams of decoded binary data, based on the detected block boundaries, to recover the original data stream.
Claim 18
Dependent Claim
19 words
Apparatus as defined in claim 14, and further comprising: means for compensating for skew error between the two channels.
Claim 19
Dependent Claim
83 words
Apparatus as defined in claim 15, wherein: the means for detecting block boundaries includes means for detecting a preselected binary code sequence in the received parallel data streams; and the means for compensating for skew error is responsive to said means for detecting a preselected binary code sequence, and includes variable delay means; wherein said detection of the preselected binary code sequence at different times in the two channels is used to control the variable delay means and bring the channels into synchronism.
Claim 20
Dependent Claim
111 words
Apparatus as defined in claim 16, wherein: the means for detecting block boundaries and the means for compensating for skew error are operative only during transmission of a HALT signal state during initialization; the preselected binary code sequence always appears at a block boundary in both parallel data streams, and always appears in one of said parallel data streams at a fixed data-bit interval following its appearance in the other of said parallel data streams; and the apparatus further comprises a fixed delay in one of the data channels, to align the binary code sequences in the two channels and thereby facilitate operation of the means for compensating for skew error.
Claim 21
Dependent Claim
71 words
Apparatus as defined in claim 17, wherein: one of the parallel data streams is delayed, prior to transmission, by a time equivalent to one-half of a data bit interval, to minimize interference between the channels; and the apparatus further comprises an additional fixed delay also equivalent to one-half of a data bit interval, applied to the other of the parallel data streams to compensate for the delay applied prior to transmission.
Claim 22
Dependent Claim
67 words
Apparatus as defined in claim 17, wherein: the means for detecting block boundaries includes a multibit digital comparator in each of said channels, for comparing strings of successively received binary signals with the preselected binary code sequence; and the means for compensating for skew error includes a phase detector coupled to the digital comparators in both channels, to provide a measure of skew error between the channels.
References Cited (Backward Citations)
US3456206A
Cited
US3465101A
Cited
US3733550A
Cited
US3980826A
Cited
US3993953A
Cited
US4083010A
Cited
US4523181A
Cited
US4371974A
Cited
US4380815A
Cited
US4563767A
Cited
US4852129A
Cited
US4516248A
Cited
US4637036A
Cited
US4553102A
Cited
US4821298A
Cited
US4748346A
Cited
US4627073A
Cited
US4630286A
Cited
EP0213641A2
Cited
US4818995A
Cited
US4864303A
Cited
EP0304081A2
Cited
US4862485A
Cited
US4932073A
Cited
US4823360A
Cited
US4866704A
Cited
US5097489A
Cited
US5119402A
Cited
US5200979A
Cited
US5235617A
Cited
US5255287A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-04-17 | 1998-10-17 | 1999-04-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-04-17 | 2002-10-17 | 2003-04-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-04-17 | 2006-10-17 | 2007-04-18 | $7700.00 | Window Closed / Lapsed |