The Fast Discrete Tchebichef Transform Algorithms for Short-Length Input Sequences
In this article, the fast algorithms for the discrete Tchebichef transform (DTT) are proposed for input sequences of lengths in the range from 3 to 8. At present, DTT is widely applied in signal processing, image compression, and video coding. The review of the articles related to fast DTT algorithm...
Saved in:
Main Authors: | Aleksandr Cariow, Marina Polyakova |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-05-01
|
Series: | Signals |
Subjects: | |
Online Access: | https://www.mdpi.com/2624-6120/6/2/23 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Protecting IOT Networks Through AI-Based Solutions and Fractional Tchebichef Moments
by: Islam S. Fathi, et al.
Published: (2025-06-01) -
Optimization of Iterative Control Algorithms for High-Resolution Adaptive Optics Systems
by: Shenghu Liu, et al.
Published: (2024-01-01) -
Butterfly conservation /
by: New, T. R.
Published: (1991) -
Automatic Focusing of Off-Axis Digital Holographic Microscopy by Combining the Discrete Cosine Transform Sparse Dictionary with the Edge Preservation Index
by: Zhaoliang Liu, et al.
Published: (2025-05-01) -
Butterflies--how to identify and attract them to your garden /
by: Schneck, Marcus
Published: (1990)