Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
422 views

Data Communication - Digital Data Communication

Data communication Chapter 6 Digital Data Communications Techniques 1 Data communication tasks For two devices linked by transmission medium to exchange data this task requires a grate deal of cooperation and agreement between the two devices including: Synchronization. Error detection. Error correction. Interfacing. 2 Asynchronous and Synchronous Transmission timing problems require a mechanism to synchronize the transmitter and receiver receiver samples stream at bit intervals if clocks

Uploaded by

Ahmad Shdifat
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
422 views

Data Communication - Digital Data Communication

Data communication Chapter 6 Digital Data Communications Techniques 1 Data communication tasks For two devices linked by transmission medium to exchange data this task requires a grate deal of cooperation and agreement between the two devices including: Synchronization. Error detection. Error correction. Interfacing. 2 Asynchronous and Synchronous Transmission timing problems require a mechanism to synchronize the transmitter and receiver receiver samples stream at bit intervals if clocks

Uploaded by

Ahmad Shdifat
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 44

Data communication

Chapter 6 Digital Data Communications Techniques

Data communication tasks


For two devices linked by transmission medium to exchange data this task requires a grate deal of cooperation and agreement between the two devices including:
Synchronization. Error detection. Error correction. Interfacing.

Asynchronous and Synchronous Transmission


timing problems require a mechanism to synchronize the transmitter and receiver
receiver samples stream at bit intervals if clocks not aligned and drifting it will sample at wrong time after sufficient bits are sent

two solutions to synchronization problem


asynchronous transmission synchronous transmission

Asynchronous
Data transmitted on character at a time
5 to 8 bits

Timing only needs to be maintained within each character Resynchronize with each character

Asynchronous Transmission

Asynchronous - Behavior
Example: Timing error
R=10kbps (T=100 micro) Rx is fast by 6% The 8th bit in error If bit 7 is 1 and bit 8 is 0, bit 8 is start bit error

framing

Asynchronous - Behavior
In a steady stream, interval between characters is uniform (length of stop element) In idle state, receiver looks for transition 1 to 0 Then samples next seven intervals (char length) Then looks for next 1 to 0 for next char Simple Cheap Overhead of 2 or 3 bits per char (~20%) Good for data with large gaps (keyboard)
7

Synchronous - Bit Level


Block of data transmitted without start and stop bits Clocks in TX and RX must be synchronized Can use either separate clock line
Good over short distances Subject to impairments

or embed clock signal in data by proper encoding method


Manchester/differential manch. encoding (digital) Carrier frequency (analog)
8

Synchronous - Block Level


Need to indicate start and end of block Use preamble and postamble bit pattern. Data block+preample+postamble+control data=frame. More efficient (lower overhead) than async.

Synchronous frame format

10

Types of Error
An error occurs when a bit is altered between transmission and reception Single bit errors
One bit altered Adjacent bits not affected White noise

Burst errors
Length B Contiguous sequence of B bits in which first and last bits and any number of intermediate bits are in error. Impulse noise Fading in wireless Effect greater at higher data rates.
11

Error Detection
Always there will be errors Detect errors using error-detecting code added by transmitter error-detecting code Recalculated and checked by receiver still chance of undetected error despite using error-detecting code. parity
parity bit set so character has even (even parity) or odd (odd parity) number of ones even number of bit errors goes undetected
12

Error Detection Process

13

Error detection Horizontal and Vertical parity


A variation of parity scheme Parity bits are added in both dimensions
Horizontal Vertical

14

Cyclic Redundancy Check (CRC)


For a block of k bits (D ) transmitter generates (n-k) bit sequence (R: frame check seq. FCS) Transmit n bits (T ) which is exactly divisible by some number P of length (n-k+1). i.e

2n  k D !Q  R p
T ! 2n  k D  R
Receive divides the received frame T r by P If no remainder, assume no error. i.e
E ! T T r or equivalently Tr !T E
15

Error Correction
correction of detected errors usually requires data block to be retransmitted not appropriate for wireless applications
bit error rate is high causing lots of retransmissions when propagation delay long (satellite) compared with frame transmission time, resulting in retransmission of frame in error plus many subsequent frames

instead need to correct errors on basis of bits received error correction provides this

16

CRC Polynomial representation


Number the bits 0, 1, ...,n from right, consider these as coefficients of a polynomial P(x)

Example

17

Error detection CRC generation

T (x ) ! x  x  x  x P (x ) ! 1  x R (x ) ! 1  x
3

18

Error detection How CRCs detect errors?


When there are errors, T (x )  E (x ) is received Each 1 bit in E ( x ) is an inverted bit When the receiver calculates the remainder R[(T(x) + E(x) )/p(x)] because R[T(x )/p(x)] = 0, the result is R[E(x) /p(x)] Thus if p(x) divides E(x) then errors go undetected! Consider a 1-bit error, E (x ) ! x j

i is the bit in error


If p(x) contains more than two terms it never divides E(x) Thus CRC with p(x) that has more than two terms will catch all 1 bit errors

19

Error detection How CRCs detect errors?


