Performance analysis of wireless compressed-image transmission over DST-based OFDMA systems
Bibliographic record
Abstract
Abstract Multimedia data, like images, consumes significant bandwidth when transmitted over wireless systems. Therefore, compressing transmitted images becomes crucial to reduce the required bandwidth and improve energy efficiency. This work aims to analyze the performance of transmitting wireless compressed images over a recent Discrete Sine Transform (DST)-Based Orthogonal Frequency Division Multiple Access (DST-OFDMA) system. It investigates the effectiveness of several image compression methods by determining the minimum Signal-to-Noise Ratio (SNR) required for each method to achieve error-free image recovery at the receiver. This work considers different modulation schemes including 16QAM and QPSK, as well as different subcarrier mapping schemes (localized and interleaved) over vehicular A, SUI3, and uniform channels. Nine standard compression methods are used for analyzing the performance of the DST-OFDMA system and compared it with that of the conventional Discrete Fourier Transform (DFT)-based OFDMA (DFT-OFDMA) system. The results show that the performance of DST-OFDMA outperforms that of DFT-OFDMA, especially when QPSK modulation is used. Simulation results demonstrate that the interleaved DST-OFDMA (DST-IOFDMA) system, employing the SPIHT_3D compression method and QPSK modulation (over the SUI3 channel model), achieves the lowest SNR value required for compressed image recovery, approximately 18 dB. This indicates that the SPIHT_3D compression method exhibits lower power consumption compared to other methods as well as high bandwidth efficiency.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".