arXiv subjects

Jinho Choi

Publications and source records attributed to Jinho Choi.

126 records · Page 7Linked to original sources

arXiv2019

Single-Carrier Index Modulation for IoT Uplink

For the Internet of Things (IoT), there might be a large number of devices to be connected to the Internet through wireless technologies. In general, IoT devices would have various constraints due to limited processing capability, memory, energy source, and so on, and it is desirable to employ efficient wireless transmission schemes, especially for uplink transmissions. For example, orthogonal frequency division multiplexing (OFDM) with index modulation (IM) or OFDM-IM can be considered for IoT devices due to its energy efficiency. In this paper, we study a different IM scheme for a single-carrier (SC) system, which is referred to as SCIM. While SCIM is similar to OFDM-IM in terms of energy efficiency, SCIM may be better suited for IoT uplink because it has a low peak-to-average power ratio (PAPR) and does not require inverse fast Fourier transform (FFT) at devices compared to OFDM-IM. We also consider precoding for SCIM and generalize it to multiple access channel so that multiple IoT devices can share the same radio resource block. To detect precoded SCIM signals, low-complexity detectors are derived. For a better performance, based on variational inference that is widely used in machine learning, we consider a detector that provides an approximate solution to an optimal detection.

cs.IT↗

arXiv2019

On Error Rate Analysis for URLLC over Multiple Fading Channels

In this paper, we study ultra-reliable and low-latency communication (URLLC) under fading using multiple frequency or time bins. We investigate an approach to find an upper-bound on the packet error rate when a finite-length code is used. From simulation results, we find that the bound is reasonably tight for wide ranges of signal-to-noise ratio (SNR) and the number of multiple bins. Thus, the derived bound can be used to determine key parameters to guarantee the performance of URLLC in terms of the packet error rate.

cs.IT↗

arXiv2019

Compressive random access with multiple resource blocks and fast retrial

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady state performance to find the throughput and delay. Through analysis and simulation results, we can see that the proposed scheme can perform better than conventional multichannel ALOHA and enjoy a trade-off between the performance and complexity in terms of the number of RBs.

cs.IT↗

arXiv2018

NOMA-based Compressive Random Access using Gaussian Spreading

Compressive random access (CRA) is a random access scheme that has been considered for massive machine-type communication (MTC) with non-orthogonal spreading sequences, where the notion of compressive sensing (CS) is used for low-complexity detectors by exploiting the sparse device activity. In this paper, we study the application of power-domain non-orthogonal multiple access (NOMA) to CRA in order to improve the performance of CRA (or increase the number of devices to be supported). We consider Gaussian spreading sequences and derive design criteria through a large-system analysis to determine the power levels for power-domain NOMA. From simulation results, we can confirm that the number of incorrectly detected device activity can be reduced by applying NOMA to CRA.

cs.IT↗

arXiv2018

A Variational Inference based Detection Method for Repetition Coded Generalized Spatial Modulation

In this paper, we consider a simple coding scheme for spatial modulation (SM), where the same set of active transmit antennas is repeatedly used over consecutive multiple transmissions. Based on a Gaussian approximation, an approximate maximum likelihood (ML) detection problem is formulated to detect the indices of active transmit antennas. We show that the solution to the approximate ML detection problem can achieve a full coding gain. Furthermore, we develop a low-complexity iterative algorithm to solve the problem with low complexity based on a well-known machine learning approach, i.e., variational inference. Simulation results show that the proposed algorithm can have a near ML performance. A salient feature of the proposed algorithm is that its complexity is independent of the number of active transmit antennas, whereas an exhaustive search for the ML problem requires a complexity that grows exponentially with the number of active transmit antennas.

cs.IT↗

arXiv2018

Opportunism in Dynamic Spectrum Access for 5G: A Concept and Its Application to Duplexing

With the envisioned massive Internet-of-Things (IoT) era, one of the challenges for 5G wireless systems will be handling the unprecedented spectrum crunch. A potential solution has emerged in the form of spectrum sharing, which deviates from a monopolistic spectrum usage system. This article investigates the medium access control (MAC) as a means of increasing the viability of the spectrum sharing technique. We first quantify the opportunity of spectrum access in a probabilistic manner, a method referred to as opportunity probability (OP). Based on the OP framework, we propose a random MAC algorithm in which the access of a node is randomly determined with its own OP value. As a possible application of our OP based random MAC, we propose a hybrid half duplex (HD)/full duplex (FD) communication where each pair decides the duplexing mode according to the OP values of the two pair nodes. This approach fits well with the spectrum sharing system since it enables a flexible operation for the spectrum access according to the spectrum usage level. From the numerical analysis, we validate the feasibility and verify the performance enhancements by implementing an FPGA based real-time prototype. Measurements and numerical results confirm that the proposed architecture can achieve up to 4 times higher system throughput than conventional LTE-TDD (time division duplex) systems.

cs.IT↗

arXiv2018

A Game-Theoretic Approach for NOMA-ALOHA

