Fast recursive computation of Krawtchouk polynomials
Krawtchouk polynomials (KPs) and their moments are used widely in the field of signal processing for their superior discriminatory properties. This study proposes a new fast recursive algorithm to compute Krawtchouk polynomial coefficients (KPCs). This algorithm is based on the symmetry property of...
保存先:
主要な著者: | , , , , |
---|---|
フォーマット: | 論文 |
言語: | English |
出版事項: |
Springer
2018
|
オンライン・アクセス: | http://psasir.upm.edu.my/id/eprint/72738/1/Fast%20recursive%20computation%20of%20Krawtchouk%20polynomials.pdf http://psasir.upm.edu.my/id/eprint/72738/ https://link.springer.com/article/10.1007/s10851-017-0758-9#citeas |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|