Suggested presentation topics
Below is a suggested list of topics. Each student in the class should
choose a topic on which to give a presentation summarizing one or more
research papers. The topic does not have to come from this list.
All presentation topics, including those on this list need to be approved
by me, so that there are no repeats. You should not choose a topic
that you are working on for your research or which you have previously
studied.
The presentation time should be approximately 20 minutes.
Presentations will be on April 21, 23, and during the final exam time,
10 AM-12 PM on May 1st.
- LDPC codes/decoding
- Factor graphs/Tanner graphs
- Reed-Muller codes and their soft-decision decoding
- Product codes and iterative decoding
- Laminated turbo codes
- Hybrid ARQ
- Block error performance of iterative decoding (Costello)
- Nonsystematic turbo codes (Costello)
- Tail-biting convolutional codes
- Calculating the weight-enumerating function for a convolutional
code using signal flow graphs (in the book) and processing using
MATLAB (see M. C. M. Teixeira, H. F. Marchesi, and E. Assuncao,
"Signal-flow graphs: direct method of reduction and MATLAB
impelemtation," IEEE Trans. Education, vol. 44, no. 2,
pp. 185--190, May 2001.)
- Woven codes
- Bit-interleaved coded modulation
- Distributed (Slepian-Wolf/Wyner-Ziv) source coding using turbo codes
- Video source coding (Wyner-Ziv) using turbo codes
- Cooperative communication schemes based on error-control codes