arXiv daily

Information Theory (cs.IT)

Mon, 05 Jun 2023

Other arXiv digests in this category:Thu, 14 Sep 2023; Wed, 13 Sep 2023; Tue, 12 Sep 2023; Mon, 11 Sep 2023; Fri, 08 Sep 2023; Tue, 05 Sep 2023; Fri, 01 Sep 2023; Thu, 31 Aug 2023; Wed, 30 Aug 2023; Tue, 29 Aug 2023; Mon, 28 Aug 2023; Fri, 25 Aug 2023; Thu, 24 Aug 2023; Wed, 23 Aug 2023; Tue, 22 Aug 2023; Mon, 21 Aug 2023; Fri, 18 Aug 2023; Thu, 17 Aug 2023; Wed, 16 Aug 2023; Tue, 15 Aug 2023; Mon, 14 Aug 2023; Fri, 11 Aug 2023; Thu, 10 Aug 2023; Wed, 09 Aug 2023; Tue, 08 Aug 2023; Mon, 07 Aug 2023; Fri, 04 Aug 2023; Thu, 03 Aug 2023; Wed, 02 Aug 2023; Tue, 01 Aug 2023; Mon, 31 Jul 2023; Fri, 28 Jul 2023; Thu, 27 Jul 2023; Wed, 26 Jul 2023; Tue, 25 Jul 2023; Mon, 24 Jul 2023; Fri, 21 Jul 2023; Thu, 20 Jul 2023; Wed, 19 Jul 2023; Tue, 18 Jul 2023; Mon, 17 Jul 2023; Fri, 14 Jul 2023; Thu, 13 Jul 2023; Wed, 12 Jul 2023; Tue, 11 Jul 2023; Mon, 10 Jul 2023; Fri, 07 Jul 2023; Thu, 06 Jul 2023; Wed, 05 Jul 2023; Tue, 04 Jul 2023; Mon, 03 Jul 2023; Fri, 30 Jun 2023; Thu, 29 Jun 2023; Wed, 28 Jun 2023; Tue, 27 Jun 2023; Mon, 26 Jun 2023; Fri, 23 Jun 2023; Thu, 22 Jun 2023; Wed, 21 Jun 2023; Tue, 20 Jun 2023; Fri, 16 Jun 2023; Thu, 15 Jun 2023; Tue, 13 Jun 2023; Mon, 12 Jun 2023; Fri, 09 Jun 2023; Thu, 08 Jun 2023; Wed, 07 Jun 2023; Tue, 06 Jun 2023; Fri, 02 Jun 2023; Thu, 01 Jun 2023; Wed, 31 May 2023; Tue, 30 May 2023; Mon, 29 May 2023; Fri, 26 May 2023; Thu, 25 May 2023; Wed, 24 May 2023; Tue, 23 May 2023; Mon, 22 May 2023; Fri, 19 May 2023; Thu, 18 May 2023; Wed, 17 May 2023; Tue, 16 May 2023; Mon, 15 May 2023; Fri, 12 May 2023; Thu, 11 May 2023; Wed, 10 May 2023; Tue, 09 May 2023; Mon, 08 May 2023; Fri, 05 May 2023; Thu, 04 May 2023; Wed, 03 May 2023; Tue, 02 May 2023; Mon, 01 May 2023; Fri, 28 Apr 2023; Thu, 27 Apr 2023; Wed, 26 Apr 2023; Tue, 25 Apr 2023; Mon, 24 Apr 2023; Fri, 21 Apr 2023; Thu, 20 Apr 2023; Wed, 19 Apr 2023; Tue, 18 Apr 2023; Mon, 17 Apr 2023; Fri, 14 Apr 2023; Thu, 13 Apr 2023; Wed, 12 Apr 2023; Mon, 10 Apr 2023
1.Low-Latency SCL Bit-Flipping Decoding of Polar Codes

Authors:Wei Zhang, Xiaofu Wu

Abstract: Bit flipping can be used as a postprocessing technique to further improve the performance for successive cancellation list (SCL) decoding of polar codes. However, the number of bit-flipping trials could increase the decoding latency significantly, which is not welcome in practice. In this paper, we propose a low latency SCL bit flipping decoding scheme, which is restricted to just single round of post-processing. The use of multiple votes for a more accurate estimation of path survival probability is proposed to locate the first error event of SCL decoding. Simulations show the sound improvement compared to the existing SCL bit-flipping decoding methods.

2.Learning-Based Rich Feedback HARQ for Energy-Efficient Short Packet Transmission

Authors:Martin Voigt Vejling, Federico Chiariotti, Anders Ellersgaard Kalør, Deniz Gündüz, Gianluigi Liva, Petar Popovski

Abstract: The trade-off between reliability, latency, and energy-efficiency is a central problem in communication systems. Advanced hybrid automated repeat request (HARQ) techniques can reduce the number of retransmissions required for reliable communication, but they have a significant computational cost. On the other hand, strict energy constraints apply mainly to devices, while the access point receiving their packets is usually connected to the electrical grid. Therefore, moving the computational complexity required for HARQ schemes from the transmitter to the receiver may provide a way to overcome this trade-off. To achieve this, we propose the Reinforcement-based Adaptive Feedback (RAF) scheme, in which the receiver adaptively learns how much additional redundancy it requires to decode a packet and sends rich feedback (i.e., more than a single bit), requesting the coded retransmission of specific symbols. Simulation results show that the RAF scheme achieves a better trade-off between energy-efficiency, reliability, and latency, compared to existing HARQ solutions and a fixed threshold-based policy. Our RAF scheme can easily adapt to different modulation schemes, and since it relies on the posterior probabilities of the codeword symbols at the decoder, it can generalize to different channel statistics.

