← Back to Patent Explorer
EP0397139A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Serial transport frame format method

Assignee: Alcatel Lucent NV
•
Filing: 1990-05-09
•
Granted: —
•
Expires: 2010-05-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A serial transport frame format is described which transfers data between two locations. The serial transport frame format comprises a fixed number of channels per frame, each channel having a predetermined size. One channel per frame contains frame synchronization information and channels which convey a data, contain a first portion for the transfer of data and a second portion which contains associated control information. <IMAGE>

Inventors

  • 👤 Raymond Eugene Tyrrell
  • 👤 Stephen Carson Dunning
  • 👤 Richard James Sanders, Jr.
  • 👤 Claude Melvin Hurlocker
  • 👤 Michael John Gingell
  • 👤 Jeffrey Paul Jones

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-08 14:52
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1611; H04J3/02; H04J3/12

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 132 words
Serial transport frame format method for positioning information to be transferred in a serial bit stream, comprising the steps of: - arranging the data to be transferred in frames, where each frame comprises N channels, each channels having a fixed length of bits, where N is an integer greater than one; - for each of M of said N channels, where M is an integer equal to or less than N, placing data representing information to be conveyed in one portion of the channel; - for each of M of said N channels, where M is an integer equal to or less than N, placing control information related to said channel data in a second portion of the channel; and - placing synchronization data in at least one channel of each frame.
Claim 2
Dependent Claim 132 words
Serial transport frame format method for positioning information to be transferred in a serial bit stream, comprising the steps of: - arranging the data to be transferred in frames, where each frame comprises N channels, each channels having a fixed length of bits, where N is an integer greater than one; - for each of M of said N channels, where M is an integer equal to or less than N, placing data representing information to be conveyed in one portion of the channel; - for each of M of said N channels, where M is an integer equal to or less than N, placing control information related to said channel data in a second portion of the channel; and - placing synchronization data in at least one channel of each frame.
Claim 3
Dependent Claim 38 words
A method as claimed in claim 1, wherein the channel associated control information for at least some of the channels of each frame comprises signalling information associated with the corresponding data in the first portion of the channel.
Claim 4
Dependent Claim 39 words
A method as claimed in claim 1 or 2, wherein the channel associated control information for at least some of the channels of each frame contains timing information associated with the data in the first portion of the channel.
Claim 5
Dependent Claim 34 words
A method as claimed in claim 1 or 3, wherein the channel associated control information for at least some of the channels further comprises parity information associated with the remaining data in the channel.
Claim 6
Dependent Claim 61 words
A method as claimed in claim 4, wherein at least one of the M channels of each frame contains data in the first portion of the channel and at least a valid bit and an interrupt bit in the second portion of the channel along with the associated address bits related to the data in the first portion of the channel.
Claim 7
Dependent Claim 49 words
A method as claimed in claim 1 or 5, wherein the second portion of the channel that contains synchronization information contains information regarding the A or B path for the transfer of information in systems comprising redundant A and B paths for the transfer of information between two locations.
Claim 8
Dependent Claim 28 words
A method as claimed in claim 6, wherein the second portion of the channel that contains synchronization information further comprises clocking information related to the serial transport frame.
Claim 9
Dependent Claim 27 words
A method as claimed in claim 7, wherein the second portion of the channel that contains synchronization information comprises parity information related to the serial transport frame.
Claim 10
Dependent Claim 27 words
A method as claimed in claim 8, wherein the second portion of the channel that contains synchronization information further comprises parity information related to the channel itself.
Claim 11
Dependent Claim 60 words
A method as claimed in claim 1, wherein at least one of the M channels of each frame contains data in the first portion of the channel and at least a valid bit and an interrupt bit in the second portion of the channel along with associated address bits related to the data in the first portion of the channel.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag