Communication-Signal Analysis
Communication-Signal Analysis
University Technical
College of Engineering
Communication
Department
Communication Principles
Signal Analysis
References ………………………………………………………………………………………(12)
Introduction to Signal Analysis:
Signals are signs or values that appear in some order, and from science, technology, culture and life they
are recognizable entities. Examples fit some categories easily: Emissions from far quasars on radio
frequencies; telegraph, telephone and Television broadcasts; people talking to each other, using hand
gestures; raising a set of flags on the mast of a ship; echolocation chirping of animals such as bats and
dolphins; muscle nerve impulses; and sensation of light patterns entering the eye.
Signal analysis is of considerable significance in the theory and design of communication systems and
circuits. We use the results of the mathematical analysis to predict and understand the electronic
systems and circuit behavior. The most growing representation of the waveforms and signals is in the
time domain. However, most techniques for analyzing the signal function only in the frequency domain.
We have such analysis for signals in a mathematical form of integral and differential types in
communication systems and circuits to understand from the various types of signals as we are going to
describe some of them in this report with their properties and their advantages, which they are Fourier
series and its types with an example of each of them and Fourier Transform with an example and its
properties, also we will describe two theorems, convolution and parseval’s theorem that are also used
for analyzing signals.
Representation of the Fourier series for periodic signals, and transformation of Fourier (Fourier
transform) for general periodic and non-periodic signals …
Fourier series and Fourier Transform defined for periodic signals. Periodic signals repeats themselves
over time and given by property x (t+To) = x(t) for all values of To.
One of the most important results of Fourier 's theory is the convolution theorem (together with related
theorems as parseval’s theorem ) which is that the convolution of two functions in real space is the
same as the product of their respective Fourier transformations in Fourier space , i.e .
Fourier series:
The Fourier series describes an infinite sequence of periodic functions in terms of the trigonometric sine
and cosine equations.
Fourier series is a very powerful method for solving ordinary and partial differential equations especially
with the appearance of periodic functions as non-homogeneous terms. Fourier series is not only
possible for continuous functions but also for periodic functions, discontinuous functions in their values
and derivatives. Furthermore, Fourier series constructed for one period is valid for all values because of
its periodic nature. Harmonic analysis is the theory of functions increasing in the Fourier series.
The generalized Fourier series developed earlier can be used to study both the complex and the
trigonometric Fourier series of a periodic function xT(t) with period of T seconds. The functions ejnwot,
sin(nwot), and cos(nwot) are nice functions in the sense that all the derivatives of these functions exist.
Approximation of a given function by the Fourier series (F-series) gives a smooth function series even
when the function being approximated has discontinuities.
We have three facts of Fourier series functions for analyzing signals that they are:
Trigonometric Fourier series.
Compact Trigonometric Fourier series.
Exponential Fourier series.
The compact trigonometric Fourier series of a periodic signal g(t) is given by:
Exponential Fourier series:
The main result from the Fourier series analysis is that an arbitrary periodic signal can approximate by
summing individual cosine terms with specified amplitudes and phases. This result serves as much of the
conceptual and theoretical framework for the field of signal analysis. In practice, the Fourier series is a
useful tool for modeling various types of quasi-periodic signals.
An alternative and somewhat more convenient form of this result is obtained by noting that complex
exponential functions are directly related to sinusoids and cosines through Euler's identities:
By applying Euler's identity to the compact trigonometric Fourier series, an arbitrary periodic signal can
be expressed as a sum of complex exponential functions:
This equation represents the exponential Fourier series of a periodic signal. The coefficient cm are
complex numbers that are related to the trigonometric Fourier coefficients
The proof for this result is beyond the scope of this text, but it is important to realize that the
trigonometric and exponential Fourier series are intimately related, as can be seen by comparing their
coefficients. The exponential coefficients can also be obtained directly by integrating x(t),
______ (1)
Over one cycle of the periodic signal. As for the trigonometric Fourier series, the exponential form
allows us to approximate a periodic signal to any degree of accuracy by adding a sufficient number of
complex exponential functions. A distinct advantage of the exponential Fourier series, however, is that it
requires only a single integral (Eq. (1)), compared to the trigonometric form, which requires three
separate integrations.
Fourier Transform:
The Fourier transform is a frequency-dependent function, an extension of non-periodic functions of the
Fourier series.
It represents a signal's spectral content — specifically, it's the frequency domain representation of a
signal.
- The function X (f) is the Fourier transform of x (t).
- X (f) describes the spectral content of x (t).
Properties of Fourier Transform:
We have such properties and theorems of Fourier Transform for analyzing signals; we will describe
tough types of them.
1. Linearity property.
The Fourier Transform is a linear function. In other
words, if X1(f) =F{x1(t)} et X2(f) = F{x2(t)}, then for x3(t)
3. Frequency shifting
If X(f) = F-{x(t)}, then X(f-fo) = F{x(t) 𝑒 −𝑗2𝜋𝑓𝑡𝑜 }
If we take an example:
4. Dilation property
5. Duality property
The Fourier Transformation of the g(t) and h(t) convolution [with corresponding Fourier Transforms
G(f) and H(f)] shall be provided by:
Convolution Theorem:
The theorem of convolution is a basic property of the Fourier transformation. It is also described as:
"Time domain convolution is equivalent to frequency domain multiplication."
Two-signal convolution is a fundamental operation in signal processing. Mainly because the output of
any linear time-invariant (LTI) system is given by the convolution with the input signal of its impulse
response.
Another important application of convolution is the theorem of convolution which states that time-
domain multiplication corresponds to frequency domain convolution, and vice versa.as we described
before…
Parseval’s Theorem:
The average power P of a periodic signal x (t) over any period T is represented by the complex
exponential Fourier series as
For example:
The Fourier series is useful in expanding the periodic functions since there is a periodic
extension of the function outside the closed interval.
Fourier series expansion of an oscillating function gives all modes of oscillation (fundamental
and all overtones) which is extremely useful in physics.
The term by term integration of a convergent Fourier series is always valid, and if the series is
not convergent, it may be valid. However, in most cases, term by term, differentiation from a
Fourier series is not valid.
Fourier series may reflect discontinuous function. Even though there are no derivatives of the
discontinuous functions. (This is not true regarding series Taylor).
Fourier series of a discontinuous function is not uniformly convergent at all points.
For Fourier Transform:
The main advantage of Fourier’s analysis is that very little information is lost during the
transformation from its signal; this method of analysis is also fairly resistant to noise, making it
very useful for bat signals analysis.
The Fourier transform preserves amplitude, harmonics, and phase information and uses all parts
of the waveform to convert the signal into the frequency domain.
Power spectra and spectrograms do not provide information about phases. Fourier analysis does
not rely on arbitrary thresholds; therefore, it is easy to calculate the frequency and time
resolution, allowing direct comparisons with other studies.
Comparison between exponential Fourier series and Fourier Transform:
We are now more familiar with the exponential series Fourier and Fourier Transform. What's the
difference, then?
In short, exponential Fourier series is for periodic signals while Fourier transform is for aperiodic
signals. Fourier series is used to decompose signals into basis elements while Fourier transforms
are used to analyze signal in another domain.
The exponential Fourier series is used by a discrete sum of complex exponentials to represent a
periodic function, while the Fourier transformation is then used by a continuous superposition
or integral of complex exponentials to represent a general, non-periodic function.
Fourier Transform is actually more “physically real” because any real world signal MUST have
finite energy, and must therefore be aperiodic. While Fourier series is applicable only to periodic
signals, which has infinite signal energy.
The main difference between the two is that for Fourier Series, since the signal is periodic,
frequency components are discrete and are INTEGRAL MULTIPLE of a base frequency known as
the fundamental frequency fo. fo is 1/To, where To is the periodicity of the signal (i.e. period of
repetition).
However, it turns out that Fourier series is most useful when using computers to process signals;
Discrete Fourier Transform is based on Fourier series especially exponential Fourier series.
References
Bracewell, R.N., The Fourier Transform, 2nd ed., New York: McGraw-Hill, 1986.
Haykin, S., & Moher, M.(2007). An introduction to Digital and Analog communication(FT),
2nd Edition, Inte. John Wiley & Sons.