Cargando…
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algor...
Autores principales: | AL-Utaibi, Khaled A., Abdulhussain, Sadiq H., Mahmmod, Basheera M., Naser, Marwah Abdulrazzaq, Alsabah, Muntadher, Sait, Sadiq M. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8470097/ https://www.ncbi.nlm.nih.gov/pubmed/34573787 http://dx.doi.org/10.3390/e23091162 |
Ejemplares similares
-
On Computational Aspects of Krawtchouk Polynomials for High Orders
por: Mahmmod, Basheera M., et al.
Publicado: (2020) -
A Robust Handwritten Numeral Recognition Using Hybrid Orthogonal Polynomials and Moments
por: Abdulhussain, Sadiq H., et al.
Publicado: (2021) -
Performance evaluation of frequency division duplex (FDD) massive multiple input multiple output (MIMO) under different correlation models
por: Abdul-Hadi, Alaa M., et al.
Publicado: (2022) -
3D Object Recognition Using Fast Overlapped Block Processing Technique
por: Mahmmod, Basheera M., et al.
Publicado: (2022) -
Performance enhancement of high order Hahn polynomials using multithreading
por: Mahmmod, Basheera M., et al.
Publicado: (2023)