Let s consider two isolated single bit errors E (x ) ! x i  x j where i " j
E ( x ) ! x j ( x i - j  1)

If p (x ) does not divide x k +1 up to max frame length, CRCs will catch all double errors For example: p (x ) ! x 15  x 14  1 will not divide xk+1 up to k=32,768, thus CRCs based on this polynomial can detect all double errors for frames up to 32,768 bits long

20

Error detection Feature of CRCs


CRCs used in standards
CRC-12 CRC-16 CRC-CCITT
p (x ) p (x ) p (x )

= = =

x 12  x 11  x 3  x 2  x  1
16

x x

16

x x

15

12

x x

1 1

The last two (16 bits CRCs) will detect


all single and double errors all errors with odd number of bits all burst errors of length 16 bits or less 99.997% of all 17 bit errors 99.998% of all 18-bit or longer bursts

21

Error detection Use of CRC codes


CRC codes are the most common error detection scheme used in data transmission Less overhead yet more robust than parity and check sum Detection capabilities depends on p(x) selection

22

Error control Hamming Codes


Code word
consists of m message bits + r redundant or checkbits Code word length: n = r + m

Hamming distance
The number of bit positions at which two codewords differ Can be obtained by XOR ing two codewords Example: 0110000 and 0010111 (4)

Why Hamming distance is important?


If two codewords s Hamming distance is d, it takes d single bit errors to convert one to another Look differently, if received code word and transmitted code has Hamming distance of d, d single bit-errors have occurred

23

Error correcting codes Hamming Codes


To detect d single-bit errors
we need hamming code C of a minimum Hamming distance d+1 because there is no way d single bit errors can change one valid codeword into another valid code word

To correct d single-bit errors


we need a Hamming distance 2d+1 because valid codewords are so far apart so that with even d single single-bit changes, the original codeword and the modified codeword are still closest

24

Error control Error correcting codes


Contain enough information to self-corrected transmission errors
For example, H & V parity check can correct one single bit error

Codewords with Hamming distance 2d+1 can correct d single-bit errors bit errors Not used much in data transmission due to rather large overhead
Used only when transmission costs are expensive

Used in computer memory

25

Error control Error correcting example


Example: Code words
0000000000 1111100000 0000011111 1111111111 What is Hamming distance of this code? How many bit errors this code can correct? If we receive 0000000111, what is the correct code?

26

Line Configuration
Topology
Physical arrangement of stations on transmission medium Point to point Multi point
Computer and terminals, local area network

Half duplex
Only one station may transmit at a time Requires one data path

Full duplex
Simultaneous transmission and reception between two stations Requires two data paths (or echo canceling)

27

Traditional Configurations

28

Interfacing
Data processing devices (or data terminal equipment, DTE) do not (usually) include data transmission facilities Need an interface called data circuit terminating equipment (DCE)
e.g. modem, NIC

DCE transmits bits on medium DCE communicates data and control info with DTE
Done over interchange circuits Clear interface standards required
29

Data Communications Interfacing

30

Characteristics of Interface
Mechanical
Connection plugs

Electrical
Voltage, timing, encoding

Functional
Data, control, timing, grounding

Procedural
Sequence of events

31

V.24/EIA-232-F
ITU-T v.24 Only specifies functional and procedural
References other standards for electrical and mechanical

EIA-232-F (USA)
RS-232 Mechanical ISO 2110 Electrical v.28 Functional v.24 Procedural v.24
32

Mechanical Specification

33

Electrical Specification
Digital signals Values interpreted as data or control, depending on circuit More than -3v is binary 1, more than +3v is binary 0 (NRZ-L) Signal rate < 20kbps Distance <15m For control, more than-3v is off, +3v is on

34

Functional Specification
Circuits grouped in categories
Data Control Timing Ground

One circuit in each direction


Full duplex

Two secondary data circuits


Allow halt or flow control in half duplex operation

(See table in Stallings chapter 6)


35

Local and Remote Loopback

36

Procedural Specification
E.g. Asynchronous private line modem When turned on and ready, modem (DCE) asserts DCE ready When DTE ready to send data, it asserts Request to Send
Also inhibits receive mode in half duplex

Modem responds when ready by asserting Clear to send DTE sends data When data arrives, local modem asserts Receive Line Signal Detector and delivers data

37

Dial Up Operation (1)

38

Dial Up Operation (2)

39

Dial Up Operation (3)

40

Null Modem

41

ISDN Physical Interface Diagram

42

ISDN Physical Interface


Connection between terminal equipment (c.f. DTE) and network terminating equipment (c.f. DCE) ISO 8877 Cables terminate in matching connectors with 8 contacts Transmit/receive carry both data and control

43

ISDN Electrical Specification


Balanced transmission
Carried on two lines, e.g. twisted pair Signals as currents down one conductor and up the other Differential signaling Value depends on direction of voltage Tolerates more noise and generates less (Unbalanced, e.g. RS-232 uses single signal line and ground) Data encoding depends on data rate Basic rate 192kbps uses pseudoternary Primary rate uses alternative mark inversion (AMI) and B8ZS or HDB3

44

You might also like