DHDennis Hui

Dennis Hui

*This is an algorithmically generated author record based on publicly available information.

Dennis Hui has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Ambient Power-Enabled Internet of Things: 3GPP Physical Layer Standardization Overview

    by Saeedeh Moloudi, Talha Ahmed Khan, Giuseppe Moschetti, Revathy Narayanan, Hamza Khan, Abdullah Haskou, Johan Bergman, Boules A. Mouris, Andreas Höglund, Chunhui Zhang, et al.

    Zero-energy devices, also known as Ambient power-enabled Internet of Things (A-IoT) devices, rely on harvesting ambient energy to operate. These self-sustainable devices do not need manual battery recharging or replacement, making them easy to maintain. A-IoT can address new Internet of Things (IoT) use cases within the cellular ecosystem which the existing cellular IoT technologies were not designed for. To address these use cases, a technical study was conducted by the Third Generation Partnership Project (3GPP) in Release 19 to identify the challenges and develop solutions for a new cellular radio access technology for A-IoT devices that can be deployed in 5G New Radio (NR) spectrum using or coexisting with existing NR network infrastructure. The key challenges for cellular A-IoT devices include low power budget, intermittent energy availability, limited synchronization and computational capabilities due to simplified hardware, and coexistence with NR. In this paper, the 3GPP standardization work on A-IoT is reviewed, with a focus on the physical layer aspects considered in the aforementioned Release 19 study. First, the nomenclature for A-IoT device types, architectures, and deployment scenarios is summarized. This is complemented by a description of the A-IoT physical layer design for downlink and uplink, including aspects such as physical channels, waveform, modulation, coding, preamble, and multiple access. The issues related to coexistence of A-IoT and NR are also outlined. A brief discussion on the upcoming 3GPP A-IoT standardization work concludes the paper.


  • Open Access

    Towards Green Communication: Soft Decoding Scheme for OOK Signals in Zero-Energy Devices

    by Ticao Zhang, Dennis Hui, Mehrnaz Afshang, Mohammad Mozaffari

    The booming of Internet-of-Things (IoT) is expected to provide more intelligent and reliable communication services for higher network coverage, massive connectivity, and low-cost solutions for 6G services. However, frequent charging and battery replacement of these massive IoT devices brings a series of challenges. Zero energy devices, which rely on energy-harvesting technologies and can operate without battery replacement or charging, play a pivotal role in facilitating the massive use of IoT devices. In order to enable reliable communications of such low-power devices, Manchester-coded on-off keying (OOK) modulation and non-coherent detections are attractive techniques due to their energy efficiency, robustness in noisy environments, and simplicity in receiver design. Moreover, to extend their communication range, employing channel coding along with enhanced detection schemes is crucial. In this paper, a novel soft-decision decoder is designed for OOK-based low-power receivers to enhance their detection performance. In addition, exact closed-form expressions and two simplified approximations are derived for the log-likelihood ratio (LLR), an essential metric for soft decoding. Numerical results demonstrate the significant coverage gain achieved through soft decoding for convolutional code.

  • Channel Coding in NR

    by Yufei Blankenship, Dennis Hui, Mattias Andersson


  • Top Cited Papers

    Channel Coding in 5G New Radio: A Tutorial Overview and Performance Comparison with 4G LTE

    by Dennis Hui, Sara Sandberg, Yufei Blankenship, Mattias Andersson, Leefke Grosjean

    Fifth-generation (5G) new radio (NR) holds promise in fulfilling new communication requirements that enable ubiquitous, low-latency, high-speed, and high-reliability connections among mobile devices. Compared to fourth-generation (4G) long-term evolution (LTE), new error-correcting codes have been introduced in 5G NR for both data and control channels. In this article, the specific low-density parity-check (LDPC) codes and polar codes adopted by the 5G NR standard are described. The purpose of each key component in these codes and the associated operations are explained. Performance and implementation advantages of these new codes are compared with those of 4G LTE.


  • Interleaved CRC for Polar Codes

    by Dennis Hui, Michael Breschel, Yufei Blankenship

    A method of distributing CRC bits from a single CRC polynomial over a block of information bits for Polar codes via an interleaver to facilitate early termination and enhanced error correction is proposed and investigated. The interleaver is designed such that each CRC bit is placed in a decoding position as early as possible while keeping all the information bits that the CRC bit depends on in front of it in the successive decoding order. This allows the CRC bits to be used as dynamic frozen bits to assist surviving path selection during SC/SCL decoding to improve error performance. Furthermore, it allows the distributed CRC bits to be used for early error detection in the list decoding process and thus reduces the average decoding latency. Simulation results show that interleaved CRC can provide moderate benefits in improving error correction and reducing decoding latency through early error detection.


  • Open Access

    On the Analysis of Puncturing for Finite-Length Polar Codes: Boolean Function Approach

    by Song-Nam Hong, Dennis Hui

    This paper investigates the impact of puncturing on finite-length polar codes in which a puncturing pattern $\pv^{N}=(p_0,...,p_N)$ is applied to a length-$N$ polar code.. We first introduce two virtual channels to stochastically model the punctured (untransmitted) bits, which are respectively called {\em useless channel model} (UCM) and {\em deterministic channel model} (DCM). Under each model, we derive boolean functions in variables $p_0,...,p_{N-1}$ that can indicate which polarized channels should carry frozen bits. Based on this, we present an efficient method to jointly optimize a puncturing pattern and an information set. Focusing on a fixed information set, we show that there exist the so-called {\em catastrophic} puncturing patterns that will surely lead to a block error and derive their weight distributions recursively. We then propose the two construction methods of a rate-compatible (RC) polar code which ensures that each puncturing pattern in the family is non-catastrophic. Simulation results demonstrate that the proposed RC polar code outperform the RC Turbo code adopted in LTE.

  • Capacity-Achieving Rate-Compatible Polar Codes

    by Song-Nam Hong, Dennis Hui, Ivana Maric

    A method of constructing rate-compatible polar codes that are capacity achieving at multiple code rates with low-complexity sequential decoders is presented. The underlying idea of the construction exploits certain common characteristics of polar codes that are optimized for a sequence of successively degraded channels. The proposed code consists of parallel concatenation of multiple polar codes with information-bit divider at the input of each polar encoder. Thus, it is referred to as parallel concatenated polar (PCP) codes. A lower-rate PCP code is simply constructed by adding more constituent polar codes, which enables incremental retransmissions at different rates in order to adapt to channel conditions. Due to the length limitation of polar codes, the PCP code can only support a restricted set of rates that is characterized by the size of the kernel when conventional polar codes are used. To overcome this limitation, punctured polar codes, which provide more flexibility on blocklength by controlling a puncturing fraction, are considered as constituent codes. The existence of capacity-achieving punctured polar codes for any given puncturing fraction is proven. Using such punctured polar codes as constituent codes, it is shown that the proposed PCP code is capacity achieving for an arbitrary sequence of rates and for any class of degraded channels.


  • Open Access

    Capacity-Achieving Rate-Compatible Polar Codes for General Channels

    by Marco Mondelli, S. Hamed Hassani, Ivana Marić, Dennis Hui, Song-Nam Hong

    We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of universal polar codes. Our scheme possesses the usual attractive features of polar codes: low complexity code construction, encoding, and decoding; super-polynomial scaling of the error probability with the block length; and absence of error floors. On the negative side, the scaling of the gap to capacity with the block length is slower than in standard polar codes, and we prove an upper bound on the scaling exponent.

  • Open Access

    Capacity-Achieving Rate-Compatible Polar Codes

    by Song-Nam Hong, Dennis Hui, Ivana Marić

    We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt to channel conditions. The main idea of the construction exploits the common characteristics of polar codes optimized for a sequence of successively degraded channels. The proposed approach allows for an optimized polar code to be used at every transmission thereby achieving capacity.

  • Open Access

    A Novel Cooperative Strategy for Wireless Multihop Backhaul Networks

    by Song-Nam Hong, Ivana Maric, Dennis Hui

    The 5G wireless network architecture will bring dense deployments of base stations called {\em small cells} for both outdoors and indoors traffic. The feasibility of their dense deployments depends on the existence of a high data-rate transport network that can provide high-data backhaul from an aggregation node where data traffic originates and terminates, to every such small cell. Due to the limited range of radio signals in the high frequency bands, multihop wireless connection may need to be established between each access node and an aggregation node. In this paper, we present a novel transmission scheme for wireless multihop backhaul for 5G networks. The scheme consists of 1) {\em group successive relaying} that established a relay schedule to efficiently exploit half-duplex relays and 2) an optimized quantize-map-and-forward (QMF) coding scheme that improves the performance of QMF and reduces the decoding complexity and the delay. We derive an achievable rate region of the proposed scheme and attain a closed-form expression in the asymptotic case for several network models of interests. It is shown that the proposed scheme provides a significant gain over multihop routing (based on decode-and-forward), which is a solution currently proposed for wireless multihop backhaul network. Furthermore, the performance gap increases as a network becomes denser. For the proposed scheme, we then develop energy-efficient routing that determines {\em groups} of participating relays for every hop. To reflect the metric used in the routing algorithm, we refer to it as {\em interference-harnessing} routing. By turning interference into a useful signal, each relay requires a lower transmission power to achieve a desired performance compared to other routing schemes. Finally, we present a low-complexity successive decoder, which makes it feasible to use the proposed scheme in practice.