International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 2, Issue 12, December 2012)
Optimized Transmission of Images with OFDM over AWGN
Channel
Puneeth.S1, Dr. Fathima Jabeen2
1, 2
Department of Telecommunication and Engineering, C.M.R. Institute of Technology, Affiliated to VTU,
Bangalore-560 037, India.
Abstract-- This work proposes optimal image
transmission over coded Orthogonal Frequency Division
Multiplexing system with Low Density Parity Check
Coding. The DWT based Set Partitioning in Hierarchical
Trees algorithm is used for source coding of the images to
be transmitted. It improves the transmission efficiency for
progressive image transmission over Additive White
Gaussian Noise channel. Study Work and MATLAB
simulation results show that, gradual increase in visual
quality of reconstructed images and performance of the
PAPR of OFDM for different SPIHT rates.
Keywords-- AWGN, DWT, LDPC, OFDM, SPIHT .
I. INTRODUCTION
OFDM modulation has been adopted by several
wireless multimedia transmission standards, such as
Digital Audio Broadcasting and Digital Video
Broadcasting, because it provides a high degree of
immunity to multipath fading and impulsive noise. High
spectral efficiency and efficient modulation and
demodulation by IFFT/FFT is also advantages of OFDM.
It has broad application prospect in wireless image and
video communications.
One of the major problems is high PAPR of
transmitted OFDM signals. Therefore, the OFDM
receiver detection efficiency is very sensitive to the
nonlinear devices used in its signal processing loop, such
as Digital to Analog Converter and High Power
Amplifier (HPA), which may severely impair system
performance due to induced spectral regrowth and
detection efficiency degradation.
The SPIHT algorithm has been introduced by Said and
Pearlman. It is the algorithm based on the wavelet
transform, and restricts the necessity of random access to
the whole image to small sub images. The principle of
the SPIHT algorithm is partial ordering by magnitude
with a set partitioning sorting algorithm, ordered bit
plane transmission, and exploitation of self similarity
across different scales of an image wavelet transform.
The success of this algorithm is its compression
efficiency and simplicity against embedded wavelet
image coding.
SPIHT has a good rate-distortion performance for still
images with comparatively low complexity and it is
scalable LDPC codes was originally invented by Gallager
in 1963 and rediscovered by Mackay and Neal recently.
306
LDPC codes have attracted much attention particularly
in the field of coding theory. LDPC codes are a class of
linear block codes which provide a reliable transmission
for coding performance that is very close to the
Shannon's limit and can outperform Turbo codes at long
block length but with relatively low decoding
complexity. LDPC has been adopted as the DVB-S2
standard.
The combination of the OFDM modulation technique
and LDPC coding will be a good candidate for high
speed broadband wireless applications. The BER
performance of the Low Density Parity Check Coding-
Coded Orthogonal Frequency Division Multiplexing
system (LDPC-COFDM) is influenced by the
subchannels.
II. W AVELET T RANSFORMATION OF IMAGES
Wavelets are mathematical functions that decompose
data into different frequency components, and then study
each component with a resolution matched to its scale.
They have advantages over traditional Fourier methods in
analyzing physical situations where the signal contains
discontinuities and sharp spikes.
Wavelets were developed independently in the fields
of mathematics, quantum physics, electrical engineering,
and seismic geology. Interchanges between these fields
during the last ten years have led to many new wavelet
applications such as image compression, turbulence,
human vision, radar, and earthquake prediction.
LL1
HL1
LH1
HH1
HLL
Original
Image
LHL
HHL
Fig1: Wavelet Transform
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 2, Issue 12, December 2012)
The wavelet transformation is a mathematical tool for
decomposition. The wavelet transform is identical to a
hierarchical sub band filtering system, where the sub
bands are logarithmically spaced in frequency. The basic
idea of the DWT for a two-dimensional image is
described as follows. An image is first decomposed into
four parts based on frequency sub bands, by critically sub
sampling horizontal and vertical channels using sub band
filters and named as Low-Low (LL), Low-High (LH),
High- Low (HL), and High- High (HH) sub bands as
shown in figure 1. To obtain the next coarser scaled
wavelet coefficients, the sub band LL is further
decomposed and critically sub sampled. This process is
repeated several times, which is determined by the
application at hand. The block diagram of this process is
shown in figure 1. Each level has various bands
information such as low– low, low–high, high–low, and
high–high frequency bands.
Furthermore, from these DWT coefficients, the
original image can be reconstructed. This reconstruction
process is called the inverse DWT (IDWT). If C[m,n]
represents an image, the DWT and IDWT for C[m,n] can
similarly be defined by implementing the DWT and
IDWT on each dimension and separately.
III. T HE SPIHT ALGORITHM
The SPIHT image coding algorithm was developed in
1996 by Said and Pearlman and is another more efficient
implementation of the embedded zerotree wavelet (EZW)
algorithm by Shapiro. After the wavelet transform is
applied to an image, the main algorithm works by
partitioning the wavelet decomposed image into
significant and insignificant partitions based on the
following function:
Sn(T)= 1,max(I,j)€ T ci j ≥2n
0,otherwise
Where Sn(T), is the significance of a set of co-
ordinates T, and ci,j is the coefficient value at co-ordinate
(i,j).
The SPIHT algorithm consists of three stages:
initialization, sorting and refinement. It sorts the wavelet
coefficients into three ordered lists: the list of
insignificant sets (LIS), the List of Insignificant Pixels
(LIP), and the List of Significant Pixels (LSP). At the
initialization stage the SPIRT algorithm first defines a
start threshold based on the maximum value in the
wavelet pyramid, then sets the LSP as an empty list and
puts the coordinates of all coefficients in the coarsest
level of the wavelet pyramid into the LIP and those
which have descendants also into the LIS.
307
In the sorting pass, the algorithm first sorts the
elements of the LIP and then the sets with roots in the
LIS. For each pixel in the LIP it performs a significance
test against the current threshold and outputs the test
result to the output bit stream. All test results are encoded
as either 0 or 1, depending on the test outcome, so that
the SPIHT algorithm directly produces a binary bit
stream. If a coefficient is significant, its sign is coded and
its coordinate is moved to the LSP. During the sorting
pass of LIS, the SPIHT encoder carries out the
significance test for each set in the LIS and outputs the
significance information. If a set is significant, it is
partitioned into its offspring and leaves. Sorting and
partitioning are carried out until all significant
coefficients have been found and stored in the LSP.
After the sorting pass for all elements in the LIP and
LIS, SPIRT does a refinement pass with the current
threshold for all entries in the LSP, except those which
have been moved to the LSP during the last sorting pass.
Then the current threshold is divided by two and the
sorting and refinement stages are continued until a
predefined bit-budget is exhausted.
Fig.2, shows a spatial orientation tree. The tree is
defined in such a way that each node has either no
offspring (the leaves) or four offspring at the same spatial
location in the next finer sub band level. The pixels in the
lowest frequency subband-tree roots are grouped into
blocks of 2x2 adjacent pixels, and in each block one of
them as shown in Fig. 1; has no descendants. SPIHT
describes this collocation with one to four parent-children
relationships,
Parent = (i, j)
Children = [(2i, 2j), (2i + 1,2j), (2i, 2j + 1), (2i + 1,2j +
1)]
Fig. 2: Parent-children dependency and spatial orientation trees
across wavelet sub bands in SPIHT.
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 2, Issue 12, December 2012)
IV. LDPC-COFDM SYSTEM Where E[.] is the average power. Generally, the PAPR
The block diagram of the proposed LDPC-COFDM is considered for a single OFDM symbol, which has a
system is illustrated in Fig. 3. The SPIHT coder is chosen time duration T. This duration comprises a number of
as the source coding technique due to its flexibility of samples equal to (Nf+Ng), where Ng is the guard interval
code rate and simplicity of designing optimal system. length.
The SPIHT divides the image stream into several layers At the receiver, the guard interval is removed and the
according to the importance of progressive image stream. time interval [0,T] is evaluated. Afterwards, the OFDM
Then the image stream is converted to a binary format. demodulation is implemented by using a (FFT) then the
Afterwards the information bits are LDPC encoded at the Parallel-to-Serial conversion is implemented. This
LDPC encoder. The OFDM utilizes N frequency tones received OFDM symbols are demodulated at the
(number of subcarriers) hence the baseband data is first demodulator. The demodulated bits are decoded with
converted into parallel data of N subchannels so that each each LDPC encoded block and data bits are restored.
bit of a codeword is on different subcarrier. The N These data are converted into image format, such that
subcarriers are chosen to be orthogonal, that is f n = n∆f SPIHT decoder can be obtained.
where ∆f =1/ T and T is the OFDM symbol duration.
Then, the transmitted data of each parallel subchannel is V. S IMULATION RESULTS
modulated by Binary phase Shift Keying (BPSK) MATLAB Simulation experiments are carried out to
modulation because it provides high throughput and best study the transmission of SPIHT coded images on LDPC
performance when combined with the OFDM. Finally, COFDM modified by Trigonometric transforms over A
the modulated data are fed into an IFFT circuit, such that WGN channel. The input image is 8 bits per pixel,
the OFDM signal is generated. The resulting OFDM grayscale test image, 'Cameraman' from MATLAB
signal can be expressed as follows: toolbox has a resolution 256x256 pixels. The fidelity of it
was measured by the Peak Signal-to-Noise Ratio, PSNR,
x (t) = x[n]=1/√N∑n=0 N-1 Xn e j2∏f n t which usually expressed in terms of the logarithmic
,0≤t≤T scale. It can be defined as follows:
Xn discrete time sample PSNR = 10log10( Peak2/MSE )
Where, MSE is the mean squared error between the
X[n ] x(n) original and the reconstructed image, and Peak is the
maximum possible magnitude for a pixel inside the
Origin DWT- LDPC OFD image. The peak value is 255 for an 8 bits/pixel of
original image.
al SPIHT Enco M- Simulation of the complementary cumulative
image compre der Tx distribution function (CCDF) curves for the proposed
ssion DAC SPIHT LDPC COFDM It is defined as the probability
that the signal is at or higher than a given amplitude
chan PAPR. Fig. 4(a,b) shows the CCDFs of the PAPR for the
proposed schemes at different SPIHT rates: 0.5 and 1
nel respectively. Better PAPR can be achieved further by
ADC increasing the value of SPIHT rate.
X[n] x(n)
The effect of the SPIHT compression ratios on the
Recont DWT- LDPC OFD PSNR compared them with the OFDM system without
ed SPIHT Deco M- LDPC are shown in Fig.5.

image Decompr der Rx

ession
Fig:3 LDPC-COFDM System

Each data block is padded with a cyclic prefix of a

length longer than channel impulse response to mitigate
the Inter-Block Interference. The continuous COFDM
signal Xg (t) is generated at the output of the digital to
analog converter. PAPR of transmitted analog signal can
be expressed as
PAPR=max| Xg (t) |2/E [|Xg (t)| 2]
(a)

308
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 2, Issue 12, December 2012)
VI. CONCLUSION
The effectiveness of the system is investigated through
simulations over AWGN channel. This work shows the
performance of the system model using 256x256
grayscale images.
The Project can be extended to video coding using 3-D
SPIHT coding.
REFERENCES
[1 ] Said, Amir; Pearlman, William A. (June 1996). "A new fast and
(b) efficient image codec based on set partitioning in hierarchical
trees". IEEE Transactions on Circuits and Systems for Video
Fig: 4 CCDF of the PAPR for the LDPC COFDM Technology
[2 ] LDPC Codes – a brief Tutorial Bernhard M.J. Leiner, Stud.ID.:
53418L bleiner@gmail.com April 8, 2005
[3 ] Color Image Compression using SPIHT
Algorithm,Sadashivappa,Mahesh Jayakar K.V.S Anand Babu
[4 ] Dwt-Spiht Image Codec Implementation J. Malý, P. Rajmic,
Department of Telecommunications, Brno University of
Technology, Brno, Czech Republic
[5 ] Serbian Journal Of Electrical Engineering,Vol. 5, No.2,
November 2008, 353-360353, Robust Image Transmission
Performed by SPIHT and Turbo-Codes Abdelmounaim Moulay
Lakhdar1, Rachida Méliani2, Malika Kandouci2
[6 ] S. Wang, J. Dai, C. Hou and X. Liu " Progressive Image
Transmission over Wavelet Packet Based OFDM", Proceedings in
Electrical and Computer Engineering 2006 Canadian Conference
Conference, pp. 950 - 953,2006.

Fig 5: The relation between the PSNR and the rate of SPIHT
compression ratio on A WGN channel.

309