|
CRC-based Framing
CRC-based framing is a kind of frame synchronization used in Asynchronous Transfer Mode (ATM) and other similar protocols. The concept of CRC-based framing was developed by StrataCom, Inc. in order to improve the efficiency of a pre-standard Asynchronous Transfer Mode (ATM) link protocol. This technology was ultimately used in the principal link protocols of ATM itself and was one of the most significant developments of StrataCom. An advanced version of CRC-based framing was used in the ITU-T SG15 G.7041 Generic Framing Procedure (GFP), which itself is used in several packet link protocols. Overview of CRC-based framing The method of CRC-Based framing re-uses the header cyclic redundancy check (CRC), which is present in ATM and other similar protocols, to provide framing on the link with no additional overhead. In ATM, this field is known as the Header Error Control/Check (HEC) field. It consists of the remainder of the division of the 32 bits of the header (taken as the coefficient ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frame Synchronization
In telecommunication, frame synchronization or framing is the process by which, while receiving a stream of framed data, incoming frame alignment signals (i.e., a distinctive bit sequences or syncwords) are identified (that is, distinguished from data bits), permitting the data bits within the frame to be extracted for decoding or retransmission. Framing If the transmission is temporarily interrupted, or a bit slip event occurs, the receiver must re-synchronize. The transmitter and the receiver must agree ahead of time on which frame 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 slot within the frame, a noninformation bit or framing bit that is used for synchronization of the incoming data with the receiver. In a bit stream, framing bits indicate the beginning or end of a frame. They occur at specified positions in the frame, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Asynchronous Transfer Mode
Asynchronous Transfer Mode (ATM) is a telecommunications standard defined by American National Standards Institute (ANSI) and ITU-T (formerly CCITT) for digital transmission of multiple types of traffic. ATM was developed to meet the needs of the Broadband Integrated Services Digital Network as defined in the late 1980s, and designed to integrate telecommunication networks. It can handle both traditional high-throughput data traffic and real-time, low-latency content such as telephony (voice) and video.ATM Forum, The User Network Interface (UNI), v. 3.1, , Prentice Hall PTR, 1995, page 2. ATM provides functionality that uses features of circuit switching and packet switching networks by using asynchronous time-division multiplexing.McDysan (1999), p. 287. In the OSI reference model data link layer (layer 2), the basic transfer units are called '' frames''. In ATM these frames are of a fixed length (53 octets) called ''cells''. This differs from approaches such as Internet Pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
StrataCom
StrataCom, Inc. was a supplier of Asynchronous Transfer Mode (ATM) and Frame Relay high-speed wide area network (WAN) switching equipment. StrataCom was founded in Cupertino, California, United States, in January 1986, by 26 former employees of the failing Packet Technologies, Inc. StrataCom produced the first commercial cell switch, also known as a fast-packet switch. ATM was one of the technologies underlying the world's communications systems in the 1990s. Origins of the IPX at Packet Technologies Internet pioneer Paul Baran was an employee of Packet Technologies and provided a spark of invention at the initiation of the Integrated Packet Exchange (IPX) project (StrataCom's IPX communication system is unrelated to Novell's IPX Internetwork Packet Exchange protocol). The IPX was initially known as the PacketDAX, which was a play on words of Digital access and cross-connect system (or DACS). A rich collection of inventions were contained in the IPX, and many were provided by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generic Framing Procedure
{{Unreferenced, date=December 2009 Generic Framing Procedure (GFP) is a multiplexing technique defined by ITU-T G.7041. This allows mapping of variable length, higher-layer client signals over a circuit switched transport network like OTN, SDH/SONET or PDH. The client signals can be protocol data unit (PDU) oriented (like IP/ PPP or Ethernet Media Access Control) or can be block-code oriented (like Fibre Channel). There are two modes of GFP: Generic Framing Procedure - Framed (GFP-F) and Generic Framing Procedure - Transparent (GFP-T): * GFP-F maps each client frame into a single GFP frame. GFP-F is used where the client signal is framed or packetized by the client protocol. * GFP-T, on the other hand, allows mapping of multiple 8B/10B block-coded client data streams into an efficient 64B/65B block code for transport within a GFP frame. GFP utilizes a length/ HEC-based frame delineation mechanism that is more robust than that used by High-Level Data Link Control (HDLC), which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Redundancy Check
A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short ''check value'' attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated and, in the event the check values do not match, corrective action can be taken against data corruption. CRCs can be used for error correction (see bitfilters). CRCs are so called because the ''check'' (data verification) value is a ''redundancy'' (it expands the message without adding information) and the algorithm is based on ''cyclic'' codes. CRCs are popular because they are simple to implement in binary hardware, easy to analyze mathematically, and particularly good at detecting common errors caused by noise in transmission channels. Because the check value has a fixed length, the function that generates it is occasionally used as a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate is . An example with three indeterminates is . Polynomials appear in many areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated scientific problems; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings and algebraic varieties, which are central concepts in algebra and algebraic geometry. Etymology The word ''polynomial'' join ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics Of Cyclic Redundancy Checks
The cyclic redundancy check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around. Any string of bits can be interpreted as the coefficients of a message polynomial of this sort, and to find the CRC, we multiply the message polynomial by x^n and then find the remainder when dividing by the degree-n generator polynomial. The coefficients of the remainder polynomial are the bits of the CRC. Maths In general, computation of CRC corresponds to Euclidean division of polynomials over GF(2): :M(x) \cdot x^n = Q(x) \cdot G(x) + R(x). Here M(x) is the original message polynomial and G(x) is the degree-n generator polynomial. The bits of M(x) \cdot x^n are the original message with n zeroes added at the end. The CRC 'checksum' is formed by the coefficients of the remainder polynomial R(x) whose degree is strictly less ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
E-carrier
The E-carrier is a member of the series of carrier systems developed for digital transmission of many simultaneous telephone calls by time-division multiplexing. The European Conference of Postal and Telecommunications Administrations (CEPT) originally standardized the E-carrier system, which revised and improved the earlier American T-carrier technology, and this has now been adopted by the International Telecommunication Union Telecommunication Standardization Sector (ITU-T). It was widely used in almost all countries outside the US, Canada, and Japan. E-carrier deployments have steadily been replaced by Ethernet as telecommunication networks transition towards all IP. E1 frame structure An E1 link operates over two separate sets of wires, usually unshielded twisted pair (balanced cable) or using coaxial (unbalanced cable). A nominal 3 volt peak signal is encoded with pulses using a method avoiding long periods without polarity changes. The line data rate is 2.048 Mbit/s ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Synchronous Optical Networking
Synchronous optical networking (SONET) and synchronous digital hierarchy (SDH) are standardized protocols that transfer multiple digital bit streams synchronously over optical fiber using lasers or highly coherent light from light-emitting diodes (LEDs). At low transmission rates data can also be transferred via an electrical interface. The method was developed to replace the plesiochronous digital hierarchy (PDH) system for transporting large amounts of telephone calls and data traffic over the same fiber without the problems of synchronization. SONET and SDH, which are essentially the same, were originally designed to transport circuit mode communications (e.g., DS1, DS3) from a variety of different sources, but they were primarily designed to support real-time, uncompressed, circuit-switched voice encoded in PCM format. The primary difficulty in doing this prior to SONET/SDH was that the synchronization sources of these various circuits were different. This meant that each ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Byte
The byte is a unit of digital information that most commonly consists of eight bits. Historically, the byte was the number of bits used to encode a single character of text in a computer and for this reason it is the smallest addressable unit of memory in many computer architectures. To disambiguate arbitrarily sized bytes from the common 8-bit definition, network protocol documents such as The Internet Protocol () refer to an 8-bit byte as an octet. Those bits in an octet are usually counted with numbering from 0 to 7 or 7 to 0 depending on the bit endianness. The first bit is number 0, making the eighth bit number 7. The size of the byte has historically been hardware-dependent and no definitive standards existed that mandated the size. Sizes from 1 to 48 bits have been used. The six-bit character code was an often-used implementation in early encoding systems, and computers using six-bit and nine-bit bytes were common in the 1960s. These systems often had memory words ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
T-carrier
The T-carrier is a member of the series of carrier systems developed by AT&T Bell Laboratories for digital transmission of multiplexed telephone calls. The first version, the Transmission System 1 (T1), was introduced in 1962 in the Bell System, and could transmit up to 24 telephone calls simultaneously over a single transmission line of copper wire. Subsequent specifications carried multiples of the basic T1 (1.544 Mbit/s) data rates, such as T2 (6.312 Mbit/s) with 96 channels, T3 (44.736 Mbit/s) with 672 channels, and others. Although a ''T2'' was defined as part of AT&T's T-carrier system, which defined five levels, T1 through T5, only the T1 and T3 were commonly in use.1999 ad: On the left, in an aisle seat, a man who very much "filled" his airline seat while on the right side of the aisle is a height-challenged man whose shoe toes barely reach the floor Transmission System 1 The T-carrier is a hardware specification for carrying multiple time-division mul ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Time-division Multiplexing
Time-division multiplexing (TDM) is a method of transmitting and receiving independent signals over a common signal path by means of synchronized switches at each end of the transmission line so that each signal appears on the line only a fraction of time in an alternating pattern. This method transmits two or more digital signals or analog signals over a common channel. It can be used when the bit rate of the transmission medium exceeds that of the signal to be transmitted. This form of signal multiplexing was developed in telecommunications for telegraphy systems in the late 19th century, but found its most common application in digital telephony in the second half of the 20th century. History Time-division multiplexing was first developed for applications in telegraphy to route multiple transmissions simultaneously over a single transmission line. In the 1870s, Émile Baudot developed a time-multiplexing system of multiple Hughes telegraph machines. In 1944, the Britis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
