PROPOSAL: Design an
SDR based AM transceiver 3 Demodulation(Receiver)
which transmits an AM signal
in real time and receives the
same signal after application
of denoising filters. The
denoising is to be carried out
using Fourier analysis.
Abstract
ProPOSEL is purpose-built to integrate and
design an SDR based AM transceiver which
transmits an AM signal in real time and receives
the same signal after application of denoising
filters. The denoising is to be carried out using
Fourier analysis. This can be done simply by
using adalm pluto and coding and simulating on
matlab to show the result.
1 Introduction
The carrier wave used by radio frequency
(RF) transmissions doesn't carry much
information itself. To include speech or data,
another wave has to be superimposed on
the carrier wave, thus changing the shape of
the c((arrier wave. The process of doing so
is called modulation. To transmit sound, the
audio signal must first be converted into an
electric signal, using a transducer. After
conversion, it is used to modulate a carrier
signal.
The multiplication of the same signal on
reciving side makes the signal demodulated
and we can get the actual message , what
we have sent . but in the cep , denoising
block also used to remove the noise which
comes during the transmission.
This simply can be done using adaptive
digital filters.
2 Modulation(Transmitter)
There are many ways to modulate a signal on
matlab we can simply multiply it with carrier
frequency or y =
modulate(x,fc,fs) modulates the real
message signal x with a carrier frequency fc and
sample rate fs. If x is a matrix, the modulated
signal is computed independently for each
column and stored in the corresponding column
of y.
The demodulation is simple as modulation for
coherent demodulation but for evelope detection
A +m(t)>0 , here we will be using coherent
demodulation .
Once the signal is recived on receiver side than it
is passed from demodulator block simply ready
for noise removal.
4 Filter(using fft)
Transforms and filters are tools for processing
and analyzing discrete data, and are commonly
used in signal processing applications and
computational mathematics. When data is
represented as a function of time or space, the
Fourier transform decomposes the data into
frequency components. The fft function uses a
fast Fourier transform algorithm that reduces its
computational cost compared to other direct
implementations. For a more detailed introduction
to Fourier analysis, see Fourier Transforms.
The conv and filter functions are also useful tools
for modifying the amplitude or phase of input
data using a transfer function.
fft(X) computes the discrete Fourier
transform (DFT) of X using a fast Fourier
transform (FFT) algorithm.
 If X is a vector, then fft(X) returns the
Fourier transform of the vector.
 If X is a matrix, then fft(X) treats the
columns of X as vectors and returns
the Fourier transform of each column.
 If X is a multidimensional array,
then fft(X) treats the values along the
first array dimension whose size does
not equal 1 as vectors and returns the
Fourier transform of each vector.
5 Refrences
https://www.mathworks.com/help/comm/ug/fm-
modulation-and-demodulation.htm