Newton's cradle: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Jim10701
→‎Invention and design: ce; rmv peacockish "iconic" and editorial "uncomprehending"
 
en>Engineman
Line 1: Line 1:
Hi there. My name is Garland although it is not the title on my beginning certification. Interviewing is what I do in my day occupation. Some time in the past he chose to live in Kansas. The thing she adores most is to play handball but she can't make it her profession.<br><br>Also visit my web-site; [http://orkutnet.com/index.php?do=/profile-1876/info/ orkutnet.com]
A '''DFT matrix''' is an expression of a '''[[discrete Fourier transform]] (DFT)''' as a [[matrix multiplication]].
 
==Definition==
An ''N''-point DFT is expressed as an ''N''-by-''N'' matrix multiplication as <math>X = W x</math>, where <math>x</math> is the original input signal, and <math>X</math> is the DFT of the signal.
 
The transformation <math>W</math> of size <math>N\times N</math> can be defined as <math>W = \left(\frac{\omega^{jk}}{\sqrt{N}}\right)_{j,k=0,\ldots,N-1} </math>, or equivalently:
:<math>
W = \frac{1}{\sqrt{N}} \begin{bmatrix}
1&1&1&1&\cdots &1 \\
1&\omega&\omega^2&\omega^3&\cdots&\omega^{N-1} \\
1&\omega^2&\omega^4&\omega^6&\cdots&\omega^{2(N-1)}\\ 1&\omega^3&\omega^6&\omega^9&\cdots&\omega^{3(N-1)}\\
\vdots&\vdots&\vdots&\vdots&&\vdots\\
1&\omega^{N-1}&\omega^{2(N-1)}&\omega^{3(N-1)}&\cdots&\omega^{(N-1)(N-1)}\\
\end{bmatrix},
</math>
where <math>\omega = e^{-\frac{2\pi i}{N}}</math> is a [[primitive nth root of unity|primitive <math>N</math>th root of unity]] in which <math>i=\sqrt{-1}</math>.
This is the [[Vandermonde matrix]] for the roots of unity, up to the normalization factor.
Note that the normalization factor in front of the sum (<math>1/\sqrt{N}</math>) and the sign of the exponent in &omega; are merely conventions, and differ in some treatments. All of the following discussion applies regardless of the convention, with at most minor adjustments. The only important thing is that the forward and inverse transforms have opposite-sign exponents, and that the product of their normalization factors be 1/''N''. However, the <math>1/\sqrt{N}</math> choice here makes the resulting DFT matrix [[unitary matrix|unitary]], which is convenient in many circumstances.
 
[[Fast Fourier Transform]] algorithms utilize the symmetries of the matrix to reduce the time of multiplying a vector by this matrix, from the usual <math>O(N^2)</math>. Similar techniques can be applied for multiplications by matrices such as [[Hadamard matrix]] and the [[Walsh matrix]].
 
==Examples==
===Two-point===
The two-point DFT is a simple case, in which the first entry is the DC (sum) and the second entry is the AC (difference).
 
:<math>
\frac{1}{\sqrt{2}}
\begin{bmatrix}
1 & 1 \\
1 & -1 \end{bmatrix}
</math>
 
The first row performs the sum, and the second row performs the difference.
 
The factor of <math>1/\sqrt{2}</math> is to make the transform unitary (see below).
 
===Four-point===
The four-point DFT matrix is as follows:
:<math>
W=\frac{1}{\sqrt{4}}
\begin{bmatrix}
1 & 1& 1 & 1\\
1 &-i&-1 & i\\
1 &-1& 1 &-1\\
1 & i&-1 &-i\end{bmatrix}
</math>
 
===Eight-point===
The first non-trivial integer power of two case is for 8 points:
:<math>W=
\frac{1}{\sqrt{8}}
\begin{bmatrix}
\omega^0    & \omega^0  &\omega^0  & \ldots & \omega^0        \\
\omega^0    & \omega^1  &\omega^2  & \ldots & \omega^7        \\
\omega^0    & \omega^2  &\omega^4  & \ldots & \omega^{14}    \\
\omega^0    & \omega^3  &\omega^6  & \ldots & \omega^{21}    \\
\omega^0    & \omega^4  &\omega^8  & \ldots & \omega^{28}    \\
\omega^0    & \omega^5  &\omega^{10}  & \ldots & \omega^{35}  \\
\vdots      & \vdots    & \vdots      & \ddots & \vdots      \\
\omega^0    & \omega^7  &\omega^{14}  & \ldots  & \omega^{49} \\
\end{bmatrix}
</math>
 
