Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Bit-Reversal Permutation: Bluesteins FFT Algorithm, Bruuns FFT Algorithm, Butterfly Diagram -

inglise keel
2026-03-26
128,12 € 213,53 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

High Quality Content by WIKIPEDIA articles! In applied mathematics, a bit-reversal permuation is a permutation of a sequence with n = 2m (a power of two) elements, defined by reversing the binary digits of the index (0 to n ¿ 1) of each element. The generalization to n = bm for an arbitrary integer b > 1 is a base-b digit-reversal permutation, in which the base-b (radix-b) digits of the index of each elemen ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

High Quality Content by WIKIPEDIA articles! In applied mathematics, a bit-reversal permuation is a permutation of a sequence with n = 2m (a power of two) elements, defined by reversing the binary digits of the index (0 to n ¿ 1) of each element. The generalization to n = bm for an arbitrary integer b > 1 is a base-b digit-reversal permutation, in which the base-b (radix-b) digits of the index of each element are reversed to obtain the permuted index. A further generalization to arbitrary composite sizes is a mixed-radix digit reversal (in which the elements of the sequence are indexed by a number expressed in a mixed radix, whose digits are reversed by the permutation).

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786133220478
Kirjuta oma arvustus
Te vaatate: Bit-Reversal Permutation: Bluesteins FFT Algorithm, Bruuns FFT Algorithm, Butterfly Diagram
Teie hinnang:

Goodreads'i arvustused

128,12 € 213,53 €