← Back to Patent Explorer
US5214643A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for inserting an asynchronous 139,264 kbit/s signal into a 155,520 kbit/s signal

Assignee: Siemens AG
•
Filing: 1989-04-17
•
Granted: 1993-05-25
•
Expires: 2009-04-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for inserting an asynchronous 139,264 kbit/s signal into a 155,520 kbit/s signal interlaces an asynchronous 139,264 kbit/s signal from the European digital signal hierarchy into the frame structure of a 155,520 kbit/s signal STM-1 of a network node interface NNI. Bits that are compiled in the form of a virtual container VC-4 in a sub-frame are inserted into the frame structure, which sub-frame is composed of 9 sections each having respectively 261 sub-sections of 1 byte or, respectively, 8 bits each. The first sub-section is reserved for a path overhead (POH). The remaining 260 sub-sections are inventively subdivided into 20 blocks having a first part (W, X, Y, Z) of 1 byte for auxiliary signals and having a second part of 12 bytes composed of information bits (I). This method can be employed at a network node interface NNI in a synchronous digital hierarchy.

Inventors

  • 👤 Horst Mueller
  • 👤 Pirmin Foerg

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 08:43
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1611; H04J3/1617; H04J2203/00; H04J2203/0001; H04J2203/0089; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5672

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 269 words
A method of assembling data for a digital network by inserting an asynchronous 139,264 kbit/s signal into a pulse frame of a 155,250 kbit/s signal (STM-1) with a transport-module (STM-1) composed of 9 rows of signal bit stream, each containing, first, 9 bytes for a section head (SOH) or for a pointer (AU-4 PTR) and subsequently, a further 261 bytes for an administration unit (AU-4), said administration unit incorporating a virtual container (VC-4) composed of 9 rows, each of which rows contains, first, 1 byte for a path overhead and, subsequently, a further 260 bytes, comprising the steps of subdividing said further 260 bytes into 20 blocks of 13 bytes each; every block being subdivided into a first part having 1 byte or, respectively, 8 bits, and into a second part having 12 bytes or, respectively, 96 bits; assigning bits to the bytes of said first parts so that the first part (W) of the first block comprises respectively 8 information bits (I); the first part (X) of the second, 6th, 10th, 14th and 18th blocks each comprises 1justification control bit (C), 5 fixed justification bits (R) and 2 freely available message information bits (M); the first part (Y) of the 3rd through 5th, 7th through 9th, 11th through 13th, 15th through 17th and 19th blocks comprise respectively 8 fixed justification bits (R); and the first part (Z) of the 20th block comprises respectively 6 information bits (I), 1 possible justification bit (S) and 1 fixed justification bit (R); and assigning bits to the bytes of said second part of all blocks each comprises respectively 96 information bits (I).
Claim 2
Independent Claim 269 words
A method of assembling data for a digital network by inserting an asynchronous 139,264 kbit/s signal into a pulse frame of a 155,250 kbit/s signal (STM-1) with a transport-module (STM-1) composed of 9 rows of signal bit stream, each containing, first, 9 bytes for a section head (SOH) or for a pointer (AU-4 PTR) and subsequently, a further 261 bytes for an administration unit (AU-4), said administration unit incorporating a virtual container (VC-4) composed of 9 rows, each of which rows contains, first, 1 byte for a path overhead and, subsequently, a further 260 bytes, comprising the steps of subdividing said further 260 bytes into 20 blocks of 13 bytes each; every block being subdivided into a first part having 1 byte or, respectively, 8 bits, and into a second part having 12 bytes or, respectively, 96 bits; assigning bits to the bytes of said first parts so that the first part (W) of the first block comprises respectively 8 information bits (I); the first part (X) of the second, 6th, 10th, 14th and 18th blocks each comprises 1justification control bit (C), 5 fixed justification bits (R) and 2 freely available message information bits (M); the first part (Y) of the 3rd through 5th, 7th through 9th, 11th through 13th, 15th through 17th and 19th blocks comprise respectively 8 fixed justification bits (R); and the first part (Z) of the 20th block comprises respectively 6 information bits (I), 1 possible justification bit (S) and 1 fixed justification bit (R); and assigning bits to the bytes of said second part of all blocks each comprises respectively 96 information bits (I).
Claim 3
Dependent Claim 70 words
The method according to claim 1, including the steps of filling all 5 justification control bits (C) of a row with the status of logical "0" when an information bit (I) is being transmitted instead of the possible justification bit (S); and filling all 5 justification control bits (C) in a row with the status of logical "1" when the possible justification bit (S) is in fact a justification bit.
Claim 4
Independent Claim 153 words
A method of assembling data for a digital network by inserting an asynchronous 139,264 kbit/s signal into a pulse frame of a 155,520 kbit/s signal (STM-1) with a transport-module (STM-1) composed of 9 rows of signal bit stream each containing, first, 9 bytes for a section head (SOH) or for a pointer (AU-4 PTR) and subsequently a further 261 bytes for an administration unit (AU-4), said administration frame incorporating a virtual container (VC-4) composed of 9 rows, each of which rows contains first one byte for path overhead, and a subsequent 260 bytes in each of said 9 rows, comprising the steps of taking said 260 bytes for each of said 9 rows successively from the sequence: 1W+96I, 1X+96I, 3(1Y+96I), 1X+96I, 3(1Y+96I), 1X+96I, 3(1Y+96I), 1X+96I, 3(1Y+96I), 1X+96I, 1Y+96I, 1Z+96I, where I and W represent information bits, and X, Y and Z designate bits which are at least partially independent of the information bits.
Claim 5
Independent Claim 153 words
A method of assembling data for a digital network by inserting an asynchronous 139,264 kbit/s signal into a pulse frame of a 155,520 kbit/s signal (STM-1) with a transport-module (STM-1) composed of 9 rows of signal bit stream each containing, first, 9 bytes for a section head (SOH) or for a pointer (AU-4 PTR) and subsequently a further 261 bytes for an administration unit (AU-4), said administration frame incorporating a virtual container (VC-4) composed of 9 rows, each of which rows contains first one byte for path overhead, and a subsequent 260 bytes in each of said 9 rows, comprising the steps of taking said 260 bytes for each of said 9 rows successively from the sequence: 1W+96I, 1X+96I, 3(1Y+96I), 1X+96I, 3(1Y+96I), 1X+96I, 3(1Y+96I), 1X+96I, 3(1Y+96I), 1X+96I, 1Y+96I, 1Z+96I, where I and W represent information bits, and X, Y and Z designate bits which are at least partially independent of the information bits.
Claim 6
Dependent Claim 35 words
The method according to claim 3, wherein X=CRRRRRMM, Y=RRRRRRRR, Z=IIIIIISR, where R and C are control and justifications bits, respectively, identify justification bits, M designates message information bits, and S designates a further justification bit.
Claim 7
Dependent Claim 70 words
The method according to claim 4, including the steps of filling all 5 justification control bits (C) of a row with the status of logical "0" when an information bit (I) is being transmitted instead of the possible justification bit (S); and filling all 5 justification control bits (C) in a row with the status of logical "1" when the possible justification bit (S) is in fact a justification bit.

References Cited (Backward Citations)

US4594708A Cited
US4484327A Cited
US4538286A Cited
US4807221A Cited
US4924459A Cited
US4752923A Cited
US4862480A Cited
US4949339A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-05-24 1996-11-23 1997-05-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-05-24 2000-11-23 2001-05-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-05-24 2004-11-23 2005-05-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag