Compressive sensing allows the reconstruction of original signals from a much smaller number of samples as compared to the Nyquist sampling rate. The effectiveness of compressive sensing motivated the researchers for its deployment in a variety of application areas. The use of an efficient sampling matrix for high-performance recovery algorithms improves the performance of the compressive sensing framework significantly. This paper presents the underlying concepts of compressive sensing as well as previous work done in targeted domains in accordance with the various application areas. To develop prospects within the available functional blocks of compressive sensing frameworks, a diverse range of application areas are investigated. The three fundamental elements of a compressive sensing framework (signal sparsity, subsampling, and reconstruction) are thoroughly reviewed in this work by becoming acquainted with the key research gaps previously identified by the research community. Similarly, the basic mathematical formulation is used to outline some primary performance evaluation metrics for 1D and 2D compressive sensing.

The exponential growth of wireless users and bandwidth constraints necessitates innovative communication paradigms for next-generation networks. Semantic Communication (SemCom) emerges as a promising solution by transmitting extracted meaning rather than raw bits, enhancing spectral efficiency and enabling intelligent resource allocation. This paper explores the integration of SemCom with conventional Bit-based Communication (BitCom) in heterogeneous networks, highlighting key challenges and opportunities. We analyze multiple access techniques, including Non-Orthogonal Multiple Access (NOMA), to support coexisting SemCom and BitCom users. Furthermore, we examine multi-modal SemCom frameworks for handling diverse data types and discuss their applications in satellite networks, where semantic techniques mitigate bandwidth limitations and harsh channel conditions. Finally, we identify future directions for deploying semantic-aware systems in 6G and beyond.

This article proposes and compares the performance of three flexible and bandwidth efficient transceivers. The terminology of Over-Complete Mapping (OCM) is introduced in the first two schemes. All of the schemes, namely Non-Convergent Serial Concatenated OCM Coding (NCSCOC), Convergent Serial Concatenated OCM Coding (CSCOC) and Self-Concatenated Convolutional Coding (SECCC); are simulated for the Rayleigh channel and employing iterative decoding to attain the refined output stream for feeding the video decoder. Specifically, the iterative decoding is beneficial in acquiring the convergence of EXtrinsic Information Transfer (EXIT) curves by repeatedly sharing of the mutual information. The difference between the NCSCOC and CSCOC schemes lies in the inner and outer rates. This change reflects an improvement in the Bit-Error Rate (BER) and improved EXIT convergence of CSCOC scheme, with reference to NCSCOC scheme. Results show that NCSCOC scheme never reaches the point of perfect convergence despite iterative decoding. However, CSCOC and SECCC schemes succeed in securing perfect convergence. Investigating the BER curves, it is deducible that SECCC is the most desirable transceiver system, having the least BER. Furthermore, it is plausible that the overall performance of SECCC is much better than the preceding schemes. Explicitly, our experimental results show that the proposed CSCOC scheme outperforms its identical code rate counterpart NCSCOC scheme by about 3 dB at the Peak Signal-to-Noise Ratio (PSNR) degradation point of 1 dB. Additionally, an E _b /N ₀ gain of 20 dB is attained using SECCC scheme relative to identical code rate NCSCOC benchmarked scheme.

Futuristic requirements of mobile communication systems ask for discovering new possibilities and dimensions to enable ultrafast and reliable communication. This work relates to the advancements in jointly decoded iterative multimedia communication systems for the H.264 source standard. The beneficial technique of Over-Complete Mapping (OCM) is utilized for introducing redundancy in the highly compressed source encoded video streams. Differential Space–Time Spreading (DSTS) is invoked along with Rate-3/4 Recursive Systematic Convolutional (RSC) as intermediate encoder in the proposed three-stage setup. More specifically, the RSC encoder is beneficial in attaining the iterative gain as it divides the decoder into two parts. The DSTS is invoked with the Sphere Packing (SP) modulation which is highly desirable for the non-coherent detection schemes without requiring any information from the channel. The proposed system comprises of three main components, namely OCM, Rate-3/4 RSC and SP modules, thus we call this as three-stage system. The iterative decoding enhances the Bit-Error Rate (BER) and Peak Signal-to-Noise Ratio (PSNR) performances of the joint source-channel systems. Furthermore, to expeditiously predict the convergence pattern of the proposed three-stage iteratively decoded systems, EXtrinsic Information Transfer (EXIT) chart analysis is performed. Moreover, the effect of variations in the minimum Hamming distance ( $${d}_{H,min}$$ d H , m i n ) is observed for the proposed three-stage system. The $${{DSTS}-{SP}-{RSC}-{OCM}}_{[5 15]}$$ DSTS - SP - RSC - OCM [ 515 ] having $${d}_{H,min}=6$$ d H , m i n = 6 exhibits a gain of 20 dB against the benchmarker $${{DSTS}-{SP}-{RSC}-{OCM}}_{[2 6]}^{*}$$ DSTS - SP - RSC - OCM [ 26 ] ∗ with $${d}_{H,min}=1$$ d H , m i n = 1 at the PSNR degradation point of 1 dB over a correlated Rayleigh fading channel.

