1. Field of the Invention
This invention relates broadly to telecommunications. More particularly, this invention relates to the Synchronous Optical Network (SONET)/Synchronous Digital Hierarchy (SDH) and to achieving and maintaining frame synchronization in the presence of a specified bit error rate (BER).
2. State of the Art
The Synchronous Optical Network (SONET) or the Synchronous Digital Hierarchy (SDH), as it is known in Europe, is a common telecommunications transport scheme which is designed to accommodate both DS-1 (T1) and E1 traffic as well as multiples (DS-3 and E-3) thereof.
Developed in the early 1980s, SONET has a base (STS-1) rate of 51.84 Mbit/sec in North America. The STS-1 signal can accommodate 28 DS-1 signals or 21 E1 signals or a combination of both. The basic STS-1 signal has a frame length of 125 microseconds (8,000 frames per second) and is organized as a frame of 810 octets (9 rows by 90 byte-wide columns). It will be appreciated that 8,000 frames*810 octets per frame*8 bits per octet=51.84 Mbit/sec.
In Europe, the base (STM-1) rate is 155.520 Mbit/sec, equivalent to the North American STS-3 rate (3*51.84=155.520). The STS-3 (STM-1) signals can accommodate 3 DS-3 signals or 63 E1 signals or 84 DS-1 signals, or a combination of them. The STS-12 signals are 622.080 Mbps and can accommodate 12 DS-3 signals, etc. The STS-48 signals are 2,488.320 Mbps and can accommodate 48 DS-3 signals, etc. The highest defined STS signal, the STS-768, is nearly 40 Gbps (gigabits per second). The abbreviation STS stands for Synchronous Transport Signal and the abbreviation STM stands for Synchronous Transport Module. STS-n signals are also referred to as Optical Carrier (OC-n) signals when transported optically rather than electrically.
Prior art
Prior art
Due to variations in clocks at different nodes in the network, the SONET frame may wander in time. In order to properly process the SONET signal as it passes from one node to another, each node must perform a frame synchronization, i.e. determine where the SONET frame starts. As described above, the A1 and A2 bytes indicate the start of the SONET frame for an STS-1 signal. In an STS-N signal, the bytes are interleaved and there are N A1 bytes followed by N A2 bytes. In order to synchronize the frame, each node must employ some method of determining where the A1 and A2 bytes are in the frame. In an STS-N signal where N is less than or equal to 48, the A1 bytes are all set to the value two hundred forty-six (11110110), also known in hexadecimal notation as “F6”, and the A2 bytes are all set to a value of forty (00101000), also known in hexadecimal notation as “28”. Where N is 192 or 768, enhanced framing patterns are used. These include inverse A1 and A2 bytes which are nine (00001001), hexadecimal “09”, and two hundred fifteen (11010111), hexadecimal “D7”, respectively. Where N is 768, sixty-four bytes are used for framing and the rest are scrambled.
Nodes in the network must detect the framing pattern in order to synchronize the frame and must continue to monitor the signal to detect when the frame falls out of synchronization. An out of frame (OOF) alarm occurs when the incoming signal has four consecutive errored framing patterns. Recovery from the alarm occurs when the incoming signal has two consecutive frames with no framing errors. The maximum permitted OOF detection time is 625 microseconds. Moreover, whatever framing algorithm is used, it must not declare OOF more than once every six minutes in the presence of a BER of 1×10−3. A loss of frame (LOF) alarm occurs when an OOF alarm persists for three milliseconds. Recovery from LOF occurs when the OOF alarm is off for one millisecond.
A popular prior art framing algorithm locates a subset of the A1 and A2 bytes that are clustered around the last A1 byte and the first A2 byte (the “A1A2 boundary”) in order to synchronize the frame. This algorithm is adequate. However, it is subject to deception by framing pattern mimics on H1H2 bytes when there is a lack of pointer movements. Deception by framing pattern mimics can be eliminated by widening the framing byte comparison to include more bytes. However, doing so leads to unnecessarily long frame synchronization time in the presence of a high BER of 1×10−3.
It is therefore an object of the invention to provide a method for synchronizing a SONET/SDH frame.
It is another object of the invention to provide a method for synchronizing a SONET/SDH frame which operates quickly.
It is a further object of the invention to provide a method for synchronizing a SONET/SDH frame which operates quickly in the presence of a high BER of 1×10−3.
It is also an object of the invention to provide a method for synchronizing a SONET/SDH frame which is not deceived by framing pattern mimics.
In accord with these objects, which will be discussed in detail below, the frame synchronization method of the present invention uses one framing pattern comparison to find the frame and a second framing pattern comparison to monitor the frame after it is acquired. The first framing pattern comparison looks for three bytes: the first AND last of either the A1 or the A2 bytes, and the first OR last of the other of the A2 or A1 bytes. This results in four possible framing patterns, each of which is equally optimal. They are: first and last A1 plus first A2, first and last A1 plus last A2, first and last A2 plus first A1, and first and last A2 plus last A1. The first framing pattern comparison is thus twenty-four bits in length. After acquisition (i.e., after in-frame is established), the second framing pattern comparison uses only twelve bits, i.e. the last four bits of the last A1 byte and all of the first A2 byte. The first framing pattern comparisons are made with a window of N+1 bytes. The method of the invention meets the requirements of Telcordia GR-253 and eliminates aliasing in the last H2 bytes. The method can also be applied to enhanced framing in STS-192 and STS-768.
An exemplary implementation of the method is realized in a state machine. The incoming data is simultaneously shifted into multiple parallel shift registers, each having a one bit phase difference from the next. Each shift register is coupled to a frame detector which looks for the A1 and A2 bytes in the register in order to find the beginning of the frame. The outputs of the shift registers are coupled to a multiplexer and the output of the multiplexer is selected based on which frame detector finds the framing pattern. The bytes exiting the shift register in which the framing pattern is found are selected and comprise the framed signal.
Additional objects and advantages of the invention will become apparent to those skilled in the art upon reference to the detailed description taken in conjunction with the provided figures.
The frame synchronization method of the present invention uses one framing pattern comparison to find the frame and a second framing pattern comparison to monitor the frame after it is acquired. The first framing pattern comparison looks for one of the first AND last of either the A1 or the A2 bytes, and the first OR last of the other of the A2 or A1 bytes. In the illustrated embodiment of
After acquisition, the second framing pattern comparison uses only twelve bits, i.e. the last four bits of the last A1 byte and all of the first A2 byte. The framing pattern comparisons are made with a window of N+1 bytes as illustrated in
An exemplary implementation of the method is realized in a state machine which is illustrated in
Referring now to
There have been described and illustrated herein methods and apparatus for achieving and maintaining SONET/SDH frame synchronization in the presence of a specified bit error rate. While particular embodiments of the invention have been described, it is not intended that the invention be limited thereto, as it is intended that the invention be as broad in scope as the art will allow and that the specification be read likewise. Thus, while a state machine has been disclosed as an apparatus for realizing the methods, it will be appreciated that other apparatus such as a gate array could be used as well. In addition, while the methods have been disclosed using the last A1 byte plus the first and last A2 bytes, any of the four combinations described above will yield substantially the same results. Those skilled in the art will appreciate that the window of N+1 bytes applies only to framing patterns which include the last A1 and first A2 bytes. The other two framing patterns will require a window of 2N bytes. It will therefore be appreciated by those skilled in the art that yet other modifications could be made to the provided invention without deviating from its spirit and scope as claimed.