Skip to content
naulon
Not checkedNot checked for notices yet.

Performance evaluation of wireless compressed‐image transmission over discrete Fourier transform‐based orthogonal frequency division multiple access system

Nagi H. Al‐Ashwal, Khaled A. Al soufy, Faisal S. Al‐Kamali and 1 more

The Journal of Engineering · 2022

doi:10.1049/tje2.12149 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract Orthogonal frequency division multiple access (OFDMA) has been attracting much attention in the recent generation of wireless communications to meet the required demands arising from the explosive growth of Internet, multimedia and broadband services. Currently, images transmission is one of the main parts of wireless communication. However, an image file transmission requires sending a large amount of data which consumes a huge bandwidth so that the image must be compressed to reduce the amount of information to be transmitted. The aim of this paper is to evaluate the wireless transmission of the compressed image over discrete Fourier transform (DFT)‐based OFDMA DFT‐OFDMA system for different compression methods, different modulation schemes and different subcarriers mapping schemes over three wireless channels including SUI3, vehicular A and uniform. The required minimum signal‐to‐noise ratio (SNR) to recover the transmitted compressed image is determined to evaluate the system performance. For the sake of diversity, nine compression techniques are used in this work. The MATLAB simulator is used to determine the required minimum SNR to recover the transmitted compressed image for each compression method. The results show that the performance of the set partitioning in hierarchical trees three‐dimensional for true colour images (SPIHT‐3D) method is nearly better than that of other compression methods, especially when the QPSK and interleaved system are considered.

Abstract licence: CC BY-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.