The commercial availability of low-cost millimeter-wave (mmWave) communication and radar devices is starting to improve the adoption of such technologies in consumer markets, paving the way for large-scale and dense deployments in fifth-generation (5G)-and-beyond as well as 6G networks. At the same time, pervasive mmWave access will enable device localization and device-free sensing with unprecedented accuracy, especially with respect to sub-6 GHz commercial-grade devices. This paper surveys the state of the art in device-based localization and device-free sensing using mmWave communication and radar devices, with a focus on indoor deployments. We overview key concepts about mmWave signal propagation and system design, detailing approaches, algorithms and applications for mmWave localization and sensing. Several dimensions are considered, including the main objectives, techniques, and performance of each work, whether they reached an implementation stage, and which hardware platforms or software tools were used. We analyze theoretical (including signal processing and machine learning), technological, and implementation (hardware and prototyping) aspects, exposing under-performing or missing techniques and items towards enabling a highly effective sensing of human parameters, such as position, movement, activity and vital signs. Among many interesting findings, we observe that device-based localization systems would greatly benefit from commercial-grade hardware that exposes channel state information, as well as from a better integration between standard-compliant mmWave initial access and localization algorithms, especially with multiple access points (APs). Moreover, more advanced algorithms requiring zero-initial knowledge of the environment would greatly help improve the adoption of mmWave simultaneous localization and mapping (SLAM). Machine learning (ML)-based algorithms are gaining momentum, but still require the collection of extensive training datasets, and do not yet generalize to any indoor environment, limiting their applicability. Device-free (i.e., radar-based) sensing systems still have to be improved in terms of higher accuracy in the detection of vital signs (respiration and heart rate), and enhanced robustness/generalization capabilities across different environments. Moreover, improved support is needed for the tracking of multiple users, and for the automatic creation of radar networks to enable large-scale sensing applications. Finally, integrated systems performing joint communications and sensing are still in their infancy: theoretical and practical advancements are required to add sensing functionalities to mmWave-based channel access protocols based on orthogonal frequency-division multiplexing (OFDM) and multi-antenna technologies.

Generalized frequency division multiplexing (GFDM) is a new digital multicarrier concept. The GFDM modulation technique is extremely attractive for applications in a fragmented spectrum, as it provides the flexibility to choose a pulse shape and thus allows reduction of the out-of-band leakage of opportunistic cognitive radio signals into incumbent frequency space. However, this degree of freedom is obtained at the cost of loss of subcarrier orthogonality, which leads to self-inter-carrier-interference. This paper will explain how self-interference can be reduced by a basic and a double-sided serial interference cancellation technique and show that these interference cancellation techniques improve the GFDM bit error rate to match the theoretical performance of the well studied orthogonal frequency division multiplexing (OFDM).

In this paper, we present a novel sliding window decoding scheme based on iterative Bahl–Cocke–Jelinek–Raviv decoding for braided convolutional codes, a class of turbo-like codes with short constraint length component convolutional codes. The tradeoff between performance and decoding latency is examined and, to reduce decoding complexity, both uniform and nonuniform message passing schedules within the decoding window, along with early stopping rules, are proposed. We also perform a density evolution analysis of sliding window decoding to guide the selection of the window size and message passing schedule. Periodic puncturing is employed to obtain rate-compatible code rates of 1/2 and 2/3 starting from a rate 1/3 mother code and a code rate of 3/4 starting from a rate 1/2 mother code. Simulation results show that, with nonuniform message passing and periodic puncturing, near capacity performance can be maintained throughout a wide range of rates with reasonable decoding complexity and no visible error floors.

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are comprised of several protographbased chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen individual SC-LDPC code chains at specific points have improved iterative decoding thresholds. In addition, the connected chain ensembles have a smaller decoding complexity required to achieve a specific bit error probability compared to individual code chains. Moreover, we demonstrate that, like the individual component chains, the proposed constructions have a typical minimum distance that grows linearly with block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance.

Spatially coupled serially concatenated codes (SC-SCCs) are constructed by coupling several classical turbo-like component codes. The resulting spatially coupled codes provide a close-to-capacity performance and low error floor, which have attracted a lot of interest in the past few years. The aim of this paper is to perform a comprehensive design space exploration to reveal different aspects of SC-SCCs, which is missing in the literature. More specifically, we investigate the effect of block length, coupling memory, decoding window size, and number of iterations on the decoding performance, complexity, latency, and throughput of SC-SCCs. To this end, we propose two decoding algorithms for the SC-SCCs: block-wise and window-wise decoders. For these, we present VLSI architectural templates and explore them based on building blocks implemented in 12nm FinFET technology. Linking architectural templates with the new algorithms, we demonstrate various tradeoffs between throughput, silicon area, latency, and decoding performance.

Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we study spatially coupled generalized low-density parity-check (SC-GLDPC) codes and present a comprehensive analysis of these codes, including: (1) an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect; (2) an asymptotic analysis of the minimum distance and free distance properties of SC-GLDPC code ensembles, demonstrating that the ensembles are asymptotically good; and (3) an analysis of the finite-length scaling behavior of both GLDPC block codes and SC-GLDPC codes based on a peeling decoder (PD) operating on a binary erasure channel (BEC). Results are compared to GLDPC block codes, and the advantages and disadvantages of SC-GLDPC codes are discussed.