Class Notes (904,768)
CA (538,304)
McMaster (42,915)
SFWRENG (70)
Lecture 4

SFWRENG 4J03 Lecture 4: Lecture 2016-02-02
Premium

5 Pages
89 Views

Department
Software Engineering
Course Code
SFWRENG 4J03
Professor
Rong Zheng

This preview shows pages 1 and half of page 2. Sign up to view the full 5 pages of the document.

Loved by over 2.2 million students

Over 90% improved by at least one letter grade.

Leah — University of Toronto

OneClass has been such a huge help in my studies at UofT especially since I am a transfer student. OneClass is the study buddy I never had before and definitely gives me the extra push to get from a B to an A!

Leah — University of Toronto
Saarim — University of Michigan

Balancing social life With academics can be difficult, that is why I'm so glad that OneClass is out there where I can find the top notes for all of my classes. Now I can be the all-star student I want to be.

Saarim — University of Michigan
Jenna — University of Wisconsin

As a college student living on a college budget, I love how easy it is to earn gift cards just by submitting my notes.

Jenna — University of Wisconsin
Anne — University of California

OneClass has allowed me to catch up with my most difficult course! #lifesaver

Anne — University of California
Description
Lecture 2016-02-02 Author: Kemal Ahmed Instructor: Dr. Gowri Krishnasamy Course: SFWR ENG 4J03 Math objects made using MathType. Table of Contents Huffman Coding ............................................................................................................................. 1 enciphering.................................................................................................................................. 1 Algorithm.................................................................................................................................... 2 e.g. 1) .......................................................................................................................................... 2 Pulse Code Modulation................................................................................................................... 3 Pulse Code Modulation............................................................................................................... 3 Regenerative repeater.............................................................................................................. 3 Pulse Width Modulation......................................................................................................... 4 Pulse Position Modulation...................................................................................................... 4 e.g. 2) ...................................................................................................................................... 4 RR Cont .................................................................................................................................. 4 Sampling..................................................................................................................................... 4 e.g. 4) ...................................................................................................................................... 5 Huffman Coding Encipher: encoding → transmission decipher:  decoding → receiving  Prefix Property: any code should be uniquely decipherable. Complete code-word should become property of the new code? No complete code word can be a prefix at another code word enciphering m 1 0 → m 1 m 2 0 1 → m 2 Page 1 of 5 m → 0 11 → m 3 3 Highest probably messages will be given least number of bits and vice versa Algorithm 1. Arrange the messages according to order of decreasing probability 2. Consider the last 2 messages in the ensemble. Assign a 0 & 1 to those 2 messages 3. Add the probabilities of the last 2 messages 4. Arrange the messages in the order of decreasing probability. Keep the newest calculated probabilities on top if tie. 5. Go to step 2 until you only have 2 messages 6. Calculate efficiency e.g. 1) Calculate a Huffman code for the following message ensemble with probabilities: 0.1, 0.3, 0.16, 0.14, 0.13, 0.17 Ensure total probability = 1 n 1 P k1 k  0.10.30.160.140.130.17 Messages Probability II III IV V M 1 0.3 0.3 0.3 0.4 0.6 ← 0 M 2 0.17 0.23 0.3 0.3 ← 0 0.4 ← 1 M 3 0.16 0.17 0.23 ← 0 0.3 ← 1 M 4 0.14 0.
More Less
Unlock Document


Only pages 1 and half of page 2 are available for preview. Some parts have been intentionally blurred.

Unlock Document
You're Reading a Preview

Unlock to view full version

Unlock Document

Log In


OR

Don't have an account?

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit