This thesis investigates decoding algorithms, rate adaptation, channel estimation, and higher-order modulation for polar codes. For decoding, a complexity-adaptive tree search algorithm called successive cancellation ordered search (SCOS) is proposed that implements maximum-likelihood (ML) decoding. For rate adaptation, a variable-length polar extension (VLPE) based on dynamic frozen bits is introduced as a hybrid automatic repeat request scheme. Finally, for block fading channels a channel estimation scheme is proposed that uses the code constraints imposed by the frozen bits.
«
This thesis investigates decoding algorithms, rate adaptation, channel estimation, and higher-order modulation for polar codes. For decoding, a complexity-adaptive tree search algorithm called successive cancellation ordered search (SCOS) is proposed that implements maximum-likelihood (ML) decoding. For rate adaptation, a variable-length polar extension (VLPE) based on dynamic frozen bits is introduced as a hybrid automatic repeat request scheme. Finally, for block fading channels a channel esti...
»