The widespread development in wireless technologies and the advancements in multimedia communication have brought about a positive impact on the performance of wireless transceivers. We investigate the performance of our three-stage turbo detected system using state-of-the-art high efficiency video coding (HEVC), also known as the H.265 video standard. The system makes use of sphere packing (SP) modulation with the combinational gain technique of layered steered space-time code (LSSTC). The proposed three-stage system is simulated for the correlated Rayleigh fading channel and the bit-error rate (BER) curve obtained after simulation is free of any floor formation. The system employs low complexity source-bit coding (SBC) for protecting the H.265 coded stream. An intermediate recursive unity-rate code (URC) with an infinite impulse response is employed as an inner precoder. More specifically, the URC assists in the prevention of the BER floor by distributing the information across the decoders. There is an observable gain in the BER and peak signal-to-noise ratio (PSNR) performances with the increasing value of minimum Hamming distance ($d_{H,\min }$) using the three-stage system. Convergence analysis of the proposed system is investigated through an extrinsic information transfer (EXIT) chart. Our proposed system demonstrates better performance of about 22 dB than the benchmarker utilizing LSSTC-SP for iterative source-channel detection, but without exploiting the optimized SBC schemes.

With the substantial growth in number of wireless devices, future communication demands overarching research to design high‐throughput and efficient systems. We propose an intelligent Convergent Source Mapping (CSM) approach incorporating Differential Space‐Time Spreading (DSTS) technique with Sphere Packing (SP) modulation. The crux of CSM process is assured convergence by attaining an infinitesimal Bit‐Error Rate (BER). Data Partitioning (DP) H.264 video codec is deployed to gauge the performance of our intelligent and efficient system. For the purpose of efficient and higher data rates, we have incorporated compression efficient source encoding along with error resiliency and transmission robustness features. The proposed system follows the concept of iterations between the Soft‐Bit Source‐Decoder (SBSD) and Recursive Systematic Convolutional (RSC) decoder. Simulations of the DSTS‐SP‐assisted CSM system are presented for the correlated narrowband Rayleigh channel, using different CSM rates but constant overall bit‐rate budget. The SP‐assisted DSTS systems are mainly useful in decoding algorithms that operate without requiring Channel State Information (CSI). The effects of incorporating redundancy via different CSM schemes on the attainable performance and convergence of the proposed system are investigated using EXtrinsic Information Transfer (EXIT) charts. The effectiveness of the proposed system is demonstrated through IT++ based proof‐of‐concept simulations. The Peak Signal‐to‐Noise Ratio (PSNR) analysis shows that using Rate‐2/6 CSM with minimum Hamming distance (d_H,min) of 4 offers about 5 dB gain, compared to an identical overall system code rate but with Rate‐2/3 CSM and d_H,min of 2. Furthermore, for a consistent value of d_H,min and overall rate, the Rate‐2/3 CSM scheme beats the Rate‐5/6 CSM by about 2 dB at the PSNR degradation point of 2 dB. Moreover, the proposed system with Rate‐2/3 CSM scheme furnishes an E_b/N₀ gain of 20 dB when compared with the uniform‐rate benchmarker. Clearly, we can say that higher d_H,min and lower CSM values are favourable for our proposed setup.