Sorry, you need to enable JavaScript to visit this website.

SC-Flip (SCF) decoding is a low-complexity polar code decoding algorithm alternative to SC-List (SCL) algorithm with small list sizes. To achieve the performance of the SCL algorithm with large list sizes, the Dynamic SC-Flip (DSCF) algorithm was proposed. However, DSCF involves logarithmic and exponential computations that are not suitable for practical hardware implementations. In this work, we propose a simple approximation that replaces the transcendental computations of DSCF decoding. Moreover, we show how to incorporate fast decoding techniques with the DSCF algorithm.

The cost of uncompressing (decoding) data can be prohibitive in certain real-time applications,
for example when predicting using compressed deep learning models. In many scenarios, it is
acceptable to sacrifice to some extent on compression in the interest of fast decoding. In this
work, we are interested in finding the prefix tree having the best decode time under the constraint
that the code length does not exceed a certain threshold for a natural class of algorithms under

We consider the problem of coding for computing with maximal distortion, where the sender communicates with a receiver, which has its own private data and wants to compute a function of their combined data with some fidelity constraint known to both agents. We show that the minimum rate for this problem is equal to the conditional entropy of a hypergraph and design practical codes for the problem. Further, the minimum rate of this problem may be a discontinuous function of the fidelity constraint.

This paper designs a Distributed Arithmetic Coding (DAC) decoder using the depth-first search method. In addition, a method is proposed to control the decoder complexity. Simulation results compare the DFD with the traditional Breadth-First Decoder (BFD)
showing that under the same complexity constraints, the DFD outperforms the BFD when the code length is not too long and the quality of side information is not too poor.

Hybrid beamforming has attracted considerable attention in recent years as an efficient and promising technique for the practical implementation of millimeter-Wave (mmWave) massive multiple-input multiple-output (MIMO) wireless systems. In this paper, we investigate hybrid analog/digital beamforming designs based on a single RF chain architecture (SRCA) for mmWave massive-MIMO. We first revisit the SRCA and then explore its shortcomings.

Power delay profiles (PDPs) are an important factor in the design of wireless networks, e.g., in choosing the length of a cyclic prefix. While distributed networks are receiving increasing attention, the impact of cooperation on the PDP has not been addressed. We address this issue in this paper. Specifically, we analyze a network where each user is served by a cluster of Remote Radio Heads (RRHs) with RRH locations modeled as a Poisson point process.

In recent years, the variety and volume of multimedia services have increased exponentially. Like most of other multimedia services, the conversational video service has stringent quality of service and experience requirements. In order to better support users QoE (Quality of Experience) and allocate network resources more effectively, this paper focuses on the QoS (Quality of Service)-QoE association modeling of conversational video flows.

In this paper, a robust power allocation and subchannel assignment algorithm was proposed to maximize the total EE
of SUs for cognitive NOMA systems under taking channel uncertainties and diverse QoS requirements of users into account. The RAA problem was formulated into a non-convex mixed-integer fractional programming problem with the outage probabilities of users and thus difficult to solve. Based on Gaussian CSI error models, we transformed the robust rate constraint and the robust interference power constraint into the convex constraints. By slacking the integer subchannel allocation factor into a continuous variable, the original problem was converted into a convex problem by using the subtractive-form auxiliary variable. Based on the Lagrangian dual approach and the subgradient updating methods, the closed-form solutions were obtained. The effectiveness of the proposed algorithm was verified by comparing it with the existing algorithms.

The recently-proposed reinforcement learning for mapless visual navigation can generate an optimal policy for searching different targets. However, most state-of-the-art deep reinforcement learning (DRL) models depend on hard rewards to learn the optimal policy, which can lead to the lack of previous diverse experiences. Moreover, these pre-trained DRL models cannot generalize well to un-trained tasks. To overcome these problems above, in this paper, we propose a Memorybased Parameterized Skills Learning (MPSL) model for mapless visual navigation.