View source for Frame synchronization

{{context|date=February 2013}}

In [[telecommunications]], '''frame synchronization''' or '''framing''' is the process by which, while receiving a stream of fixed-length  [[Frame (networking)|frames]], the receiver identifies the frame boundaries, permitting the [[data]] bits within the frame to be extracted for decoding or retransmission.

When packets of varying length are sent, it is necessary to have an instantly recognizable packet-end delimiter (e.g., Ethernet's [[Ethernet_frame#End_of_frame_–_physical_layer|end of stream symbol]]). Loss of carrier signal can be interpreted as a packet-end delimiter in some cases. When a continuous stream of fixed-length frames are sent, a synchronized receiver can in principle identify frame boundaries forever.  In practice, receivers can usually maintain synchronization despite transmission errors; [[bit slip]]s are much rarer than [[bit error]]s.  Thus, it is acceptable to use a much smaller frame boundary marker,  at the expense of a lengthier process to establish synchronization in the first place.

Frame synchronization is achieved when the incoming frame alignment signals are identified (that is, distinguished from data bits), permitting the data bits within the frame to be extracted for decoding or retransmission.

== Framing ==
{{Redirect|Flag sequence|the emojis|Emoji flag sequence}}
If the transmission is temporarily interrupted, or a bit slip event occurs, the receiver must re-synchronize.
[[Image:Frame Synced Stream.jpg|frame|none|Frame synchronized PCM stream — telemetry application]]

The transmitter and the receiver must agree ahead of time on which frame [[synchronization in telecommunications|synchronization]] scheme they will use.

Common frame synchronization schemes are:

;Framing bit: A common practice in [[telecommunications]], for example in [[T-carrier]], is to insert, in a dedicated [[Time-division multiplexing|time slot]] within the frame, a noninformation '''framing bit''' that is used for synchronization of the incoming data with the receiver. In a [[bit stream]], framing bits are predictable (do not carry information), and occur at specified positions in the frame.  Correct framing is verified when almost all framing bits  (minus a small allowance for transmission errors) have their predicted values.
;Syncword and flag sequence framing: Rather than a single bit, some systems use a multi-bit [[syncword]] in each frame, or a '''flag sequence''' that marks the beginning and end of each frame. [[High-Level Data Link Control]] and similar systems use flag sequences.<ref>{{Cite IETF |rfc=1662 |title=PPP in HDLC-like Framing |last=Simpson |first=William A. |date=July 1994 |publisher=Internet Engineering Task Force}}</ref>
;CRC-based framing: Some telecommunications hardware uses [[CRC-based framing]], where correct framing is verified when almost all frames have valid CRCs.

==Frame synchronizer==
[[Image:PCM Stream.jpg|frame|none|PCM stream prior to frame synchronization]]

In [[telemetry]] applications, a ''frame synchronizer'' is used to locate frame boundaries within a serial [[pulse-code modulated]] (PCM) binary stream.

The frame synchronizer immediately follows the bit synchronizer in most telemetry applications.  Without frame synchronization, [[decommutation]] is impossible.

[[Image:Frame Synced Stream.jpg|frame|none|Frame-synchronized PCM stream]]

The frame synchronizer searches the incoming bit-stream for occurrences of the frame synchronization pattern.  If the pattern persists for long enough that an accidental match is implausible, the synchronizer declares the data synchronized and available for decoding.  If a large number of mis-matches occur, the synchronizer declares a loss of synchronization.

The search can be sequential (only consider one starting point at a time), or multiple candidate starting points may be considered at once.  Advanced techniques continue searching even while synchronization is established, so that, if synchronization is lost, by the time the loss is noticed a new frame start position has been found.<ref>{{cite patent
 |country=US |number=5621773 |status=patent |gdate=1997-04-15
 |title=Method and Apparatus for Fast Synchronization of T1 Extended Superframes
 |assign=[[LSI Logic Corporation]]
}}</ref>

[[Image:Commutation.svg|frame|none|Different types of commutation within a frame synchronized PCM stream]]

It is not uncommon to have multiple levels of frame synchronization, where a series of frames is assembled into a larger "superframe" or "major frame".  Individual frames are then "minor frames" within that superframe.  Each frame contains a subframe ID (often a simple counter) which identifies its position within the superframe.  A second frame synchronizer establishes superframe synchronization.  This allows subcommutation, where some data is sent less frequently than every frame.  

==See also==
* [[Asynchronous start-stop]]
* [[Phase synchronization]]
* [[Self-synchronizing code]]
* [[Superframe]]

==References==
{{Reflist}}
{{FS1037C MS188}}

===Scientific articles===
* [https://ieeexplore.ieee.org/abstract/document/1091127 J. L. Massey. "Optimum frame synchronization ". IEEE trans. comm., com-20(2):115-119, April 1972].
* [https://ieeexplore.ieee.org/abstract/document/1094813 R Scholtz. "Frame synchronization techniques", ''IEEE Transactions on Communications'', 1980].
* P. Robertson. "Optimal Frame Synchronization for Continuous and Packet Data Transmission", PhD Dissertation, 1995, Fortschrittberichte VDI Reihe 10, Nr. 376 [https://web.archive.org/web/20110718231623/http://www.kn-s.dlr.de/People/Robertson/Papers/diss.pdf PDF]

[[Category:Data transmission]]
[[Category:Synchronization]]