Non-orthogonal multiple access (NOMA) can improve the spectral efficiency by exploiting the power domain and successive interference cancellation (SIC), and it can be applied to various transmission schemes including random access that plays a crucial role in the Internet of Things (IoT) to support connectivity for a number of devices with sparse activity. In this paper, we formulate a game when NOMA is applied to ALOHA to decide the transmission probability. We consider a payoff function based on an energy-efficiency metric and drive the mixed strategy Nash equilibrium (NE).

cs.IT↗

arXiv2017

Layered Non-Orthogonal Random Access with SIC and Transmit Diversity for Reliable Transmissions

In this paper, we study a layered random access scheme based on non-orthogonal multiple access (NOMA) to improve the throughput of multichannel ALOHA. At a receiver, successive interference cancellation (SIC) is carried out across layers to remove the signals that are already decoded. A closed- form expression for the total throughput is derived under certain assumptions. It is shown that the transmission rates of layers can be optimized to maximize the total throughput and the proposed scheme can improve the throughput with multiple layers. Furthermore, it is shown that the optimal rates can be recursively found using multiple individual one-dimensional optimizations. We also modify the proposed layered random access scheme with contention resolution repetition diversity for reliable transmissions with a delay constraint. It is shown to be possible to have a low outage probability if the number of copies can be optimized, which is desirable for high reliability low latency communications.

cs.IT↗

arXiv2017

Joint Power Allocation and Beamforming for Non-Orthogonal Multiple Access (NOMA) in 5G Millimeter-Wave Communications

In this paper we explore non-orthogonal multiple access (NOMA) in millimeter-wave (mmWave) communications (mmWave-NOMA). In particular, we consider a typical problem, i.e., maximization of the sum rate of a 2-user mmWave-NOMA system. In this problem, we need to find the beamforming vector to steer towards the two users simultaneously subject to an analog beamforming structure, while allocating appropriate power to them. As the problem is non-convex and may not be converted to a convex problem with simple manipulations, we propose a suboptimal solution to this problem. The basic idea is to decompose the original joint beamforming and power allocation problem into two sub-problems which are relatively easy to solve: one is a power and beam gain allocation problem, and the other is a beamforming problem under a constant-modulus constraint. Extension of the proposed solution from 2-user mmWave-NOMA to more-user mmWave-NOMA is also discussed. Extensive performance evaluations are conducted to verify the rational of the proposed solution, and the results also show that the proposed sub-optimal solution achieve close-to-bound sum-rate performance, which is significantly better than that of time-division multiple access (TDMA).

cs.IT↗

arXiv2017

Millimeter-Wave Communication with Non-Orthogonal Multiple Access for 5G

To further improve the system capacity for 5G, we explore the integration of non-orthogonal multiple access (NOMA) in mmWave communications (mmWave-NOMA) for future 5G systems. Compared with the conventional NOMA, the distinguishing feature of mmWave-NOMA is that, it is usually characterized by transmit/receive beamforming with large antenna arrays. In this paper, we focus on the design challenges of mmWave-NOMA due to beamforming. Firstly, we study how beamforming affects the sum-rate performance of mmWave-NOMA, and find that with conventional single-beam forming, the performance may be offset by the relative angle between NOMA users. Then, we consider multi-beam forming for mmWave-NOMA, which is shown to be able to achieve promising performance enhancement as well as robustness. We further investigate the challenging joint design of the intertwined power allocation and user pairing for mmWave-NOMA. We also discuss the challenges and propose some potential solutions in detail. Finally, we consider hybrid spatial division multiple access (SDMA) and NOMA in mmWave communications, where some possible system configurations and the corresponding solutions are discussed to address the multi-user issues including multi-user precoding and multi-user interference (MUI) mitigation.

cs.IT↗

arXiv2017

NOMA based Random Access with Multichannel ALOHA

In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is usually employed for coordinated transmissions and mostly applied to downlink transmissions where a base station (BS) per- forms coordination for downlink transmissions with full channel state information (CSI). In this paper, however, we show that NOMA can also be employed for non-coordinated transmissions such as random access for uplink transmissions. We apply a NOMA scheme to multichannel ALOHA and show that the throughput can be improved. In particular, the resulting scheme is suitable for random access when the number of subchannels is limited since NOMA can effectively increase the number of subchannels without any bandwidth expansion.

cs.IT↗

arXiv2017

NOMA: Principles and Recent Results

Although non-orthogonal multiple access (NOMA) is recently considered for cellular systems, its key ideas such as successive interference cancellation (SIC) and superposition coding have been well studied in information theory. In this paper, we overview principles of NOMA based on information theory and present some recent results. Under a single-cell environment, we mainly focus on fundamental issues, e.g., power allocation and beamforming for downlink NOMA and coordinated and uncoordinated transmissions for uplink NOMA.

cs.IT↗

arXiv2016

Application of Non-orthogonal Multiple Access in LTE and 5G Networks

