<< Chapter < Page Chapter >> Page >

Computational experiment

Experiment design

We wanted to determine the most computationally efficient demodulation method for the digital multitone scheme. In our experiment, we compared the operation counts of an optimized FFT meta algorithm, a partial DFT computation (the DFT computed only for the nonzero coefficients), and FFAST in demodulating various message signals. We chose these demodulation methods because they are currently the most efficient methods for DMT demodulation. The experiments were run using MATLAB 2014a. We chose to run our experiment in MATLAB for its rapid prototyping environment.

While we were interested in comparing the computational efficiency of these algorithms, we chose to record operation counts rather than run times. Run times are unreliable metrics on machines with multitasking operating systems, especially when using highly optimized programs like MATLAB. We chose to count complex additions and multiplications as one operation each. We did not count conditional statements as operations because in most general processors, they only require a single cycle. We counted complex exponentials and trigonometric functions as one operation because they may be implemented using lookup tables.

Meta-fft algorithm implementation

The two main goals for our implementation of the optimized FFT meta algorithm were to i) create an algorithm that performs without the need to zero-pad the signal and ii) allows us to count operations. Well-behaved signal lengths in our implementation of the algorithm have the form of N = n 0 n 1 n 2 , where n i are coprimes. To exploit this structure, the optimized FFT meta algorithm, implemented in meta_fft.m , uses a self-sorting mixed-radix complex FFT [link] . For sub-transforms of length 2 N 6 , short-length Winograd transforms are applied to conserve operation count. All other transforms are computed using Rader's FFT algorithm [link] .

Ffast implementation

The FFAST algorithm implementation requires the signal itself, the length of the signal, and a vector of the downsampling coefficients.

The FFAST algorithm was implemented in two files. The first file, ffast_front_end.m , downsamples the signal by each of the coprimes and feeds shifted and unshifted versions of the downsampling to the meta_fft.m file, to get operation counts and the relevant FFTs. Once the relevant DFT pairs are generated, ffast_front_end.m calls the back end of the algorithm.

The second file, peeling_decoder.m , implements the peeling module of FFAST to backsolve the bipartite graph. The program will return a flag if the algorithm encounters no singletons at a stage where it has not been fully solved.

Numerical results

In our first experiment, we varied the signal length N and observed the operation counts required for the optimized FFT meta algorithm, the partial DFT, and FFAST. We constructed each signal in the Fourier domain by randomly selecting k values from the set of integers { 1 , , N } and setting the corresponding DFT coefficients to k 2 . For each signal, we put k = N 1 / 3 , which is the greatest allowed sparsity in our scheme. The choice of k and values of the k nonzero DFT coefficients are consistent with the DMT scheme. We used MATLAB's library function ifft() to compute the corresponding signal and counted the number of operations it took each algorithm to compute the DFT. We observed that the operation count required for FFAST was usually an order of magnitude less that the operation counts required for both the meta FFT algorithm and the partial DFT. See Fig  [link] for the results of the first experiment.

Experiment 1

In our second experiment, we varied the signal sparsity k and observed the operation count required for the optimized FFT meta algorithm, the partial DFT, and FFAST. For this experiment, signal length N = 8740 and the signals were constructed in the Fourier domain, as before. We observed an 80 % computational decrease from the optimized FFT to FFAST for all k < N 1 3 . However, for k > N 1 3 , we observed signals for which FFAST did not converge. See Fig  [link] for the results of the second experiment.

Experiment 2

Note that the operation count for the partial DFT is less than the operation count for FFAST for k < 8 ; this is somewhat misleading because the way that the partial DFT is computed is slightly optimistic. The partial DFT computes only the nonzero coefficients, which are known a priori in this experiment. In the general framework of DMT, one would need to compute all possibly nonzero DFT coefficients, resulting in an operation count higher than that of FFAST.

Questions & Answers

the art of managing the production, distribution and consumption.
Satangthem Reply
what is economics
Khawar Reply
marginal utility is the additional satisfaction one derives from consuming additional unit of a good or service.
It's the allocation of scarce resources.
marginal utility please?
marginal utility is the additional satisfaction one derives from consuming additional unit of a good or service.
I know the definition, but I don't understand its meaning.
what is the must definition of economic please?
demand lfs
Economics is derived from the word Oikonomia which means management of household things. Thus, Economics is a study of household things with the constrains of allocating scare resources.
what is Open Market Operation
Adu Reply
dominating middlemen men activities circumstances
Christy Reply
what Equilibrium price
Adji Reply
what is gap
who is good with the indifference curve
What is diseconomic
Alixe Reply
what are the types of goods
how can price determination be the central problem of micro economics
simon Reply
marginal cost formula
Nandu Reply
you should differentiate the total cost function in order to get marginal cost function then you can get marginal cost from it
What about total cost
how can price determination be the central problem if micro economics
formula of cross elasticity of demand
Theresia Reply
what is ceteris paribus
Priyanka Reply
what is ceteris parabus
Ceteris paribus - Literally, "other things being equal"; usually used in economics to indicate that all variables except the ones specified are assumed not to change.
What is broker
land is natural resources that is made by nature
What is broker
what is land
What is broker
land is natural resources that is made by nature
whats poppina nigga turn it up for a minute get it
amarsyaheed Reply
what is this?
am from nigeria@ pilo
am from nigeria@ pilo
what is production possibility frontier
it's a summary of opportunity cost depicted on a curve.
please help me solve this question with the aid of appropriate diagrams explain how each of the following changes will affect the market price and quantity of bread 1. A
Manuela Reply
please l need past question about economics
Prosper Reply
ok let me know some of the questions please.
ok am not wit some if den nw buh by tommorow I shall get Dem
Hi guys can I get Adam Smith's WEALTH OF NATIONS fo sale?
hello I'm Babaisa alhaji Mustapha. I'm studying Economics in the university of Maiduguri
my name is faisal Yahaya. i studied economics at Kaduna state university before proceeding to West African union university benin republic for masters
Hi guys..I am from Bangladesh..
Wat d meaning of management
igwe Reply
disaster management cycle
Gogul Reply
cooperate social responsibility
Fedric Wilson Taylor also define management as the act of knowing what to do and seeing that it is done in the best and cheapest way
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

Get the best Algebra and trigonometry course in your pocket!

Source:  OpenStax, Using ffast to decrease computation time in digital multitone communication. OpenStax CNX. Dec 17, 2014 Download for free at http://legacy.cnx.org/content/col11731/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Using ffast to decrease computation time in digital multitone communication' conversation and receive update notifications?