where
 
:<math>\omega = e^{-\frac{2 \pi i}{8}} = \frac{1}{\sqrt{2}} - \frac{i}{\sqrt{2}}</math>
 
The following image depicts the DFT as a matrix multiplication, with elements of the matrix depicted by samples of complex exponentials:
 
[[Image:Fourierop rows only.svg]]
 
The real part (cosine wave) is denoted by a solid line, and the imaginary part (sine wave) by a dashed line.
 
The top row is all ones (scaled by <math>1/\sqrt{8}</math> for unitarity), so it "measures" the [[DC bias|DC component]] in the input signal. The next row is eight samples of negative one cycle of a complex exponential, i.e., a signal with a [[fractional frequency]] of −1/8, so it "measures" how much "strength" there is at fractional frequency +1/8 in the signal.  Recall that a [[matched filter]] compares the signal with a time reversed version of whatever we're looking for, so when we're looking for fracfreq. 1/8 we compare with fracfreq. −1/8 so that is why this row is a [[negative frequency]].  The next row is negative two cycles of a complex exponential, sampled in eight places, so it has a fractional frequency of −1/4, and thus "measures" the extent to which the signal has a fractional frequency of +1/4.
 
The following summarizes how the 8-point DFT works, row by row, in terms of fractional frequency:
*0      measures how much DC is in the signal
*−1/8  measures how much of the signal has a fractional frequency of +1/8
*−1/4  measures how much of the signal has a fractional frequency of +1/4
*−3/8  measures how much of the signal has a fractional frequency of +3/8
*−1/2  measures how much of the signal has a fractional frequency of +1/2
*−5/8  measures how much of the signal has a fractional frequency of +5/8
*−3/4  measures how much of the signal has a fractional frequency of +3/4
*−7/8  measures how much of the signal has a fractional frequency of +7/8
 
Equivalently the last row can be said to have a fractional frequency of +1/8 and thus measure how much of the signal has a fractional frequency of −1/8.  In this way, it could be said that the top rows of the matrix "measure" positive frequency content in the signal and the bottom rows measure negative frequency component in the signal.
 