3.Selection Combining over Log-Logistic Fading Channels with Applications to Underwater Optical Wireless Communications

Authors:Yazan H. Al-Badarneh, Mustafa K. Alshawaqfeh, Osamah S. Badarneh

Abstract: We study the performance of a selection combining (SC) receiver operating over independent but non-identically distributed log-logistic ($\mathcal{LL})$ fading channels. We first characterize the statistics of the output instantaneous signal-to-noise ratio (SNR) of the SC receiver. Based on the SNR statistics, we derive exact analytical expressions, in terms of multivariate Fox H-functions, for the outage probability, the average bit error rate, and the ergodic capacity. We also derive exact expressions for such performance measures when all channels are independent and identically distributed, as a special case. Furthermore, we deduce simplified asymptotic expressions for these performance metrics assuming high values of average transmit SNR. To demonstrate the applicability of our theoretical analysis, we study the performance of an SC receiver in underwater optical wireless communication systems. Finally, we confirm the correctness of the derived analytical results using Monte Carlo Simulations.

4.Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy

Authors:Shu Liu, Ivan Tjuawinata, Chaoping Xing

Abstract: We consider the problem of efficient construction of q-ary 2-deletion correcting codes with low redundancy. We show that our construction requires less redundancy than any existing efficiently encodable q-ary 2-deletion correcting codes. Precisely speaking, we present an explicit construction of a q-ary 2-deletion correcting code with redundancy 5 log(n)+10log(log(n)) + 3 log(q)+O(1). Using a minor modification to the original construction, we obtain an efficiently encodable q-ary 2-deletion code that is efficiently list-decodable. Similarly, we show that our construction of list-decodable code requires a smaller redundancy compared to any existing list-decodable codes. To obtain our sketches, we transform a q-ary codeword to a binary string which can then be used as an input to the underlying base binary sketch. This is then complemented with additional q-ary sketches that the original q-ary codeword is required to satisfy. In other words, we build our codes via a binary 2-deletion code as a black-box. Finally we utilize the binary 2-deletion code proposed by Guruswami and Hastad to our construction to obtain the main result of this paper.

5.Integrated Sensing, Computation, and Communication for UAV-assisted Federated Edge Learning

Authors:Yao Tang, Guangxu Zhu, Wei Xu, Man Hon Cheung, Tat-Ming Lok, Shuguang Cui

Abstract: Federated edge learning (FEEL) enables privacy-preserving model training through periodic communication between edge devices and the server. Unmanned Aerial Vehicle (UAV)-mounted edge devices are particularly advantageous for FEEL due to their flexibility and mobility in efficient data collection. In UAV-assisted FEEL, sensing, computation, and communication are coupled and compete for limited onboard resources, and UAV deployment also affects sensing and communication performance. Therefore, the joint design of UAV deployment and resource allocation is crucial to achieving the optimal training performance. In this paper, we address the problem of joint UAV deployment design and resource allocation for FEEL via a concrete case study of human motion recognition based on wireless sensing. We first analyze the impact of UAV deployment on the sensing quality and identify a threshold value for the sensing elevation angle that guarantees a satisfactory quality of data samples. Due to the non-ideal sensing channels, we consider the probabilistic sensing model, where the successful sensing probability of each UAV is determined by its position. Then, we derive the upper bound of the FEEL training loss as a function of the sensing probability. Theoretical results suggest that the convergence rate can be improved if UAVs have a uniform successful sensing probability. Based on this analysis, we formulate a training time minimization problem by jointly optimizing UAV deployment, integrated sensing, computation, and communication (ISCC) resources under a desirable optimality gap constraint. To solve this challenging mixed-integer non-convex problem, we apply the alternating optimization technique, and propose the bandwidth, batch size, and position optimization (BBPO) scheme to optimize these three decision variables alternately.

6.Secrecy of Opportunistic User Scheduling in RIS-Aided Systems: A Comparison with NOMA Scheduling

Authors:Burhan Wafai, Sarbani Ghose, Chinmoy Kundu, Ankit Dubey, Mark F. Flanagan

Abstract: In this paper, we propose an opportunistic user scheduling scheme in a multi-user reconfigurable intelligent surface (RIS) aided wireless system to improve secrecy. We derive the secrecy outage probability (SOP) and its asymptotic expression in approximate closed form. The asymptotic analysis shows that the SOP does not depend on the transmitter-to-RIS distance and saturates to a fixed value depending on the ratio of the path loss of the RIS-to-destination and RIS-to-eavesdropper links and the number of users at high signal-to-noise ratio. It is shown that increasing the number of RIS elements leads to an exponential decrease in the SOP. We also compare our scheme with that of a non-orthogonal multiple access (NOMA) scheduling scheme, which chooses a pair of users to schedule in each time slot. The comparison shows that the SOP of all of the NOMA users is compromised, and that our proposed scheduling scheme has better performance.