Based on the discrete fractional random transform (DFRNT), we present the discrete fractional random cosine and sine transforms (DFRNCT and DFRNST). We demonstrate that the DFRNCT and DFRNST can be regarded as special kinds of DFRNT and thus their mathematical properties are inherited from the DFRNT
β¦ LIBER β¦
The multiplicative complexity of discrete cosine transforms
β Scribed by Ephraim Feig; Elliot Linzer
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 436 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The discrete fractional random cosine an
β
Zhengjun Liu; Qing Guo; Shutian Liu
π
Article
π
2006
π
Elsevier Science
π
English
β 204 KB
The multiplicative complexity of the Dis
β
L Auslander; E Feig; S Winograd
π
Article
π
1984
π
Elsevier Science
π
English
β 910 KB
Fast polynomial multiplication and convo
β
GΓΌnter Baszenski; Manfred Tasche
π
Article
π
1997
π
Elsevier Science
π
English
β 928 KB
Image encryption based on the multiple-o
β
Jianhua Wu; Lin Zhang; Nanrun Zhou
π
Article
π
2010
π
Elsevier Science
π
English
β 718 KB
On the discrete cosine transform computa
β
VladimΓr BritaΕΓ‘k
π
Article
π
1994
π
Elsevier Science
π
English
β 485 KB
Lossless Image Compression Using the Dis
β
Giridhar Mandyam; Nasir Ahmed; Neeraj Magotra
π
Article
π
1997
π
Elsevier Science
π
English
β 461 KB
The DCT has long been used as a method for image two-dimensional images based on the discrete cosine transform (DCT) is proposed. This method quantizes the high-energy coding and has now become the standard for video coding DCT coefficients in each block, finds an inverse DCT from [2]. Its energy co