CONTENTS
Linear block
codes
-
Computing the weight distribution
-
Bounds on error performance over AWGN, flat
Rayleigh
fading and BSC channels
Hamming, Golay
and
Reed-Muller codes
-
Hamming codes
-
Binary Golay (23,12,7) code and extended
Golay (24,12,8)
code
-
First order RM codes
Binary
cyclic
codes and BCH codes
-
Error-trapping decoding of cyclic codes
-
Berlekamp-Massey, Euclidean and PGZ algorithms
-
Chien search and error correction
-
Errors-and-erasures decoding
-
Error performance evaluation
Reed-Solomon codes
-
Berlekamp-Massey, Euclidean and PGZ algorithms
-
Errors-and-erasures decoding
-
Error performance evaluation
Binary
convolutional
codes
-
Weight enumeration sequences and error
performance
evaluation
-
Viterbi algorithm with Hamming metrics
-
Viterbi algorithm with Euclidean metrics
-
Punctured convolutional codes
Soft-decision
decoding
-
Decoding binary linear block codes with a
trellis
-
Chase type-II algorithm
-
Ordered statistics decoding (OSD)
-
GMD decoding
Soft-input
soft-output
(SISO) algorithms
-
MAP and log-MAP
-
Max-log-MAP
-
SOVA
-
SO-OSD and SO-Chase
Iteratively
decodable
codes
-
Parallel concatenation (turbo codes)
-
Serial concatenation (product codes)
-
Block product codes
-
Low-density parity-check (LDPC) codes
-
Bit-flip hard-decision algorithm
-
Belief-propagation (sum-product) algorithm
Coded
modulation
-
Trellis coded modulation (TCM)
-
Pragmatic TCM
-
Multilevel coded modulation (MCM)
-
Bit-interleaved coded modulation (BICM)
-
Turbo TCM
INDEX BY FUNCTION
Basic performance analysis tools
-
Bounds and approximations on block and bit
error
rates
-
Program to compute the weight distribution of
short
codes
-
Data files with weight distrbutions of
extended BCH
codes of length up to 128
Hard-decision decoding algorithms
-
Syndrome and look-up table based
-
Berlekamp-Massey
-
Euclidean
-
Direct-solution (PGZ)
-
Viterbi decoder
-
Gallager's iterative bit-flip decoder
Soft-decision decoding algorithms
-
Viterbi decoder
-
Binary convolutional codes
-
Binary linear block codes
-
Chase type-II
-
Ordered-statistics
-
Generalized minimum distance
Soft-input soft-output decoding algorithms
-
Optimal MAP (BCJR)
-
Log-MAP (log-BCJR)
-
Max-log-MAP
-
Soft-output ordered-statistics
-
Soft-output Chase type-II
-
Iterative belief-propagation
Iterative decoding algorithms
-
Parallel concatenated or turbo
(partial-product)
codes
-
Serial concatenated (product) codes
-
Low-density parity-check (LDPC) codes
Coded modulation
-
TCM decoding
-
Pragmatic TCM decoding
-
Multistage decoding of MCM
-
Conventional schemes
-
Unequal error protection schemes
-
BICM decoding
-
Turbo TCM decoding
-
Symbol interleaving (Robertson)
Bit interleaving (Benedeto et al)
This page was last updated on July 16, 2006,
by
Robert H. Morelos-Zaragoza.