<< Chapter < Page Chapter >> Page >

Digital multitone modulation

We present the digital multitone modulation scheme and demonstrate its suitability for demodulation via FFAST.

Digital multitone modulation scheme

Let a finite alphabet A = { a 1 , a 2 , a | A | } be given, where each symbol a A is associated with a unique sequence of B ordered bits, b B - 1 , , b 1 , b 0 , where B = log 2 | A | and b i { 0 , 1 } for i = 0 , , B - 1 . For example, let A be the set of all lowercase letters in the English alphabet and associate each letter with its order in the alphabet. In this case, the binary sequence `01101' corresponds to the thirteenth letter, “m".

Generally speaking, Digital Multitone (DMT) Modulation is a “parallel communication scheme in which several carriers of different frequencies each carry narrowband signals simultaneously” [link] . These narrowband signals are usually sinusoids that encode the binary sequence associated with each symbol. If a bit is “high", then the corresponding sinusoid is expressed in the output signal; otherwise the bit is “low" and the sinusoid is not expressed. More precisely, given a symbol a A with the corresponding binary sequence b B - 1 , , b 1 , b 0 , the message signal m ( t ) is defined to be

m ( t ) = 1 k = 0 B - 1 b k k = 0 B - 1 b k c o s ( 2 π ( k + 1 ) f 0 t )

for some fundamental carrier frequency, f 0 .

In our previous example where A is the English alphabet and the letter “m" corresponds to “01101”, the message signal m ( t ) is the sum of the first, third, and fourth harmonics, as shown in the figure below:

Decomposition of “m” in DMT Scheme

In our computational experiments, we use digital multitone modulation to encode 8-bit Extended ASCII values. An Extended ASCII table can be found here . Below are several symbols and their digital multitone modulation signals.

Table of Extended ASCII Values
Different Symbols in DMT Scheme

Sparsity in digital multitone modulation

Sparse FFT algorithms only achieve low runtime complexity if the input signal is sparse in its Fourier representation; that is, if for a length- N signal, there are k nonzero DFT coefficients with k < < N . FFAST, the sparse FFT algorithm that we will be using, requires the sparsity constraint k < N 1 3 . Recall that the message signal, m ( t ) , is defined as

m ( t ) = 1 k = 0 B - 1 b k k = 0 B - 1 b k c o s ( 2 π ( k + 1 ) f 0 t )

so that the Nyquist frequency is 2 B f 0 . In order to ensure signal sparsity, the sampling frequency should be a multiple of the fundamental carrier frequency so that each of the sinusoidal components falls into a single frequency bin. This type of “on-the-grid" sampling may be expressed as

f s = N f 0

where N is the length of the sampled signal. Note that in [link] each sinusoid contributes two DFT coefficients. Thus, k = 2 B if all bits are high so that the sparsity condition may be expressed as 2 B < N 1 3 .

Sampling plays a large role in signal sparsification. There are many sampling methods that ensure sparsity and we present two different methods. The first method involves padding the input signal to achieve sparsity. Consider sampling at the Nyquist frequency so that f s = 2 B f 0 . As stated, this sampled signal is not necessarily sparse – in fact, k = N if all bits are high! However, periodizing the sampled signal sufficiently many times will result in higher frequency resolution by placing zero-value coefficients in between the nonzero coefficients, thus sparsifying the signal. This method results in a spectrum with nonzero coefficient few and far between. Second, consider sampling at a sufficiently high rate to satisfy the sparsity condition; that is, f s > 8 B 3 f 0 . First note that 8 B 3 f 0 > 2 B f 0 so that aliasing does not occur. This method results in a compact spectrum where only the first and last B coefficients are nonzero. See the figure below for a spectra that are characteristic of these methods.

Spectra for Different Sampling Schemes

It should be noted that there are many sampling methods that ensure signal sparsity but for the purposes of this project, we care only that the signal is sparse. Sampling schemes are discussed further in [link] .

Questions & Answers

do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
Damian Reply
absolutely yes
how to know photocatalytic properties of tio2 nanoparticles...what to do now
Akash Reply
it is a goid question and i want to know the answer as well
characteristics of micro business
Do somebody tell me a best nano engineering book for beginners?
s. Reply
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
what is the actual application of fullerenes nowadays?
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
Mostly, they use nano carbon for electronics and for materials to be strengthened.
is Bucky paper clear?
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Do you know which machine is used to that process?
how to fabricate graphene ink ?
for screen printed electrodes ?
What is lattice structure?
s. Reply
of graphene you mean?
or in general
in general
Graphene has a hexagonal structure
On having this app for quite a bit time, Haven't realised there's a chat room in it.
what is biological synthesis of nanoparticles
Sanket Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
many many of nanotubes
what is the k.e before it land
what is the function of carbon nanotubes?
I'm interested in nanotube
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
what is system testing
what is the application of nanotechnology?
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
anybody can imagine what will be happen after 100 years from now in nano tech world
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
silver nanoparticles could handle the job?
not now but maybe in future only AgNP maybe any other nanomaterials
I'm interested in Nanotube
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Got questions? Join the online conversation and get instant answers!
QuizOver.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?