Scribd
Upload
182 views13 pages

2 Data Recording and Transmission Encoding Data

1. Data encoding converts character codes into binary for storage or transmission and requires balancing storage needs with error detection. 2. Common encoding schemes include NRZ, NRZI, Manchester, and frequency modulation, with tradeoffs between efficiency and synchronization. 3. Run-length limited encoding like RLL(2,7) limits the number of consecutive zeros to prevent loss of synchronization and allows for higher storage density.

Uploaded by

'Joenabie Maxey Gamao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
182 views13 pages

2 Data Recording and Transmission Encoding Data

1. Data encoding converts character codes into binary for storage or transmission and requires balancing storage needs with error detection. 2. Common encoding schemes include NRZ, NRZI, Manchester, and frequency modulation, with tradeoffs between efficiency and synchronization. 3. Run-length limited encoding like RLL(2,7) limits the number of consecutive zeros to prevent loss of synchronization and allows for higher storage density.

Uploaded by

'Joenabie Maxey Gamao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Data Recording and Transmission

Encoding Data
Source:
Null and Lobur (2006). The Essentials of Computer
Organization and Architecture

Encoded data and data encoding


flux reversals used in magnetic storage devices
data transmission vs. data recording
data encoding: conversion of a character code for
storage or transmission
encoded data: character code encoded for storage
or transmission
requires balancing act between storage
requirements and error detection and correction

NON-RETURN-TO-ZERO CODE (NRZ)


each bit occupies a bit cell
an arbitrary slice of time in a transmission medium
arbitrary speck of space on a disk

requires precise synchronization between sender


and receiver

NON-RETURN-TO-ZERO INVERT CODE


(NRZI)
each bit occupies a bit cell
an arbitrary slice of time in a transmission medium
arbitrary speck of space on a disk

transition high-to-low or low-to-high for binary


one; no transition for binary 0
possibility of drift between sender and receiver for
long strings of zeros.
possible solution insert transitions

PHASE MODULATION
(MANCHESTER CODE)
binary one = up transition
binary zero = down transition
when necessary, extra transitions are put at bit
boundaries
inefficient for data storage, but used for data
transmission. Why?

FREQUENCY MODULATION
synchronizing transition at the beginning of each
bit cell.
extra transition within the bit cell for binary one.

MODIFIED FREQUENCY MODULATION


synchronizing transition ONLY at the beginning of
each bit cell between CONSECUTIVE zeros.
transition within the bit cell for binary one.
at least one transition for each pair of bit cells.
used for rigid disk storage for many years

RUN-LENGTH-LIMITED CODE
a block character code where ASCII and EBCDIC are
translated into code words with a designed limit for the
number of consecutive zeros, i.e. RLL(d,k) code allows a
minimum of d and a maximum of k consecutive zeros to
appear between any pair of consecutive ones. d is the run
length and k is the run limit.
RLL contains more bits than the original characters. however:
RLL is coded using NRZI on the disk resulting in less space required
on a disk
uses code words designed to avoid loss of synchronization in pure
NRZI coding

RUN-LENGTH-LIMITED CODE
a form of Huffman coding, but based on the fewest
number of flux reversals
RLL(2,7): a 16-bit mapping of 8-bit ASCII or EBCDIC
based on the assumption that presence or
absence of binary one in a bit cell is equiprobable.
in RLL(2,7) it is
impossible to have more than seven consecutive zeros
at least two 0s will appear in any combination of bits

RLL(2,7) Coding
character bit pattern

RLL(2,7) code

10

0100

11

1000

000

000100

010

100100

011

001000

0010

00100100

0011

00001000

Derivation of RLL(2,7)

A Comparison of the Performance of


FM, MFM, and RLL(2,7)

PARTIAL RESPONSE MAXIMUM LIKELIHOOD


CODING
addresses the issue of superpositioning
uses a detector circuit (Viterbi detector) to match
the waveform to a set of possible responses thus
encoding scheme is called partial response
maximum likelihood
more frequent sampling means greater data
density

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy