Wavelet convolutional codes with bipartite trellises
暂无分享,去创建一个
We introduce a method novel to generate new types of time-varying convolutional codes using finite-field wavelets. These codes have a new type of trellis that we refer to as a bipartite (or k-partite) trellis. An important feature of the k-partite trellises is their reduced decoding complexity.
[1] J. O’Sullivan,et al. Theory of Paraunitary Filter Banks Over Fields of Characteristic Two , 2002 .
[2] Faramarz Fekri. Finite-field wavelet transforms and their application to error-control coding , 2000 .
[3] Ronald W. Schafer,et al. Realization of paraunitary filter banks over fields of characteristic two , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).