Euclidean and Hamming distances

Key focus: Euclidean & Hamming distances are used to measure similarity or dissimilarity between two sequences. Used in Soft & Hard decision decoding. Distance is a measure that indicates either similarity or dissimilarity between two words. Given a pair of words a=(a0,a1, … ,an-1) and b=(b0,b1,…,bn-1) , there are variety of ways one can characterize … Read more

Maximum likelihood decoding — BSC Hamming metric and AWGN Euclidean metric

Detection path: ML estimation → ML decoding → Hard vs soft decision → Hamming codes In one sentence: Maximum-likelihood decoding picks the codeword that maximizes the channel likelihood of the received word — on a BSC that reduces to nearest Hamming neighbor when the crossover probability is below one half.  Introduction Maximum likelihood decoding … Read more