< Return to Video

9.1 - Digital communication systems

  • 0:01 - 0:04
    Hi, and welcome to module nine of digital
    signal processing.
  • 0:04 - 0:07
    This is the last module in our class, and
    this is really where it all comes
  • 0:07 - 0:10
    together.
    In this module we will review the
  • 0:10 - 0:14
    principles behind the success of digital
    communication systems.
  • 0:14 - 0:18
    And we will look at different
    communication systems starting from the
  • 0:18 - 0:21
    voice band modems that were popular a few
    years ago and that you can still hear
  • 0:21 - 0:25
    when you use a fax machine, to the most
    recent incarnations like the ADSL box
  • 0:25 - 0:28
    that you have in your home and that
    you're probably using to watch this
  • 0:28 - 0:35
    video.
    Digital communication systems need no
  • 0:35 - 0:38
    introduction.
    The amount of information that we consume
  • 0:38 - 0:43
    and that we produce every day is
    staggering by an historical standard.
  • 0:43 - 0:45
    And what is even more amazing is that we
    can access this wealth of information
  • 0:45 - 0:49
    from basically anyway via a small device,
    like the smartphoen that you have in your
  • 0:49 - 0:53
    pocket.
    There is actually a joke about that and
  • 0:53 - 0:56
    suppose that someone from the
    Renaissance, like Leonardo, was
  • 0:56 - 1:00
    teleported to today.
    And you'd have to explain to them what
  • 1:00 - 1:03
    your smartphone does.
    Well you have to say this is a small
  • 1:03 - 1:06
    device that allows me to access
    everything that has been done, written
  • 1:06 - 1:11
    about, or were said by mankind since the
    beginning of history.
  • 1:11 - 1:14
    And I use it mainly to look at pictures
    of cats.
  • 1:14 - 1:17
    But jokes aside the truth remains that
    communications systems, digital
  • 1:17 - 1:20
    communications systems.
    Are really the pinnacle achievment of
  • 1:20 - 1:24
    digital signal processing.
    So in this module we'll start from the
  • 1:24 - 1:28
    basic principles in module nine one and
    we'll see the kind of signals that we
  • 1:28 - 1:35
    have to design in order to be able to
    transmit them over a physical channel.
  • 1:35 - 1:39
    Now a physical channel whether it's a
    wireless channel, whether it's a piece of
  • 1:39 - 1:43
    wire or an optical fiber will always
    impose two fundamental constraints on the
  • 1:43 - 1:47
    kind of signal that can transit over the
    channel.
  • 1:47 - 1:50
    The first one is a bandwidth constraint,
    which means that we will only have a
  • 1:50 - 1:55
    certain range of frequencies over which
    we can send information.
  • 1:55 - 1:58
    And the second constraint is a power
    constraint.
  • 1:58 - 2:02
    It limits the amount of power that we can
    inject onto the channel.
  • 2:02 - 2:06
    So in module 9.2, we will tackle the
    banther constraint, in detail.
  • 2:06 - 2:09
    And in module 9.3, we will look at the
    power constraint.
  • 2:09 - 2:12
    And we will see in the end how these two
    constraints limit the maximum amount of
  • 2:12 - 2:16
    information that we can send over a
    channel.
  • 2:16 - 2:20
    In Module 9.4, we will look at the
    modulation and demodulation techniques
  • 2:20 - 2:25
    that are specially designed to transmit
    data over the telephone channel.
  • 2:25 - 2:28
    And in Module 9.5, we will examine the
    several signal processes and tricks that
  • 2:28 - 2:31
    are put in place to implement a receiver,
    which turns out to be much more
  • 2:31 - 2:36
    complicated than the transmitter, because
    the receiver has to undo all the nasty
  • 2:36 - 2:41
    things that happen to the signal.
    When it travels over the channel,
  • 2:41 - 2:45
    including distortion and noise and so on.
    As a matter of fact, module 9.5 is like a
  • 2:45 - 2:48
    teaser that will probably whet your
    appetite for more advanced signal
  • 2:48 - 2:55
    processing techniques that you will be
    able to study in more advanced classes.
  • 2:55 - 2:59
    And finally in module 9.6, we will study
    the ADSL protocol.
  • 2:59 - 3:03
    Now it turns out that ADSL is just one
    big DFT.
  • 3:03 - 3:07
    And so, the fact that we can implement it
    efficiently with the FFT algorithm, is
  • 3:07 - 3:10
    really the reason behind the
    extraordinary commercial success, of the
  • 3:10 - 3:15
    ADSL setup box.
    You will see that everything that we've
  • 3:15 - 3:18
    studied so far really find it's place in
    the design of a sophisticated digital
  • 3:18 - 3:22
    processing system.
    So we hope you have enjoyed this initial
  • 3:22 - 3:27
    ride into the world of digital signal
    processing and hopefully we'll see each
  • 3:27 - 3:33
    other again in more advanced classes in
    the future.
  • 3:33 - 3:37
    Thank you.
    Hi and welcome to module 9.1 of Digital
  • 3:37 - 3:40
    Signal Processing.
    In this module we will start to look at
  • 3:40 - 3:44
    digital communication systems.
    In particular, we will look at the many
  • 3:44 - 3:50
    incarnations that a signal will undergo
    from its source to its destination.
  • 3:50 - 3:52
    This incarnations will travel through a
    variety.
  • 3:52 - 3:55
    of different analog channel.
    And each channel will have a different
  • 3:55 - 3:59
    set of constraints that the signal will
    have to submit itself to.
  • 3:59 - 4:02
    And in this module we'll start to look
    how to design signals that fulfill the
  • 4:02 - 4:06
    channel constraints.
    If you remember in the beginning of this
  • 4:06 - 4:09
    class we gave you a little overview of
    the major improvements and through put
  • 4:09 - 4:13
    for channels that we implicitly use every
    day.
  • 4:13 - 4:17
    For instance, the transatlantic cables
    that allow telephoning from Europe to the
  • 4:17 - 4:22
    Unites States have seen an improvement
    That went from five bits per second in
  • 4:22 - 4:29
    1866 with the first cable to 60 terabytes
    per second last year.
  • 4:29 - 4:32
    Similarly something you use every day at
    home, your modem that allows you to
  • 4:32 - 4:37
    connect to the internet, has increased
    its data rate from 1,200 bits per second
  • 4:37 - 4:44
    in the 50s to 24 megabits per second with
    the current incarnation of ADSL.
  • 4:44 - 4:47
    Now what are the reasons behind this
    incredible success?
  • 4:47 - 4:51
    Well, the first one clearly is the power
    of the DSP paradigm.
  • 4:51 - 4:55
    The fact that DSP works with integers
    means that, for instance signals are very
  • 4:55 - 4:58
    easy to regenerate.
    We have seen an example in the
  • 4:58 - 5:01
    introduction, and we will see it again in
    a second.
  • 5:01 - 5:04
    Also digital filters allow us to
    implement very precise phase control, and
  • 5:04 - 5:10
    we will see how important phase is in the
    detection of a transmitted signal.
  • 5:10 - 5:16
    And finally, we can seamlessly integrate
    adaptive algorithms into a DSP system.
  • 5:16 - 5:22
    Adaptive algorithms are algorithmic
    procedures that adapt their behavior.
  • 5:22 - 5:25
    As a function of the received signal.
    These are very hard things to do in
  • 5:25 - 5:29
    analog hardware, but very easy to do in
    digital hardware.
  • 5:29 - 5:33
    As a reminder of what happens when we use
    digital signals for communication, think
  • 5:33 - 5:38
    of the problem of transmitting a string
    of binary digits over an analog channel.
  • 5:38 - 5:42
    To do that, we build a very simple
    signal, an analog signal, where we
  • 5:42 - 5:46
    associate the values plus 5 volts to the
    symbol 0.
  • 5:46 - 5:50
    And minus 5 volts to symbol one.
    Now the signal is analog, but it encodes
  • 5:50 - 5:55
    binary information, namely it encodes a
    string of integers.
  • 5:55 - 5:59
    When we transmit this over wire, two
    things happen.
  • 5:59 - 6:04
    The signal gets attenuated and noise gets
    added to the signal.
  • 6:04 - 6:08
    So what we'll receive at the other end of
    the channel is The original signal
  • 6:08 - 6:13
    attenuated by effect of G, summed to some
    random noise that corrupts the original
  • 6:13 - 6:17
    signal.
    Now, if we want to regenerate the signal,
  • 6:17 - 6:21
    the first thing we do is, undo the
    attenuation.
  • 6:21 - 6:26
    So we multiply the received signal by, a
    gain factor, that is the reciprocal of
  • 6:26 - 6:29
    the attenuation.
    So we multiply the signal by g, we obtain
  • 6:29 - 6:32
    a signal that has, once again the
    amplitude of the original signal but in
  • 6:32 - 6:38
    so doing we also amplified noise.
    And so, we have very unclean levels here,
  • 6:38 - 6:45
    which could cause all sorts of problems.
    But since we know that signal is bi level
  • 6:45 - 6:50
    all we need to do is threshold.
    This signal, and when we see that it's
  • 6:50 - 6:54
    positive, we set it plus 5.
    And when we see that it's negative, we
  • 6:54 - 6:57
    set it minus 5.
    This is easily accomplished in digital
  • 6:57 - 7:04
    domain by taking the sign of the signal
    before undoing the attenuation factor.
  • 7:04 - 7:06
    And this is the signal that we get at the
    other end of the transmission channel.
  • 7:07 - 7:12
    And we can repeat this procedure as many
    times as we need and that explains why we
  • 7:12 - 7:16
    can send so much information over very,
    very long cables that go all the way
  • 7:16 - 7:22
    under the ocean.
    The second success factor for digital
  • 7:22 - 7:28
    communications today comes from the
    algorithmic nature of DSP techniques.
  • 7:28 - 7:32
    We have seen an example in image coding,
    in JPEG, where signal processing
  • 7:32 - 7:36
    techniques such as the discreet cosign
    transform could be matched seamlessly to
  • 7:36 - 7:42
    information theory techniques that
    involve the compression of bit streams.
  • 7:42 - 7:46
    And this interplay between these two
    techniques from different domains.
  • 7:46 - 7:49
    Creates such powerful compression
    algorithms.
  • 7:49 - 7:53
    Other everyday examples can be found in
    CDs or DVDs.
  • 7:53 - 7:57
    Where you have encoding of acoustic or
    video information matched to powerful
  • 7:57 - 8:02
    error correcting codes.
    So that DVDs or CDs that are scratched or
  • 8:02 - 8:06
    dusty still play.
    And in communications systems.
  • 8:06 - 8:10
    Techniques such as trellis coded
    modulation and Viterbi decoding are used
  • 8:10 - 8:13
    to exploit all the capacity of an analog
    communication channel.
  • 8:13 - 8:17
    The third success factor for digital
    communications is related to hardware
  • 8:17 - 8:20
    advancements.
    We can have today miniaturized devices
  • 8:20 - 8:24
    that we can keep in our pocket, we can
    have general purpose platforms used to
  • 8:24 - 8:28
    develop advanced communication systems,
    so we don't need to develop specific
  • 8:28 - 8:35
    hardware for each different task.
    And communication devices have become
  • 8:35 - 8:39
    very power efficient, so that we can have
    Large data centers, or central offices
  • 8:39 - 8:45
    that process an enormous number of
    communication channels in peril.
  • 8:45 - 8:49
    So let's have a look at what happens when
    you place a call from your mobile phone
  • 8:49 - 8:55
    to someone that has their phone at home.
    The information is first sent over the
  • 8:55 - 8:59
    air to the closest base station where it
    is now converted to a different format
  • 8:59 - 9:05
    and sent over copper wires to a switch.
    The switch is designed to find the
  • 9:05 - 9:10
    routing pattern that will send the
    information to the final destination.
  • 9:10 - 9:14
    The switch will send information over
    what is going to most likely an optic
  • 9:14 - 9:18
    fiber channel to the global telephone
    network.
  • 9:18 - 9:21
    The telephone network will route your
    information to the central office that is
  • 9:21 - 9:25
    closest to the person you'll calling.
    The central office will then send the
  • 9:25 - 9:29
    same information in yet a different
    format over a coax cable to the switch
  • 9:29 - 9:33
    that is closest to the telephone that is
    being called and finally from the closest
  • 9:33 - 9:39
    switch to the phone in the house.
    There is what is called the last smile
  • 9:39 - 9:46
    which is a longish piece of copper wire.
    So, you see at every change of channel
  • 9:46 - 9:51
    many many things can happen.
    The signal can be converted to digital
  • 9:51 - 9:55
    again and then back to analog.
    The modulation schemes and the signal
  • 9:55 - 9:58
    formats that we will have to use on this
    different stretches of the channel will
  • 9:58 - 10:03
    have to adopt to the physical
    characteristics of the medium.
  • 10:03 - 10:07
    Every analog channel.
    Has two unescapable limits that we have
  • 10:07 - 10:11
    to reckon with.
    The first is a bandwith constraint.
  • 10:11 - 10:14
    The signals that we can send over an
    analog channel will have to be limited to
  • 10:14 - 10:19
    a certain frequency band, and the second
    limit is the fact that we cannot use
  • 10:19 - 10:24
    arbitrary power over that band.
    There will be limits on the power of the
  • 10:24 - 10:28
    signal we can send.
    The maximum amount of informatin we will
  • 10:28 - 10:32
    be able to send with the channel given
    this contraints is called a capicity of
  • 10:32 - 10:36
    the channel.
    We will see a remarkable result of
  • 10:36 - 10:39
    information theory later on that exactly
    quantifies the capcity of the channel
  • 10:39 - 10:42
    given it's signal to noise ratio and it's
    bandwidth.
  • 10:42 - 10:46
    As communication system engineers we are
    given the specifications of a chennel.
  • 10:46 - 10:51
    And we want to design a system that sends
    as much information over this channel.
  • 10:51 - 10:56
    And as reliably as possible give this
    unescapeable capacity constraint.
  • 10:56 - 11:01
    Amount of information and reliability are
    concepts that are still a little fuzzy
  • 11:01 - 11:05
    for the time being.
    They will become clearer later on but we
  • 11:05 - 11:09
    can certainly look at the intuition
    behind this problem.
  • 11:09 - 11:12
    For instance, if we look at the
    relationship between bandwidth and
  • 11:12 - 11:15
    capacity, we can do this very simple
    thought experiment.
  • 11:15 - 11:19
    Suppose we are going to transmit
    information encoded as a sequence of
  • 11:19 - 11:23
    digital samples over a continuous time
    channel.
  • 11:23 - 11:28
    So, what we do we take the samples we
    interpolate the samples with a certain
  • 11:28 - 11:32
    sampling period Ts now if we make Ts very
    small it means that we can send more
  • 11:32 - 11:37
    samples per second.
    But if we make Ts small we know that the
  • 11:37 - 11:41
    bandwidth will grow as the reciprocal of
    Ts you remember the formula for
  • 11:41 - 11:47
    interpolate signal.
    In the sampling theorem, it says that the
  • 11:47 - 11:54
    analog spectrum will be zero outside of a
    band that goes from omega n to minus
  • 11:54 - 11:59
    omega n.
    And omega n is Pi over Ts.
  • 11:59 - 12:03
    If we make ts small the bandwidth will
    grow with 1 over Ts.
  • 12:04 - 12:08
    So we see, that capacity, and the amount
    of information that we can send per
  • 12:08 - 12:14
    second, are related in some way.
    Similarly, the relationship between the
  • 12:14 - 12:19
    power constraint and capacity, can be
    appreciated, because we can never do away
  • 12:19 - 12:22
    with noise.
    So, at the receiver, when we send the
  • 12:22 - 12:26
    sequence of integers for instance, we
    will have to guess What has been set
  • 12:26 - 12:32
    after it has been corrupted by noise.
    So suppose we have a channel that
  • 12:32 - 12:36
    introduces a noise variance of 1 and
    suppose we are transmitting the integer
  • 12:36 - 12:40
    between 1 and 10.
    If the variance is 1 lots of transmitted
  • 12:40 - 12:45
    integers will have and error that will
    send them very close to the next integer
  • 12:45 - 12:48
    in line.
    So suppose I'm sending the integers
  • 12:48 - 12:54
    between 1 and 10.
    And so I'm sending say one but because of
  • 12:54 - 12:58
    the noise the one will be 1.75 for
    instance.
  • 12:58 - 13:02
    So I'm not really sure if what was sent
    was one or was two.
  • 13:02 - 13:06
    And then the strategies say okay.
    Let's transmit only odd numbers.
  • 13:06 - 13:10
    So instead of everything I will not just
    be at 0, we'll transmit 1 and then I will
  • 13:10 - 13:15
    not transmit 2 but I will transmit 3.
    So I'm increasing the gap between
  • 13:15 - 13:20
    possible symbols and so the noise that
    before Had probably me misguessing the
  • 13:20 - 13:24
    transmission of 1, will still be small
    enough to bring me back to the original
  • 13:24 - 13:29
    signal.
    Now it is rather intuitive that, all
  • 13:29 - 13:33
    other things being equal.
    A signal with a wider range will have a
  • 13:33 - 13:37
    larger power.
    So, if I want to keep the power constant,
  • 13:37 - 13:40
    I will still have to send symbols between
    zero and 10, but now there are only half
  • 13:40 - 13:44
    as many odd integers between zero and 10
    that there are integers, and so the
  • 13:44 - 13:49
    amount of information that I can send per
    unit of time.
  • 13:49 - 13:52
    will be halved.
    Let's now look at some common
  • 13:52 - 13:58
    communication channels and see what their
    power and bandwidth constraints are.
  • 13:58 - 14:02
    Maybe the simplest communication channel
    that we're still familiar with, is the AM
  • 14:02 - 14:06
    radio channel.
    AM stands for amplitude modulation, and
  • 14:06 - 14:08
    indeed the radio transmitter is very
    simple.
  • 14:08 - 14:12
    We take an analog signal, it can be voice
    or music, we do a low-pass filtering
  • 14:12 - 14:16
    operation to limit its bandwidth, And
    then we do a very, very simple sinusoidal
  • 14:16 - 14:20
    modulation with the cosine of a given
    carrier.
  • 14:20 - 14:23
    The result in modulated signal, is simply
    put to an antenna, and it will be
  • 14:23 - 14:28
    propogated in the radial spectrum.
    The radial spectrum is a very scarce
  • 14:28 - 14:30
    resource.
    There's only one radial spectrum,
  • 14:30 - 14:33
    everybody has to share it.
    Therefore, every frequency band in the
  • 14:33 - 14:39
    spectrum, is strictly regulated by law.
    In the case of AM, the band is from 530
  • 14:39 - 14:44
    kilohertz to 1.7 megahertz.
    This is divided into 8 kilohertz wide
  • 14:44 - 14:48
    channels.
    And each radio station gets allocated a
  • 14:48 - 14:51
    specific channel.
    The power is limited by law for a variety
  • 14:51 - 14:54
    of reasons.
    The first is that the propagation
  • 14:54 - 14:59
    patterns for AM waves is very different
    during the day, and during the night.
  • 14:59 - 15:02
    In particular at night time, AM radio
    waves travel much further than during the
  • 15:02 - 15:05
    day.
    So, they can create all source of
  • 15:05 - 15:09
    interferences in distant places if the
    power is not limited.
  • 15:09 - 15:12
    Also you don't want radio stations to use
    too much power because it wouldn't be
  • 15:12 - 15:15
    healthy for people live in the vicinity
    of the transmitter and on the channel
  • 15:15 - 15:19
    where all are familiar with is the
    telephone channel.
  • 15:19 - 15:22
    The telephone network is more properly
    called the switched telephone network
  • 15:22 - 15:25
    because instead of taking the
    combinatorial approach and having each
  • 15:25 - 15:29
    phone connected to every other phone in
    the world.
  • 15:29 - 15:31
    What happens is that when you call on
    other phone.
  • 15:31 - 15:35
    Your phone is connected to the central
    office, and the central office determines
  • 15:35 - 15:38
    which parts of the network have to be
    connected together so that your call can
  • 15:38 - 15:44
    be routed to the destination phone.
    So, the piece of wire that connects you
  • 15:44 - 15:48
    to the central office is up to, maybe
    say, a couple of kilometers long, and is
  • 15:48 - 15:53
    called the last mile.
    The central office today is a bunch of
  • 15:53 - 15:57
    digital switches, in the old days was
    mechanical rotary switches The network
  • 15:57 - 16:01
    can be anything from optical fiber to
    satellite links to anything else in
  • 16:01 - 16:08
    between, and here you have the symmetric
    part where you get to your destination.
  • 16:08 - 16:14
    The telephone channel is conventionally
    limited from 300 hertz to 3,000 hertz.
  • 16:14 - 16:18
    These are historical limits that depend
    on the kind of hardware that was used In
  • 16:18 - 16:22
    the old days in central office and in the
    network.
  • 16:22 - 16:26
    Today these limits are historical
    artifact but they are kept because anyway
  • 16:26 - 16:31
    voice communications are perfectly
    intelligible within this band And with
  • 16:31 - 16:37
    the reduced band, you can multiplex.
    Namely, you can put together very many
  • 16:37 - 16:41
    communications on a wider channel.
    The power that you can send on a
  • 16:41 - 16:47
    telephone wire is limited from 0.2 to 0.7
    volts, or root mean square.
  • 16:47 - 16:51
    And this a strictly enforced limit to
    make sure that you don't send signals
  • 16:51 - 16:54
    that can burn the equipment at the
    central office.
  • 16:54 - 16:58
    And the signal to noise ratio is rather
    good because the analog part of the
  • 16:58 - 17:01
    telephone network operates in the bass
    band and there's not a lot of
  • 17:01 - 17:06
    interference in the low frequencies.
    So let's how we're going to go about
  • 17:06 - 17:10
    designing a communications system.
    Probably the most important concept here,
  • 17:10 - 17:14
    is that we're going to adopt the
    all-digital paradigm.
  • 17:14 - 17:17
    What this means is that, we will keep
    everything in the digital domain until we
  • 17:17 - 17:21
    hit the physical channel.
    And if we were to describe this as a
  • 17:21 - 17:26
    block diagram, it would look like this.
    We have a binary bit stream, can
  • 17:26 - 17:31
    represent any sort of views or data.
    We have a transmitter that operates
  • 17:31 - 17:37
    entirely in digital domain that generates
    a discreet time signal s of n.
  • 17:37 - 17:39
    The last element in the transmission
    chain.
  • 17:39 - 17:43
    Is a digital to analog converter
    operating at a given frequency, or at the
  • 17:43 - 17:46
    given period as you prefer, that
    transforms this signal into an analog
  • 17:46 - 17:53
    signal that we can send over the channel.
    So remember the channel constraints.
  • 17:53 - 17:55
    Look a little bit like a filter design
    problem.
  • 17:55 - 18:00
    We have a band width that is specified in
    terms of a maximum and minimum frequency.
  • 18:00 - 18:05
    So we can only operate over this band.
    And then we have a power constraint that
  • 18:05 - 18:09
    restricts the power associated with the
    signal that we produce.
  • 18:09 - 18:14
    So if you want to convert this to our old
    digital paradigm the first thing to do is
  • 18:14 - 18:17
    to convert the specs into discreet time
    specs.
  • 18:17 - 18:21
    So we choose a frequency for the D2A
    converted, fs, this will be our niquist
  • 18:21 - 18:27
    frequency, fs over 2, and with this we
    can convert the specs.
  • 18:27 - 18:31
    Maximum frequency will be pi, and our
    minimum and maximum frequency bands will
  • 18:31 - 18:34
    be omega min and omega max using the
    relation.
  • 18:34 - 18:42
    Omega equal to 2 pi f over fs.
    And you can put here, f min or f.
  • 18:42 - 18:46
    Now, here are some working hypotheses
    that are common to most transmission
  • 18:46 - 18:49
    systems you will ever see.
    We start from a bitstream.
  • 18:49 - 18:52
    And we will convert this bitstream into a
    sequence of symbols.
  • 18:52 - 18:56
    For samples a of n, via something called
    a mapper.
  • 18:56 - 19:02
    What the mapper does is associate group
    of bits to a specific symbol.
  • 19:02 - 19:06
    Just to give you a concrete example
    assume we're going to map each group of
  • 19:06 - 19:10
    bits to its decimal value.
    We want to model the sequence of symbols
  • 19:10 - 19:13
    as a white random sequence and in order
    to do so, we have to assume that the
  • 19:13 - 19:17
    bitstream is a completely random
    sequence.
  • 19:17 - 19:20
    Now, this is not necessarily the case,
    for instance, imagine you're digitizing
  • 19:20 - 19:23
    audio and you have long stretches of
    silence.
  • 19:23 - 19:26
    This will result into a long sequence of
    zeros.
  • 19:26 - 19:30
    And so, what we do is we put a scrambler
    in the line.
  • 19:30 - 19:33
    What a scrambler does.
    It transforms a sequence of bits into a
  • 19:33 - 19:37
    sequence that looks like a random
    sequence but this randomization is
  • 19:37 - 19:42
    completely invariable at a receiver.
    So, we start with the sequence of zeroes
  • 19:42 - 19:45
    for instance.
    We put into the scrambler, it's going to
  • 19:45 - 19:49
    look like a completely random sequence of
    zeroes and one but it's done
  • 19:49 - 19:51
    algorithmically so we can invert this
    randomization on the receiver and
  • 19:51 - 19:56
    retrieve the original bitstream..
    With this we can consider the sequence of
  • 19:56 - 20:00
    symbol a of n as a wide sequence.
    And now we need to convert the sequence
  • 20:00 - 20:04
    into a continuous time signal within the
    constraints.
  • 20:04 - 20:07
    So here's the updated transmission
    scheme.
  • 20:07 - 20:12
    User data goes into a scrambler.
    This is a random binary sequence.
  • 20:12 - 20:15
    The mapper converts groups of bits to
    symbols.
  • 20:15 - 20:20
    And then we have to decide what to do in
    here before converting this into an
  • 20:20 - 20:23
    analog signal.
    The first problem is Fulfilling the
  • 20:23 - 20:27
    bandwidth constraint.
    If we assume that the data is randomized
  • 20:27 - 20:31
    and therefore the symbol sequence is a
    wide sequence, we know that the power
  • 20:31 - 20:36
    spectral density is simply equal to the
    variance and so the power of the signal
  • 20:36 - 20:39
    will be constant over the entire
    frequency band but we actually need to
  • 20:39 - 20:48
    fit it into the small band here as
    specified by the bandwidth constraint.
  • 20:48 - 20:52
    So, how do we do this.
    Well in order to do that we need to
  • 20:52 - 20:57
    introduce a new technique called up
    sampling and we will see this in the next
  • 20:57 - 20:59
    module.
Title:
9.1 - Digital communication systems
Description:

From the official description of 9.. videos:

Welcome to Week 8 of Digital Signal Processing.

This week's module is about digital communication systems and this is where it all comes together; from complex-valued signals, to spectral analysis, to stochastic processing, sampling and interpolation: everything plays a role in the design and implementation of a digital modem. Digital communications is an extremely vast and fascinating topic and it is arguably the pinnacle achievement of DSP in the sense that it's the domain where the most extraordinary quantitative progress has been made thanks to the digital paradigm. The fact that MOOCs such as this one are available to such an incredibly vast audience is just one of the tangible results of digital communication systems. It is only fitting, therefore, to devote the last module of our class to this subject.

We will start with the basics of data modulation and demodulation and we will progress to describing how your ADSL box works by way of its direct predecessor, the voiceband modem that spearheaded the Internet revolution by allowing for the first time the delivery of substantial data rates in the home.

more » « less

English subtitles

Incomplete

Revisions