CSE News and Announcements

Aug 05, 2005
Channel Coding Theory    Bookmark and Share
Term: Fall 2005
Course No.: EECS 650
Credit Hours: 3
Instructor: Achilleas Anastasopoulos
Prerequisites: EECS 501 (EECS 554 recommended)

Course Description:
Following the successful introduction of the "modern coding theory" course in Fall 04 (as a seminar course EECS 598-4), and also the current state of the art in the field, the "channel coding theory" course (EECS 650) this Fall semester is completely redesigned. It will be a mixture of "classic" and "modern" coding theory.

Thus, the interested student will see the classic-algebraic viewpoint (including the study of linear BCH and RS codes), as well as the modern viewpoint (includes the study of the family of turbo-like and space-time codes).

Below is a more detailed description of the course material.

This is an advanced course on channel coding techniques.

In the first part of the course, we will study some basic results from information and coding theory in order to see what is the best one should expect from a good code..

The study of channel codes is initiated with a review of linear codes, with emphasis on their algebraic structure (this complements the viewpoint taken in EECS 554, where the focus was on practical implementation of encoders and decoders). Next, the theory of finite fields is presented in some detail, as this is the basic tool for the study of non-binary linear codes. These results will be utilized for the construction of cyclic codes, and their significant subclass, namely BCH codes and Reed-Solomon (RS)codes. This will conclude the study of ``classical coding theory''.

Classical coding theory (which was founded almost 50 years ago) studies codes from their algebraic viewpoint. It served communication theorists and practitioners well, but essentially failed to reach the goal set by information theory, i.e., to provide codes that come close to channel capacity. However, 10 years ago, channel coding theory was revolutionized by the invention of ``turbo codes'' and the re-invention of ``low-density parity-check codes''. This revolution led to the birth of the new subfield of ``modern coding theory''.

In the second part of the course, we will study families of good codes, collectively referred to as turbo-like codes. Their asymptotic performance, and their encoding and decoding complexity will be studied. This investigation will conclude by asking the question of whether everything that Shannon predicted 50 years ago has been achieved.

The last part of the course deals with the multi-antenna wireless fading channel, which promises bandwidth efficiencies on the order of tens of bits per second per Hertz. Its capacity will be investigated and families of ``space-time codes'' will be introduced and analyzed.
EECS News by Topic
EECS News by Faculty Name
CSE in the News 
04/17/14 Scientific American: Heartbleed Software Snafu: The Good, the Bad and the Ugly
04/17/14 New York Times: Study Finds No Evidence of Heartbleed Attacks Before the Bug Was E...
04/15/14 Michigan Daily: Internet security flaw left University sites vulnerable
04/15/14 ARS Technica: Researchers find thousands of potential targets for Heartbleed OpenS...
04/15/14 Bloomberg: Hacker From China Wastes Little Time in Exploiting Heartbleed
04/15/14 Bloomberg: Heartbleed Hackers Steal Encryption Keys in Threat Test

CSE Research News 
04/17/14 Halderman and Lafortune Join TerraSwarm Research Center
04/07/14 Michael Lewis says the market is rigged. But his Flash Boys rigged themselves.
04/01/14 Researchers Win Best Paper Award at ISPASS 2014
04/01/14 Technological Singularity Passes, Unnoticed Until Now
03/05/14 Michael Wellman Recognized with ACM/SIGAI Autonomous Agents Research Award
02/21/14 New Center Develops Technologies to Help Youths with Disabilities

CSE News 
03/26/14 CSE Connects at SXSW 2014
03/24/14 Prospective Grad Students Visit, Learn About CSE
03/13/14 CSE Connects at Tapia Celebration of Diversity in Computing
02/03/14 Karem Sakallah Continues Commitment to Qatar Computing Research Institute
01/30/14 State Farm Gift Supports Student Projects Lab
01/23/14 Career Center Report Shows Computer Scientists Highly Sought, Best Compensated

CSE Faculty and Staff Awards 
04/03/14 Noble and Wilson Named as Learning Analytics Fellows
03/26/14 Kevin Fu Selected for World Economic Forum Young Scientist Award
02/25/14 Narayanasamy and Olson Named Morris Wellman Faculty Development Professors
02/07/14 Daniel Atkins Elected to National Academy of Engineering
01/24/14 2014 EECS Outstanding Achievement Awards
01/23/14 Four CSE Faculty Selected for College of Engineering Awards

CSE Student News and Awards 
04/18/14 Jill Bender Chosen for CoE Distinguished Leadership Award
04/16/14 SWE Hosts G.R.E.A.T. Day for Girls
04/11/14 Hands-On Robotics (video)
04/08/14 Forest Agostinelli Selected for NSF Graduate Research Fellowship
04/08/14 Branden Ghena Selected for NSF Graduate Research Fellowship
04/08/14 Elizabeth Mamantov Selected for NSF Graduate Research Fellowship

CSE Alumni News 
03/07/14 Alumni Spotlight-Dawson Yee: Kinect-ing Xbox to the World
03/03/14 CSE Alum Dongyoon Lee Selected for ProQuest Dissertation Award
12/20/13 Hector J. Garcia Selected for Bouchet Graduate Honor Society
11/12/13 CSE Alumna Mona Attariyan Selected for Ritchie Disseration Award
07/23/13 Tony Fadell: From Apple to Nest Labs, Always a Designer
06/26/13 Computer Engineering Alum Marius Eriksen Featured in Wired

CSE Course Announcements 
04/09/14 Fall 2014: Hands-On Robotics
04/03/14 Fall 2014: EECS 598-002 Power Semiconductor Devices
04/03/14 Fall 2014: EECS 598-001 Analysis of Electric Power Distribution Systems and Loads
03/20/14 Fall 2014: Applied matrix algorithms for signal processing, data analysis and mach...
11/26/13 Winter 2014: EECS 498-003 Multidisciplinary Capstone (MDE) Design Pilot
11/06/13 Winter 2014: EECS 598-007 Infrastructure for Vehicle Electrification

Add News Item     Update News Items