|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| '''Bruun's algorithm''' is a [[fast Fourier transform]] (FFT) algorithm based on an unusual recursive [[polynomial]]-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996. Because its operations involve only real coefficients until the last computation stage, it was initially proposed as a way to efficiently compute the [[discrete Fourier transform]] (DFT) of real data. Bruun's algorithm has not seen widespread use, however, as approaches based on the ordinary [[Cooley–Tukey FFT algorithm]] have been successfully adapted to real data with at least as much efficiency. Furthermore, there is evidence that Bruun's algorithm may be intrinsically less accurate than Cooley–Tukey in the face of finite numerical precision (Storn, 1993).
| | Invest in a rechargeable battery for your special wireless gaming controller. You can buy chargeable power supplies for each and every controller. If you'd like to play video games regularly, you will be dining on through a small wealth in the batteries used to be run your controllers. A rechargeable battery could help you save a lot of money in the long run.<br><br> |
|
| |
|
| Nevertheless, Bruun's algorithm illustrates an alternative algorithmic framework that can express both itself and the Cooley–Tukey algorithm, and thus provides an interesting perspective on FFTs that permits mixtures of the two algorithms and other generalizations.
| | Go on the internet for help. Virtually any game has its different legion of devoted devotees, lots of which spend countless hours crafting effective maps and guides. If you have any sort of inquiries relating to where and ways to make use of [http://prometeu.net astuces clash of clans], you could call us at our site. Additionally there are newsgroups where you are speak one on at least one with other players. Benefit from this found diamond and it is easy to eventually get past that level you have been stuck on forever.<br><br>clash of clans is a ideal game, which usually requires in order to build your personal village, discover warriors, raid tools and build your personalized clan and so on. there is a lot a lot significantly more to this video game and for every these types of you require jewels within order to play, as you which includes. Clash of Clans hack allows you to obtain as many jewels as you desire. There is an unlimited amount of gems you could generate with all the Collide of Clans cheats you can get online, however you need to be specific about the weblink you are using for the reason some of them only waste materials your as well as also dont get an individual anything more.<br><br>In the first instance clash of clans get into tool no survey builds believe in among a new people. Society is definitely powered by peer pressure, one of that this most [http://Mondediplo.com/spip.php?page=recherche&recherche=powerful+forces powerful forces] about the planet. To be long as peer make utilizes its power for many good, clash of clans hack tool no analysis will have its store in community.<br><br>If you are looking Conflict of Home owners Jewels Free, or you can find yourself just buying a Compromise Conflict of Tribes, has got the smartest choice to your internet, absolutely free and also only takes a jiffy to get all these kind of.<br><br>Were you aware that some computer games are educational gear? If you know a young person that likes to play video games, educational opportunities are a fantastic refers to to combine learning with entertaining. The Www can connect you with thousands of parents with similar values and generally more than willing within order to share their reviews and notions with you.<br><br>In which to master game play regarding shooter video games, learn about your weapons. Have an understanding of everything there is realize about each and every weapon style in recreation. Each weapon excels on the inside certain ways, but sheds short in others. When you know that pluses and minuses involved with each weapon, you can use them to full advantage. |
| | |
| == A polynomial approach to the DFT ==
| |
| | |
| Recall that the DFT is defined by the formula:
| |
| | |
| :<math>X_k = \sum_{n=0}^{N-1} x_n e^{-\frac{2\pi i}{N} nk }
| |
| \qquad
| |
| k = 0,\dots,N-1. </math>
| |
| | |
| For convenience, let us denote the ''N'' [[root of unity|roots of unity]] by ω<sub>''N''</sub><sup>''n''</sup> (''n'' = 0, ..., ''N'' − 1):
| |
| | |
| :<math>\omega_N^n = e^{-\frac{2\pi i}{N} n }</math> | |
| | |
| and define the polynomial ''x''(''z'') whose coefficients are ''x''<sub>''n''</sub>:
| |
| | |
| :<math>x(z) = \sum_{n=0}^{N-1} x_n z^n.</math>
| |
| | |
| The DFT can then be understood as a ''reduction'' of this polynomial; that is, ''X''<sub>''k''</sub> is given by:
| |
| | |
| :<math>X_k = x(\omega_N^k) = x(z) \mod (z - \omega_N^k)</math>
| |
| | |
| where '''mod''' denotes the [[Polynomial remainder theorem|polynomial remainder]] operation. The key to fast algorithms like Bruun's or Cooley–Tukey comes from the fact that one can perform this set of ''N'' remainder operations in recursive stages. | |
| | |
| == Recursive factorizations and FFTs ==
| |
| | |
| In order to compute the DFT, we need to evaluate the remainder of <math>x(z)</math> modulo ''N'' degree-1 polynomials as described above. Evaluating these remainders one by one is equivalent to the evaluating the usual DFT formula directly, and requires O(''N''<sup>2</sup>) operations. However, one can ''combine'' these remainders recursively to reduce the cost, using the following trick: if we want to evaluate <math>x(z)</math> modulo two polynomials <math>U(z)</math> and <math>V(z)</math>, we can first take the remainder modulo their product <math>U(z)</math> <math>V(z)</math>, which reduces the [[Degree of a polynomial|degree]] of the polynomial <math>x(z)</math> and makes subsequent modulo operations less computationally expensive.
| |
| | |
| The product of all of the monomials <math>(z - \omega_N^k)</math> for ''k''=0..''N''-1 is simply <math>z^N-1</math> (whose roots are clearly the ''N'' roots of unity). One then wishes to find a recursive factorization of <math>z^N-1</math> into polynomials of few terms and smaller and smaller degree. To compute the DFT, one takes <math>x(z)</math> modulo each level of this factorization in turn, recursively, until one arrives at the monomials and the final result. If each level of the factorization splits every polynomial into an O(1) (constant-bounded) number of smaller polynomials, each with an O(1) number of nonzero coefficients, then the modulo operations for that level take O(''N'') time; since there will be a logarithmic number of levels, the overall complexity is O (''N'' log ''N'').
| |
| | |
| More explicitly, suppose for example that <math>z^N-1 = F_1(z) F_2(z) F_3(z)</math>, and that <math>F_k(z) = F_{k,1}(z) F_{k,2}(z)</math>, and so on. The corresponding FFT algorithm would consist of first computing ''x''<sub>''k''</sub>(''z'') = ''x''(''z'') mod
| |
| ''F''<sub>''k''</sub>(''z''), then computing ''x''<sub>''k'',''j''</sub>(''z'') = ''x''<sub>''k''</sub>(''z'') mod
| |
| ''F''<sub>''k'',''j''</sub>(''z''), and so on, recursively creating more and more remainder polynomials of smaller and smaller degree until one arrives at the final degree-0 results.
| |
| | |
| Moreover, as long as the polynomial factors at each stage are [[relatively prime]] (which for polynomials means that they have no common roots), one can construct a dual algorithm by reversing the process with the [[Chinese Remainder Theorem]].
| |
| | |
| ===Cooley–Tukey as polynomial factorization===
| |
| | |
| The standard decimation-in-frequency (DIF) radix-''r'' Cooley–Tukey algorithm corresponds closely to a recursive factorization. For example, radix-2 DIF Cooley–Tukey factors <math>z^N-1</math> into <math>F_1 = (z^{N/2}-1)</math> and <math>F_2 = (z^{N/2}+1)</math>. These modulo operations reduce the degree of <math>x(z)</math> by 2, which corresponds to dividing the problem size by 2. Instead of recursively factorizing <math>F_2</math> directly, though, Cooley–Tukey instead first computes ''x''<sub>2</sub>(''z'' ω<sub>''N''</sub>), shifting all the roots (by a ''twiddle factor'') so that it can apply the recursive factorization of <math>F_1</math> to both subproblems. That is, Cooley–Tukey ensures that all subproblems are also DFTs, whereas this is not generally true for an arbitrary recursive factorization (such as Bruun's, below).
| |
| | |
| == The Bruun factorization ==
| |
| | |
| The basic Bruun algorithm for [[power of two|powers of two]] ''N''=''2''<sup>''n''</sup> factorizes ''z''<sup>''2''<sup>''n''</sup></sup>-''1'' recursively via the rules:
| |
| | |
| :<math>z^{2M}-1 = (z^M - 1) (z^M + 1) \,</math>
| |
| :<math>z^{4M} + az^{2M} + 1 = (z^{2M} + \sqrt{2-a}z^M+1) (z^{2M} - \sqrt{2-a}z^M + 1)</math>
| |
| | |
| where ''a'' is a real constant with |''a''| ≤ 2. If <math>a=2\cos(\phi)</math>, <math>\phi\in(0,\pi)</math>, then <math>\sqrt{2+a}=2\cos\tfrac\phi2</math> and <math>\sqrt{2-a}=2\cos(\pi-\tfrac\phi2)</math>.
| |
| | |
| At stage ''s'', ''s''=0,1,2,''n''-1, the intermediate state consists of ''2''<sup>''s''</sup> polynomials <math>p_{s,0},\dots,p_{s,2^s-1}</math> of degree ''2''<sup>''n''-''s''</sup> - ''1'' or less , where
| |
| :<math>\begin{align}
| |
| p_{s,0}(z)&= p(z) \mod \left(z^{2^{n-s}}-1\right)&\quad&\text{and}\\
| |
| p_{s,m}(z) &= p(z)\mod \left(z^{2^{n-s}}-2\cos\left(\tfrac{m}{2^s}\pi\right)z^{2^{n-1-s}}+1\right)&m&=1,2,\dots,2^s-1
| |
| \end{align}</math>
| |
| | |
| By the construction of the factorization of ''z''<sup>''2''<sup>''n''</sup></sup>-''1'', the polynomials ''p''<sub>''s'',''m''</sub>(''z'') each encode 2<sup>''n''-''s''</sup> values
| |
| :<math>X_k=p(e^{2\pi i\tfrac{k}{2^n}})</math>
| |
| of the Fourier transform, for ''m''=0, the covered indices are ''k''=''0'', 2<sup>''k''</sup>, 2∙2<sup>''s''</sup>, 3∙2<sup>''s''</sup>,…, (2<sup>''n''-''s''</sup>-1)∙2<sup>''s''</sup>, for ''m''>''0'' the covered indices are ''k''=''m'', 2<sup>''s''+1</sup>-''m'', 2<sup>''s''+1</sup>+''m'', 2∙2<sup>''s''+1</sup>-''m'', 2∙2<sup>''s''+1</sup>+''m'', …, 2<sup>''n''</sup>-''m''. | |
| | |
| During the transition to the next stage, the polynomial <math>p_{s,\ell}(z)</math> is reduced to the polynomials <math>p_{s+1,\ell}(z)</math> and <math>p_{s+1,2^s-\ell}(z)</math> via polynomial division. If one wants to keep the polynomials in increasing index order, this pattern requires an implementation with two arrays. An implementation in place produces a predictable, but highly unordered sequence of indices, for example for ''N''=''16'' the final order of the ''8'' linear remainders is (''0'', ''4'', ''2'', ''6'', ''1'', ''7'', ''3'', ''5'').
| |
| | |
| At the end of the recursion, for ''s''=''n''-''1'', there remain 2<sup>''n''-''1''</sup> linear polynomials encoding two Fourier coefficients ''X''<sub>''0''</sub> and ''X''<sub>''2''<sup>''n''-1</sup></sub> for the first and for the any other ''k''th polynomial the coefficients ''X''<sub>''k''</sub> and ''X''<sub>2<sup>''n''</sup>-''k''</sub>.
| |
| | |
| At each recursive stage, all of the polynomials of the common degree ''4M''-''1'' are reduced to two parts of half the degree ''2M''-''1''. The divisor of this polynomial remainder computation is a quadratic polynomial ''z''<sup>''m''</sup>, so that all reductions can be reduced to polynomial divisions of cubic by quadratic polynomials. There are ''N''/''2''=''2''<sup>''n''-''1''</sup> of these small divisions at each stage, leading to an O (''N'' log ''N'') algorithm for the FFT.
| |
| | |
| Moreover, since all of these polynomials have purely real coefficients (until the very last stage), they automatically exploit the special case where the inputs ''x''<sub>''n''</sub> are purely real to save roughly a factor of two in computation and storage. One can also take straightforward advantage of the case of real-symmetric data for computing the [[discrete cosine transform]] (Chen and Sorensen, 1992).
| |
| | |
| === Generalization to arbitrary radices ===
| |
| | |
| The Bruun factorization, and thus the Bruun FFT algorithm, was generalized to handle arbitrary ''even'' composite lengths, i.e. dividing the polynomial degree by an arbitrary ''radix'' (factor), as follows. First, we define a set of polynomials φ<sub>''N'',α</sub>(''z'') for positive integers ''N'' and for α in <nowiki>[0,1)</nowiki> by:
| |
| | |
| :<math>\phi_{N, \alpha}(z) =
| |
| \left\{ \begin{matrix}
| |
| z^{2N} - 2 \cos (2 \pi \alpha) z^N + 1 & \mbox{if } 0 < \alpha < 1 \\ \\
| |
| z^{2N} - 1 & \mbox{if } \alpha = 0
| |
| \end{matrix} \right.
| |
| </math>
| |
| | |
| Note that all of the polynomials that appear in the Bruun factorization above can be written in this form. The zeroes of these polynomials are <math>e^{2\pi i ( \pm\alpha + k ) / N}</math> for <math>k=0,1,\dots,N-1</math> in the <math>\alpha \neq 0</math> case, and <math>e^{2\pi i k / 2N}</math> for <math>k=0,1,\dots,2N-1</math> in the <math>\alpha=0</math> case. Hence these polynomials can be recursively factorized for a factor (radix) ''r'' via:
| |
| | |
| :<math>\phi_{rM, \alpha}(z) =
| |
| \left\{ \begin{array}{ll}
| |
| \prod_{\ell=0}^{r-1} \phi_{M,(\alpha+\ell)/r} & \mbox{if } 0 < \alpha \leq 0.5 \\ \\
| |
| \prod_{\ell=0}^{r-1} \phi_{M,(1-\alpha+\ell)/r} & \mbox{if } 0.5 < \alpha < 1 \\ \\
| |
| \prod_{\ell=0}^{r-1} \phi_{M,\ell/(2r)} & \mbox{if } \alpha = 0
| |
| \end{array} \right.
| |
| </math>
| |
| | |
| ==References==
| |
| | |
| * Georg Bruun, "''z''-Transform DFT filters and FFTs," ''[[IEEE]] Trans. on Acoustics, Speech and Signal Processing'' (ASSP) '''26''' (1), 56-63 (1978).
| |
| * H. J. Nussbaumer, ''Fast Fourier Transform and Convolution Algorithms'' (Springer-Verlag: Berlin, 1990).
| |
| * Yuhang Wu, "New FFT structures based on the Bruun algorithm," ''IEEE Trans. ASSP'' '''38''' (1), 188-191 (1990)
| |
| * Jianping Chen and Henrik Sorensen, "An efficient FFT algorithm for real-symmetric data," ''Proc. ICASSP'' '''5''', 17-20 (1992).
| |
| * Rainer Storn, "Some results in fixed point error analysis of the Bruun-FTT {{sic}} algorithm," ''IEEE Trans. Signal Processing'' '''41''' (7), 2371-2375 (1993).
| |
| * Hideo Murakami, "Real-valued decimation-in-time and decimation-in-frequency algorithms," ''IEEE Trans. Circuits Syst. II: Analog and Digital Sig. Proc.'' '''41''' (12), 808-816 (1994).
| |
| * Hideo Murakami, "Real-valued fast discrete Fourier transform and cyclic convolution algorithms of highly composite even length," ''Proc. [[ICASSP]]'' '''3''', 1311-1314 (1996).
| |
| * Shashank Mittal, Md. Zafar Ali Khan, M. B. Srinivas, "A Comparative Study of Different FFT Architectures for Software Defined Radio", ''Lecture Notes in Computer Science'' '''4599''' (''Embedded Computer Systems: Architectures, Modeling, and Simulation''), 375-384 (2007). Proc. 7th Intl. Workshop, SAMOS 2007 (Samos, Greece, July 16–19, 2007).
| |
| | |
| [[Category:FFT algorithms]]
| |
Invest in a rechargeable battery for your special wireless gaming controller. You can buy chargeable power supplies for each and every controller. If you'd like to play video games regularly, you will be dining on through a small wealth in the batteries used to be run your controllers. A rechargeable battery could help you save a lot of money in the long run.
Go on the internet for help. Virtually any game has its different legion of devoted devotees, lots of which spend countless hours crafting effective maps and guides. If you have any sort of inquiries relating to where and ways to make use of astuces clash of clans, you could call us at our site. Additionally there are newsgroups where you are speak one on at least one with other players. Benefit from this found diamond and it is easy to eventually get past that level you have been stuck on forever.
clash of clans is a ideal game, which usually requires in order to build your personal village, discover warriors, raid tools and build your personalized clan and so on. there is a lot a lot significantly more to this video game and for every these types of you require jewels within order to play, as you which includes. Clash of Clans hack allows you to obtain as many jewels as you desire. There is an unlimited amount of gems you could generate with all the Collide of Clans cheats you can get online, however you need to be specific about the weblink you are using for the reason some of them only waste materials your as well as also dont get an individual anything more.
In the first instance clash of clans get into tool no survey builds believe in among a new people. Society is definitely powered by peer pressure, one of that this most powerful forces about the planet. To be long as peer make utilizes its power for many good, clash of clans hack tool no analysis will have its store in community.
If you are looking Conflict of Home owners Jewels Free, or you can find yourself just buying a Compromise Conflict of Tribes, has got the smartest choice to your internet, absolutely free and also only takes a jiffy to get all these kind of.
Were you aware that some computer games are educational gear? If you know a young person that likes to play video games, educational opportunities are a fantastic refers to to combine learning with entertaining. The Www can connect you with thousands of parents with similar values and generally more than willing within order to share their reviews and notions with you.
In which to master game play regarding shooter video games, learn about your weapons. Have an understanding of everything there is realize about each and every weapon style in recreation. Each weapon excels on the inside certain ways, but sheds short in others. When you know that pluses and minuses involved with each weapon, you can use them to full advantage.