==Unitary transform==
The DFT is (or can be, through appropriate selection of scaling) a unitary transform, i.e., one that preserves energy.  The appropriate choice of scaling to achieve unitarity is <math>1/\sqrt{N}</math>, so that the energy in the physical domain will be the same as the energy in the Fourier domain, i.e., to satisfy [[Parseval's theorem]].  (Other, non-unitary, scalings, are also commonly used for computational convenience; e.g., the [[convolution theorem]] takes on a slightly simpler form with the scaling shown in the [[discrete Fourier transform]] article.)
 
==Other properties==
For other properties of the DFT matrix, including its eigenvalues, connection to convolutions, applications, and so on, see the [[discrete Fourier transform]] article.
 
==In the limit: The Fourier operator==
{{multiple image
| footer    = The [[Fourier operator]]
| width    = 150
| image1    = Fourieropr.png
| caption1  = Real part (cosine)
| image2    = Fourieropi.png
| caption2  = Imaginary part (sine)
}}
If we make a very large matrix with complex exponentials in the rows (i.e., cosine real parts and sine imaginary parts), and increase the resolution without bound, we approach the kernel of the Fredholm integral equation of the 2nd kind, namely the [[Fourier operator]] that defines the continuous Fourier transform.  A rectangular portion of this continuous Fourier operator can be displayed as an image, analogous to the DFT matrix, as shown at right, where greyscale pixel value denotes numerical quantity.
 
==See also==
 
*[[Multidimensional transform]]
 
==References==
*[http://www.amazon.com/gp/reader/0849336929 The Transform and Data Compression Handbook by P. C. Yip, K. Ramamohan Rao] - See chapter 2 for a treatment of the DFT based largely on the DFT matrix
 
==External links==
*[http://wearcam.org/ece431/course_material/fourierop_and_dit.htm Fourier Operator and Decimation In Time (DIT)]
 
[[Category:Fourier analysis]]
[[Category:Digital signal processing]]
[[Category:Matrices]]

Revision as of 14:48, 3 February 2014

A DFT matrix is an expression of a discrete Fourier transform (DFT) as a matrix multiplication.

Definition

An N-point DFT is expressed as an N-by-N matrix multiplication as , where is the original input signal, and is the DFT of the signal.

The transformation of size can be defined as , or equivalently:

where is a primitive th root of unity in which . This is the Vandermonde matrix for the roots of unity, up to the normalization factor. Note that the normalization factor in front of the sum () and the sign of the exponent in ω are merely conventions, and differ in some treatments. All of the following discussion applies regardless of the convention, with at most minor adjustments. The only important thing is that the forward and inverse transforms have opposite-sign exponents, and that the product of their normalization factors be 1/N. However, the choice here makes the resulting DFT matrix unitary, which is convenient in many circumstances.

Fast Fourier Transform algorithms utilize the symmetries of the matrix to reduce the time of multiplying a vector by this matrix, from the usual . Similar techniques can be applied for multiplications by matrices such as Hadamard matrix and the Walsh matrix.

Examples

Two-point

The two-point DFT is a simple case, in which the first entry is the DC (sum) and the second entry is the AC (difference).

The first row performs the sum, and the second row performs the difference.

The factor of is to make the transform unitary (see below).

Four-point

The four-point DFT matrix is as follows:

Eight-point

The first non-trivial integer power of two case is for 8 points:

where

The following image depicts the DFT as a matrix multiplication, with elements of the matrix depicted by samples of complex exponentials:

The real part (cosine wave) is denoted by a solid line, and the imaginary part (sine wave) by a dashed line.

The top row is all ones (scaled by for unitarity), so it "measures" the DC component in the input signal. The next row is eight samples of negative one cycle of a complex exponential, i.e., a signal with a fractional frequency of −1/8, so it "measures" how much "strength" there is at fractional frequency +1/8 in the signal. Recall that a matched filter compares the signal with a time reversed version of whatever we're looking for, so when we're looking for fracfreq. 1/8 we compare with fracfreq. −1/8 so that is why this row is a negative frequency. The next row is negative two cycles of a complex exponential, sampled in eight places, so it has a fractional frequency of −1/4, and thus "measures" the extent to which the signal has a fractional frequency of +1/4.

The following summarizes how the 8-point DFT works, row by row, in terms of fractional frequency:

  • 0 measures how much DC is in the signal
  • −1/8 measures how much of the signal has a fractional frequency of +1/8
  • −1/4 measures how much of the signal has a fractional frequency of +1/4
  • −3/8 measures how much of the signal has a fractional frequency of +3/8
  • −1/2 measures how much of the signal has a fractional frequency of +1/2
  • −5/8 measures how much of the signal has a fractional frequency of +5/8
  • −3/4 measures how much of the signal has a fractional frequency of +3/4
  • −7/8 measures how much of the signal has a fractional frequency of +7/8

Equivalently the last row can be said to have a fractional frequency of +1/8 and thus measure how much of the signal has a fractional frequency of −1/8. In this way, it could be said that the top rows of the matrix "measure" positive frequency content in the signal and the bottom rows measure negative frequency component in the signal.

Unitary transform

The DFT is (or can be, through appropriate selection of scaling) a unitary transform, i.e., one that preserves energy. The appropriate choice of scaling to achieve unitarity is , so that the energy in the physical domain will be the same as the energy in the Fourier domain, i.e., to satisfy Parseval's theorem. (Other, non-unitary, scalings, are also commonly used for computational convenience; e.g., the convolution theorem takes on a slightly simpler form with the scaling shown in the discrete Fourier transform article.)

Other properties

For other properties of the DFT matrix, including its eigenvalues, connection to convolutions, applications, and so on, see the discrete Fourier transform article.

In the limit: The Fourier operator

People are nonetheless rushing to buy properties in Singapore. A new residential condominium mission in Bedok had a long queue three days before its official launch and bought more than 350 units on the very first day. Nonetheless, there is a ‘development' that had emerged in 2011 that the majority have possibly overlooked.

In August, more than a hundred individuals across 16 states reportedly had been sickened with salmonella after consuming mangos In September, the Meals and Drug Administration detained mango imports from a Mexican packing house after the fruits had been linked to the sickenings Save Cash On Your Online Purchasing Make saving money when purchasing on-line a breeze with Bodge's favourite app, Invisible Hands. This helpful program does the price-checking analysis for you, and will warn you when a unique site has a better value - or let you realize that you have found the most effective deal. Watch Posted by Edison Foo September 29, 2013 HEARTH SALE!!! From only $9xx,000! We hope this listing will help launch your search for new properties in Singapore. It's unlawful to purchase ice cream after 6 pm, in Newark.

for a borrower with one or more excellent residential property loans3; and No SSD will be payable by the seller if the property is bought more than three years after it was bought. Non-extension of the Jan 2009 Funds assistance measures for the property market when the measures expire. Permitting up to 2 years of property tax deferral for land accepted for improvement. Lively secondary marketplace for easy exit of property investments. Curiosity on mortgage fee is tax deductible when the property is rented out. We've progressive property tax rates for residential properties- the higher the value of the residential property, the upper the tax charge. Why do I've to pay property tax on my house when I'm an onwer-occupier and not deriving rental earnings? Palacio Cluster Landed

After obtaining a Sale License (topic to authorities circumstances meant to guard individuals shopping for property in Singapore), he might www.rmmonline.com proceed to sell units in his growth. Funding in the property market of Singapore is likely one of the few investment choices the place utilizing the bank's cash could not be any easier. The power of expats, to make a down payment, leverage the capital and consequently improve total return on investment, is excessive in Singapore. PRs who own a HDB flat must sell their flat inside six months of buying a non-public residential property in Singapore. EVERLASTING residents (PRs) now face unprecedented limits on their skill to purchase property in Singapore. New Condo in 2013 March Foreigners are eligible for Singapore greenback mortgage loan. housing grant

Skilled property brokers in Singapore will assist the client and defend their interests throughout the acquisition, and will help safe the provide at the best possible price. The agents may even be sure that all paperwork are in order and that the vendor is the rightful proprietor of the property. Most of the property brokers share their databases with each other. Tuesday's measures come after the Monetary Authority of Singapore in June tightened rules on property loans, and closed loopholes that allowed some householders to circumvent loan restrictions and avoid paying levies when buying extra property. Contact us for a FREE housing loan analysis and to study concerning the newest mortgage to worth on Singapore housing loans. J Gateway Condominium (Bought Out) Oct, 2013

6. Completion of automotive park, roads and drains serving the housing project 5% 7. Notice of Vacant Possession (Upon obtaining Temporary Occupation Permit) The estimates given by SingaporeHousingLoan.SG's calculator are not quotations and are usually not binding in any way on SingaporeHousingLoan.sg or the consumer. The method of calculation does not exactly mirror that of which is being used by the individual monetary establishment and the data provided should be used as a information only. SingaporeHousingLoan.SG's calculator does not pre-qualify you for any housing loan from any monetary institution. Undercover Report Finds Unlawful Rat Meat Sold In London Market Unpasteurized Tempeh Linked To Salmonella Outbreak That Sickens 60 Hottest EC Launch in Sengkang!

BuyRentSingaporeProperty.com is dedicated in providing the newest residential launches, Developer's sales, new launches, resale, HIGH tasks and rental of properties in Singapore. Then there are new launch property condos in the mid-tier range. These are sometimes in the vicinity of the city fringe, in areas corresponding to Newton and Novena Tanjong Rhu. These new launch projects are popular due to their proximity to town heart, the place the enterprise and entertainment centers and all the amenities they provide, but they're usually cheaper than the City core region tasks. Why submit cheques to register for new property launches in Singapore? Riversails Apartment @ Higher Serangoon LakeVille @ Jurong Lakeside Condo by MCL Ferra Condo @ Leonie Hill If we make a very large matrix with complex exponentials in the rows (i.e., cosine real parts and sine imaginary parts), and increase the resolution without bound, we approach the kernel of the Fredholm integral equation of the 2nd kind, namely the Fourier operator that defines the continuous Fourier transform. A rectangular portion of this continuous Fourier operator can be displayed as an image, analogous to the DFT matrix, as shown at right, where greyscale pixel value denotes numerical quantity.

See also

References

External links