scholarly journals On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 605
Author(s):  
Elad Romanov ◽  
Or Ordentlich

Motivated by applications in unsourced random access, this paper develops a novel scheme for the problem of compressed sensing of binary signals. In this problem, the goal is to design a sensing matrix A and a recovery algorithm, such that the sparse binary vector x can be recovered reliably from the measurements y=Ax+σz, where z is additive white Gaussian noise. We propose to design A as a parity check matrix of a low-density parity-check code (LDPC) and to recover x from the measurements y using a Markov chain Monte Carlo algorithm, which runs relatively fast due to the sparse structure of A. The performance of our scheme is comparable to state-of-the-art schemes, which use dense sensing matrices, while enjoying the advantages of using a sparse sensing matrix.

2013 ◽  
Vol 427-429 ◽  
pp. 1518-1523
Author(s):  
Jing Xi Zhang

The optimization of degree profiles of low-density parity-check (LDPC) code in additive white Gaussian noise (AWGN) multiple access channel (MAC) by fitting the transfer characteristics of variable nodes detector (VND) and that of check nodes detector (CND) is discussed. Extrinsic information transfer (EXIT) characteristics are used for determining the degree profiles based on curve fitting. The convergence the optimized LDPC code is ensured by the EXIT characteristics of VND and CND. Degree profiles are obtained and check matrix is constructed. Simulation results show that the method is variable in designing LDPC code degree profiles in MAC with reduced complexity compared with density evolution based on Gaussian approximation.


Author(s):  
Puneeth K M ◽  
Poornima M S

The basic idea of 5th generation New Radio (5GNR) is to have very high data rate and to make it work efficiently for all Internet of Things (IOT) applications like healthcare, Automotive, Industrial etc. applications. This paper provides the Orthogonal Frequency Division Multiple Access (OFDM) baseband signal generation and detection method for Physical Random-Access Channel (PRACH). The proposed model provides four scenarios of preamble detection i.e., Preamble detection probability, Miss-detection probability, False alarm probability and null. We achieved the target of 99% of Probability of Detection and less than 0.1% of False-alarm probability at certain SNR as specified according to 3gpp standard requirements when tested in Additive White Gaussian Noise (AWGN) channel and Extended Typical Urban (ETU) channel.


2018 ◽  
Vol 8 (2) ◽  
pp. 343-375 ◽  
Author(s):  
Sajjad Beygi ◽  
Shirin Jalali ◽  
Arian Maleki ◽  
Urbashi Mitra

Abstract Modern image and video compression codes employ elaborate structures in an effort to encode them using a small number of bits. Compressed sensing (CS) recovery algorithms, on the other hand, use such structures to recover the signals from a few linear observations. Despite the steady progress in the field of CS, the structures that are often used for signal recovery are still much simpler than those employed by state-of-the-art compression codes. The main goal of this paper is to bridge this gap by answering the following question: can one employ a compression code to build an efficient (polynomial time) CS recovery algorithm? In response to this question, the compression-based gradient descent (C-GD) algorithm is proposed. C-GD, which is a low-complexity iterative algorithm, is able to employ a generic compression code for CS and therefore enlarges the set of structures used in CS to those used by compression codes. Three theoretical contributions are provided: a convergence analysis of C-GD, a characterization of the required number of samples as a function of the rate-distortion function of the compression code and a robustness analysis of C-GD to additive white Gaussian noise and other non-idealities in the measurement process. Finally, the presented simulation results show that, in image CS, using compression codes such as JPEG2000, C-GD outperforms state-of-the-art methods, on average, by about $2$–$3$ dB in peak signal-to-noise ratio.


Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 508
Author(s):  
Alaa Omran Almagrabi ◽  
Rashid Ali ◽  
Daniyal Alghazzawi ◽  
Abdullah AlBarakati ◽  
Tahir Khurshaid

The 5th generation (5G) wireless networks propose to address a variety of usage scenarios, such as enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable low-latency communications (URLLC). Due to the exponential increase in the user equipment (UE) devices of wireless communication technologies, 5G and beyond networks (B5G) expect to support far higher user density and far lower latency than currently deployed cellular technologies, like long-term evolution-Advanced (LTE-A). However, one of the critical challenges for B5G is finding a clever way for various channel access mechanisms to maintain dense UE deployments. Random access channel (RACH) is a mandatory procedure for the UEs to connect with the evolved node B (eNB). The performance of the RACH directly affects the performance of the entire network. Currently, RACH uses a uniform distribution-based (UD) random access to prevent a possible network collision among multiple UEs attempting to access channel resources. However, in a UD-based channel access, every UE has an equal chance to choose a similar contention preamble close to the expected value, which causes an increase in the collision among the UEs. Therefore, in this paper, we propose a Poisson process-based RACH (2PRACH) alternative to a UD-based RACH. A Poisson process-based distribution, such as exponential distribution, disperses the random preambles between two bounds in a Poisson point method, where random variables occur continuously and independently with a constant parametric rate. In this way, our proposed 2PRACH approach distributes the UEs in a probability distribution of a parametric collection. Simulation results show that the shift of RACH from UD-based channel access to a Poisson process-based distribution enhances the reliability and lowers the network’s latency.


IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 21425-21432
Author(s):  
Lei Shi ◽  
Gangrong Qu ◽  
Qian Wang

2013 ◽  
Vol 475-476 ◽  
pp. 451-454
Author(s):  
Xue Ming Zhai ◽  
Xiao Bo You ◽  
Ruo Chen Li ◽  
Yu Jia Zhai ◽  
De Wen Wang

Insulator fault may lead to the accident of power network,thus the on-line monitoring of insulator is very significant. Low rates wireless network is used for data transmission of leakage current. Making data compression and reconstruction of leakage current with the compressed sensing theory can achieve pretty good results. Determination of measurement matrix is the significant step for realizing the compressed sensing theory. This paper compares multiple measurement matrix of their effect via experiments, putting forward to make data compression and reconstruction of leakage current using Toeplitz matrix, circulant matrix and sparse matrix as measurement matrix, of which the reconstitution effect is almost the same as classical measurement matrix and depletes computational complexity and workload.


Sign in / Sign up

Export Citation Format

Share Document