Slide 1
Frequency Modulation (FM)
Slide 2
FM Signal Definition (cont.)
Slide 3
Discrete-Time FM Modulator
Slide 4
Single Tone FM Modulation
Slide 5
Single Tone FM (cont.)
Slide 6
Narrow Band FM
Slide 7
Bandwidth of an FM Signal
Slide 8
Demod. by a Frequency Discriminator
Slide 9
FM Discriminator (cont.)
Slide 10
Discriminator Using Pre-Envelope
Slide 11
Discriminator Using Pre-Envelope (cont.)
Slide 12
Discriminator Using Complex Envelope
Slide 13 Phase-Locked Loop Demodulator
Slide 14
PLL Analysis
Slide 15
PLL Analysis (cont. 1)
Slide 16
PLL Analysis (cont. 2)
Slide 17
Linearized Model for PLL
Slide 18
Proof PLL is a Demod for FM
Slide 19
Comments on PLL Performance
Slide 20
FM PLL vs. Costas Loop Bandwidth
Slide 21
Laboratory Experiments for FM
Slide 21
Experiment 8.1 Spectrum of an FM
Signal
Slide 22
Experiment 8.1 FM Spectrum (cont. 1)
Slide 23
Experiment 8.1 FM Spectrum (cont. 1)
Slide 24
Experiment 8.1 FM Spectrum (cont. 3)
Slide 24
Experiment 8.2 Demodulation by a Discriminator
Slide 25
Experiment 8.2 Discriminator (cont. 1)
Slide 26
Experiment 8.2 Discriminator (cont. 2)
Slide 27
Experiment 8.3 Demodulation by a PLL
Slide 28
Experiment 8.3 PLL (cont.)
Slide 1
Frequency Modulation (FM)
Slide 2
FM Signal Definition (cont.)
Slide 3
Discrete-Time FM Modulator
Slide 4
Single Tone FM Modulation
Slide 5
Single Tone FM (cont.)
Slide 6
Narrow Band FM
Slide 7
Bandwidth of an FM Signal
Slide 8
Demod. by a Frequency Discriminator
Slide 9
FM Discriminator (cont.)
Slide 10
Discriminator Using Pre-Envelope
Slide 11
Discriminator Using Pre-Envelope (cont.)
Slide 12
Discriminator Using Complex Envelope
Slide 13 Phase-Locked Loop Demodulator
Slide 14
PLL Analysis
Slide 15
PLL Analysis (cont. 1)
Slide 16
PLL Analysis (cont. 2)
Slide 17
Linearized Model for PLL
Slide 18
Proof PLL is a Demod for FM
Slide 19
Comments on PLL Performance
Slide 20
FM PLL vs. Costas Loop Bandwidth
Slide 21
Laboratory Experiments for FM
Slide 21
Experiment 8.1 Spectrum of an FM
Signal
Slide 22
Experiment 8.1 FM Spectrum (cont. 1)
Slide 23
Experiment 8.1 FM Spectrum (cont. 1)
Slide 24
Experiment 8.1 FM Spectrum (cont. 3)
Slide 24
Experiment 8.2 Demodulation by a Discriminator
Slide 25
Experiment 8.2 Discriminator (cont. 1)
Slide 26
Experiment 8.2 Discriminator (cont. 2)
Slide 27
Experiment 8.3 Demodulation by a PLL
Slide 28
Experiment 8.3 PLL (cont.)
Introduction to Angle Modulation, Types of Angle Modulation, Frequency Modulation and Phase Modulation Introduction, Generation of FM, Detection of FM, Frequency stereo Multiplexing, Applications, Difference between FM and PM.
In telecommunications and signal processing, frequency modulation (FM) is the encoding of information in a carrier wave by varying the instantaneous frequency of the wave. This contrasts with amplitude modulation, in which the amplitude of the carrier wave varies, while the frequency remains constant.
In analog frequency modulation, such as FM radio broadcasting of an audio signal representing voice or music, the instantaneous frequency deviation, the difference between the frequency of the carrier and its center frequency, is proportional to the modulating signal.
. Types of Modulation(Analog)
Phase-Frequency Relationships
FM and PM basics
Frequency deviation
MODULATION INDEX
Classification of FM
Narrow Band FM (NBFM)
generating a narrowband FM signal.
Wide Band FM (WBFM).
Carson’s Rule
Generation of WBFM
Average Power
FM BANDWIDTH
Comparing Frequency Modulation to Phase Modulation
Introduction to Angle Modulation, Types of Angle Modulation, Frequency Modulation and Phase Modulation Introduction, Generation of FM, Detection of FM, Frequency stereo Multiplexing, Applications, Difference between FM and PM.
In telecommunications and signal processing, frequency modulation (FM) is the encoding of information in a carrier wave by varying the instantaneous frequency of the wave. This contrasts with amplitude modulation, in which the amplitude of the carrier wave varies, while the frequency remains constant.
In analog frequency modulation, such as FM radio broadcasting of an audio signal representing voice or music, the instantaneous frequency deviation, the difference between the frequency of the carrier and its center frequency, is proportional to the modulating signal.
. Types of Modulation(Analog)
Phase-Frequency Relationships
FM and PM basics
Frequency deviation
MODULATION INDEX
Classification of FM
Narrow Band FM (NBFM)
generating a narrowband FM signal.
Wide Band FM (WBFM).
Carson’s Rule
Generation of WBFM
Average Power
FM BANDWIDTH
Comparing Frequency Modulation to Phase Modulation
Error Control and performance Analysis of MIMO-OFDM Over Fading ChannelsIOSR Journals
ABSTRACT: Multiple Input Multiple Output is a wireless technology that uses multiple transmitters and
receivers to transfer more data at the same time. Orthogonal Frequency Division Multiplexing, an FDM
modulation technique which splits the signal into multiple smaller sub-signals that are then transmitted
simultaneously at different frequencies to the receiver. OFDM technique spreads the data over number of
carriers which are at specific predefined frequencies. This reduces or eliminates the ISI. Forward error
correction or channel coding is a technique used for controlling errors in data transmission over unreliable or
noisy communication channels. The objective of our proposed paper is to implement the FEC into the MIMO
OFDM systems and its performance is analysed by using MATLAB over different fading channels. For
modulation it employs M-QAM which combines both ASK and PSK thereby enabling several bits to be
transmitted per symbol. The performance of MIMO-OFDM system is evaluated by BER Vs SNR when the bits
propagates through the different fading channels.
Keywords– OFDM, MIMO, QAM, FEC, BER.
In this slide fourier series of Engineering Mathematics has been described. one Example is also added for you. Hope this will help you understand fourier series.
Coin Changing, Binary Search , Linear Search - AlgorithmMd Sadequl Islam
Coin Changing, Binary Search , Linear Search. These three type of algorithm topic has been described in the slide. Hope this will help you understand these three topic.
The slide is all about Lalbagh Fort. Which is a historical place of bangladesh.Lalbagh Fort (also Fort Aurangabad) is an incomplete 17th century Mughal fort complex that stands before the Buriganga River in the southwestern part of Dhaka, Bangladesh
This is not too descriptive.If you know about phylogenetic tree and want to describe through picture then you can use this slide.And in this slide only types of phylogenetic tree is described which are rooted and unrooted.
Adjusting primitives for graph : SHORT REPORT / NOTESSubhajit Sahu
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
Opendatabay - Open Data Marketplace.pptxOpendatabay
Opendatabay.com unlocks the power of data for everyone. Open Data Marketplace fosters a collaborative hub for data enthusiasts to explore, share, and contribute to a vast collection of datasets.
First ever open hub for data enthusiasts to collaborate and innovate. A platform to explore, share, and contribute to a vast collection of datasets. Through robust quality control and innovative technologies like blockchain verification, opendatabay ensures the authenticity and reliability of datasets, empowering users to make data-driven decisions with confidence. Leverage cutting-edge AI technologies to enhance the data exploration, analysis, and discovery experience.
From intelligent search and recommendations to automated data productisation and quotation, Opendatabay AI-driven features streamline the data workflow. Finding the data you need shouldn't be a complex. Opendatabay simplifies the data acquisition process with an intuitive interface and robust search tools. Effortlessly explore, discover, and access the data you need, allowing you to focus on extracting valuable insights. Opendatabay breaks new ground with a dedicated, AI-generated, synthetic datasets.
Leverage these privacy-preserving datasets for training and testing AI models without compromising sensitive information. Opendatabay prioritizes transparency by providing detailed metadata, provenance information, and usage guidelines for each dataset, ensuring users have a comprehensive understanding of the data they're working with. By leveraging a powerful combination of distributed ledger technology and rigorous third-party audits Opendatabay ensures the authenticity and reliability of every dataset. Security is at the core of Opendatabay. Marketplace implements stringent security measures, including encryption, access controls, and regular vulnerability assessments, to safeguard your data and protect your privacy.
Explore our comprehensive data analysis project presentation on predicting product ad campaign performance. Learn how data-driven insights can optimize your marketing strategies and enhance campaign effectiveness. Perfect for professionals and students looking to understand the power of data analysis in advertising. for more details visit: https://bostoninstituteofanalytics.org/data-science-and-artificial-intelligence/
9. Error
What is Error :
Networks must be able to transfer data from one device to another with acceptable
accuracy. For most applications, a system must guarantee that the data received are
identical to the data transmitted. Any time data are transmitted from one node to the
next, they can become corrupted in passage. Many factors can alter one or more bits of
a message. Some applications require a mechanism for detecting and correcting errors.
10
10. Error
What is Error :
Data can be corrupted during transmission. Some applications require that errors be
detected and corrected.
Some applications can tolerate a small level of error. For example, random errors in
audio or video transmissions may be tolerable, but when we transfer text, we expect a
very high level of accuracy.
11
11. Types
Whenever bits flow from one point to another, they are subject to unpredictable
changes because of interference. This interference can change the shape of the
signal. In a single-bit error, a 0 is changed to a 1 or a 1 to a O. In a burst error,
multiple bits are changed. For example, a 11100 s burst of impulse noise on a
transmission with a data rate of 1200 bps might change all or some ofthe12 bits
of information.
12. Single-Bit Error
The term single-bit error means that only 1 bit of a given data unit (such as a byte,
character, or packet) is changed from 1 to 0 or from 0 to 1.
In a single-bit error, only 1 bit in the data unit has changed.
To understand the impact of the change, imagine that each group of8 bits is an
ASCII character with a 0 bit added to the left. 00000010 was sent, meaning start of
text, but 00001010 was received, meaning linefeed.
13. Single-Bit Error
Single-bit errors are the least likely type of error in serial data transmission. To
understand why, imagine data sent at 1Mbps. This means that each bit lasts only
1/1,000,000 s, or 1s. For a single-bit error to occur, the noise must have a duration
of only 1s , which is very rare; noise normally lasts much longer than this.
14. Burst Error
The term burst error means that 2 or more bits in the data unit have changed from
1to 0 or from 0 to 1.
A burst error means that 2 or more bits in the data unit have changed.
In this case, 0100010001000011 was sent, but 0101110101100011 was received.
Note that a burst error does not necessarily mean that the errors occur in
consecutive bits. The length of the burst is measured from the first corrupted bit to
the last corrupted bit. Some bits in between may not have been corrupted.
15. Burst Error
A burst error is more likely to occur than a single-bit error. The duration of noise is
normally longer than the duration of 1 bit, which means that when noise affects
data, it affects a set of bits. The number of bits affected depends on the data rate
and duration of noise. For example, if we are sending data at I kbps, noise can
affect 10 bits; if we are sending data at I Mbps, the same noise can affect 10,000
bits.
16. GSM
The Global System for Mobile Communication (GSM) is a European standard
that was developed to provide a common second-generation technology for all
Europe. The aim was to replace a number of incompatible first-generation
technologies.
Bands GSM uses two bands for duplex communication. Each band is 25 MHz in
width, shifted toward 900 MHz, as shown in Figure . Each band is divided into
124 channels of200 kHz separated by guard bands.
17. GSM
Transmission Figure 16.8 shows a GSM
system. Each voice channel is digitized
and compressed to a 13-kbps digital
signal. Each slot carries 156.25 bits (see
Figure ). Eight slots share a frame
(TDMA). Twenty-six frames also share a
multiframe (TDMA). We can calculate
the bit rate of each channel as follows:
18. Hamming Distance
The Hamming distance between two words is the number of differences between
corresponding bits.
One of the central concepts in coding for error control is the idea of the Hamming
distance. The Hamming distance between two words is the number of differences
between the corresponding bits. We show the Hamming distance between two
words x and y as d(x, y)
19. Hamming Distance
The Hamming distance can easily be found if we apply the XOR operation (ffi) on
the two words and count the number of Is in the result. Note that the Hamming
distance is a value greater than zero.
20. Minimum Hamming Distance
The minimum Hamming distance is the smallest Hamming distance between all
possible pairs in a set of words.
Although the concept of the Hamming distance is the central point in dealing with
error detection and correction codes, the measurement that is used for designing a
code is the minimum Hamming distance. In a set of words, the minimum Hamming
distance is the smallest Hamming distance between all possible pairs. We use d
min to define the minimum Hamming distance in a coding scheme. To find this
value, we find the Hamming distances between all words and select the smallest
one.
21. Conclusion
Phase modulation is similar in practice to frequency modulation (FM). ... But PM
and FM are not exactly equivalent, especially in analog applications. When an FM
receiver is used to demodulate a PM signal, or when an FM signal is intercepted by
a receiver designed for PM, the audio is distorted.
The Hamming distance is used to define some essential notions in coding theory,
such as error detecting and error correcting codes.
22. Conclusion
GSM (Global System for Mobile communication) is a digital mobile telephony
system that is widely used in Europe and other parts of the world. GSM uses a
variation of time division multiple access (TDMA) and is the most widely used of the
three digital wireless telephony technologies (TDMA, GSM, and CDMA).
Error coding is used for fault tolerant computing in computer memory, magnetic
and optical data storage media, satellite and deep space communications,
network communications, cellular telephone networks, and almost any other form
of digital data communication