Abstract
Multiresolution analysis via decomposition into wavelets has been established as an important transform technique in signal processing. A wealth of results is available on this subject, and recently, the framework has been extended to treat finite length sequences of size 2n (for positive integers n) over finite fields. The present paper extends this idea further to provide a framework for dealing with data lengths pn for any prime p. This generalization is motivated in part by the need for such transforms for building error correcting codes in the wavelet transform domain. Potential applications and computational complexity issues are discussed as well.
| Original language | English (US) |
|---|---|
| Pages | 589-592 |
| Number of pages | 4 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) - Lausanne, Switz Duration: Sep 16 1996 → Sep 19 1996 |
Other
| Other | Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) |
|---|---|
| City | Lausanne, Switz |
| Period | 9/16/96 → 9/19/96 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering