Professional Documents
Culture Documents
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 2, Issue 12, December 2012)
306
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 In the sorting pass, the algorithm first sorts the
decomposition. The wavelet transform is identical to a elements of the LIP and then the sets with roots in the
hierarchical sub band filtering system, where the sub LIS. For each pixel in the LIP it performs a significance
bands are logarithmically spaced in frequency. The basic test against the current threshold and outputs the test
idea of the DWT for a two-dimensional image is result to the output bit stream. All test results are encoded
described as follows. An image is first decomposed into as either 0 or 1, depending on the test outcome, so that
four parts based on frequency sub bands, by critically sub the SPIHT algorithm directly produces a binary bit
sampling horizontal and vertical channels using sub band stream. If a coefficient is significant, its sign is coded and
filters and named as Low-Low (LL), Low-High (LH), its coordinate is moved to the LSP. During the sorting
High- Low (HL), and High- High (HH) sub bands as pass of LIS, the SPIHT encoder carries out the
shown in figure 1. To obtain the next coarser scaled significance test for each set in the LIS and outputs the
wavelet coefficients, the sub band LL is further significance information. If a set is significant, it is
decomposed and critically sub sampled. This process is partitioned into its offspring and leaves. Sorting and
repeated several times, which is determined by the partitioning are carried out until all significant
application at hand. The block diagram of this process is coefficients have been found and stored in the LSP.
shown in figure 1. Each level has various bands After the sorting pass for all elements in the LIP and
information such as low– low, low–high, high–low, and LIS, SPIRT does a refinement pass with the current
high–high frequency bands. threshold for all entries in the LSP, except those which
Furthermore, from these DWT coefficients, the have been moved to the LSP during the last sorting pass.
original image can be reconstructed. This reconstruction Then the current threshold is divided by two and the
process is called the inverse DWT (IDWT). If C[m,n] sorting and refinement stages are continued until a
represents an image, the DWT and IDWT for C[m,n] can predefined bit-budget is exhausted.
similarly be defined by implementing the DWT and Fig.2, shows a spatial orientation tree. The tree is
IDWT on each dimension and separately. defined in such a way that each node has either no
offspring (the leaves) or four offspring at the same spatial
III. T HE SPIHT ALGORITHM location in the next finer sub band level. The pixels in the
The SPIHT image coding algorithm was developed in lowest frequency subband-tree roots are grouped into
1996 by Said and Pearlman and is another more efficient blocks of 2x2 adjacent pixels, and in each block one of
implementation of the embedded zerotree wavelet (EZW) them as shown in Fig. 1; has no descendants. SPIHT
algorithm by Shapiro. After the wavelet transform is describes this collocation with one to four parent-children
applied to an image, the main algorithm works by relationships,
partitioning the wavelet decomposed image into Parent = (i, j)
significant and insignificant partitions based on the Children = [(2i, 2j), (2i + 1,2j), (2i, 2j + 1), (2i + 1,2j +
following function: 1)]
0,otherwise
307
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.
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