As the latest member of the multiple access family, non-orthogonal multiple access (NOMA) has been recently proposed for 3GPP Long Term Evolution (LTE) and envisioned to be an essential component of 5th generation (5G) mobile networks. The key feature of NOMA is to serve multiple users at the same time/frequency/code, but with different power levels, which yields a significant spectral efficiency gain over conventional orthogonal MA. This article provides a systematic treatment of this newly emerging technology, from its combination with multiple-input multiple-output (MIMO) technologies, to cooperative NOMA, as well as the interplay between NOMA and cognitive radio. This article also reviews the state of the art in the standardization activities concerning the implementation of NOMA in LTE and 5G networks.

cs.IT↗

arXiv2016

Achievable Sum Rates of Half- and Full-Duplex Bidirectional OFDM Communication Links

While full-duplex (FD) transmission has the potential to double the system capacity, its substantial benefit can be offset by the self-interference (SI) and non-ideality of practical transceivers. In this paper, we investigate the achievable sum rates (ASRs) of half-duplex (HD) and FD transmissions with orthogonal frequency division multiplexing (OFDM), where the non-ideality is taken into consideration. Four transmission strategies are considered, namely HD with uniform power allocation (UPA), HD with non-UPA (NUPA), FD with UPA, and FD with NUPA. For each of the four transmission strategies, an optimization problem is formulated to maximize its ASR, and a (suboptimal/optimal) solution with low complexity is accordingly derived. Performance evaluations and comparisons are conducted for three typical channels, namely symmetric frequency-flat/selective and asymmetric frequency-selective channels. Results show that the proposed solutions for both HD and FD transmissions can achieve near optimal performances. For FD transmissions, the optimal solution can be obtained under typical conditions. In addition, several observations are made on the ASR performances of HD and FD transmissions.

cs.IT↗

arXiv2015

On the Aggregate Interference in Random CSMA/CA Networks: A Stochastic Geometry Approach

In this paper, we investigate the cumulative distribution function (CDF) of the aggregate interference in carrier sensing multiple access/collision avoidance (CSMA/CA) networks measured at an arbitrary time and position. We assume that nodes are deployed in an infinite two-dimensional plane by Poisson point process (PPP) and the channel model follows the singular path loss function and Rayleigh fading. To find the effective active node density we analyze the distributed coordinate function (DCF) dynamics in a common sensing area and obtain the steady-state power distribution within a spatial disk of radius $R/2$, where $R$ is the effective carrier sensing distance. The results of massive simulation using Network Simulator-2 (NS-2) show a high correlation with the derived CDF.

cs.NI↗

arXiv2015

Iterative Joint Beamforming Training with Constant-Amplitude Phased Arrays in Millimeter-Wave Communication

In millimeter-wave communications (MMWC), in order to compensate for high propagation attenuation, phased arrays are favored to achieve array gain by beamforming, where transmitting and receiving antenna arrays need to be jointly trained to obtain appropriate antenna weight vectors (AWVs). Since the amplitude of each element of the AWV is usually constraint constant to simplify the design of phased arrays in MMWC, the existing singular vector based beamforming training scheme cannot be used for such devices. Thus, in this letter, a steering vector based iterative beamforming training scheme, which exploits the directional feature of MMWC channels, is proposed for devices with constant-amplitude phased arrays. Performance evaluations show that the proposed scheme achieves a fast convergence rate as well as a near optimal array gain.

cs.IT↗

arXiv2015

Secret Key Agreement with Large Antenna Arrays under the Pilot Contamination Attack

We present a secret key agreement (SKA) protocol for a multi-user time-division duplex system where a base-station (BS) with a large antenna array (LAA) shares secret keys with users in the presence of non-colluding eavesdroppers. In the system, when the BS transmits random sequences to legitimate users for sharing common randomness, the eavesdroppers can attempt the pilot contamination attack (PCA) in which each of eavesdroppers transmits its target user's training sequence in hopes of acquiring possible information leak by steering beam towards the eavesdropper. We show that there exists a crucial complementary relation between the received signal strengths at the eavesdropper and its target user. This relation tells us that the eavesdropper inevitably leaves a trace that enables us to devise a way of measuring the amount of information leakage to the eavesdropper even if PCA parameters are unknown. To this end, we derive an estimator for the channel gain from the BS to the eavesdropper and propose a rate-adaptation scheme for adjusting the length of secret key under the PCA. Extensive analysis and evaluations are carried out under various setups, which show that the proposed scheme adequately takes advantage of the LAA to establish the secret keys under the PCA.

cs.CR↗

arXiv2014

Spreading Information in Mobile Wireless Networks

Device-to-device (D2D) communication enables us to spread information in the local area without infrastructure support. In this paper, we focus on information spreading in mobile wireless networks where all nodes move around. The source nodes deliver a given information packet to mobile users using D2D communication as an underlay to the cellular uplink. By stochastic geometry, we derive the average number of nodes that have successfully received a given information packet as a function of the transmission power and the number of transmissions. Based on these results, we formulate a redundancy minimization problem under the maximum transmission power and delay constraints. By solving the problem, we provide an optimal rule for the transmission power of the source node.

cs.NI↗