arXiv subjects

Alva Kosasih

Publications and source records attributed to Alva Kosasih.

36 records · Page 2Linked to original sources

arXiv2024

Spatial Correlation Modeling and RS-LS Estimation of Near-Field Channels with Uniform Planar Arrays

Extremely large aperture arrays (ELAAs) can offer massive spatial multiplexing gains in the radiative near-field region in beyond 5G systems. While near-field channel modeling for uniform linear arrays has been extensively explored in the literature, uniform planar arrays-despite their advantageous form factor-have been somewhat neglected due to their more complex nature. Spatial correlation is crucial for non-line-of-sight channel modeling. Unlike far-field scenarios, the spatial correlation properties of near-field channels have not been thoroughly investigated. In this paper, we start from the fundamentals and develop a near-field spatial correlation model for arbitrary spatial scattering functions. Furthermore, we derive the lower dimensional subspace where the channel vectors can exist. It is based on prior knowledge of the three-dimensional coverage region where scattering clusters exists and we derive a tractable one-dimensional integral expression. This subspace is subsequently employed in a reduced-subspace least squares (RS-LS) estimation method for near-field channels, thereby enhancing performance over the traditional least squares estimator without the need for having full spatial correlation matrix knowledge.

eess.SP↗

arXiv2024

An Efficient Modified MUSIC Algorithm for RIS-Assisted Near-Field Localization

In this paper, we consider a single-anchor localization system assisted by a reconfigurable intelligent surface (RIS), where the objective is to localize multiple user equipments (UEs) placed in the radiative near-field region of the RIS by estimating their azimuth angle-of-arrival (AoA), elevation AoA, and distance to the surface. The three-dimensional (3D) locations can be accurately estimated via the conventional MUltiple SIgnal Classification (MUSIC) algorithm, albeit at the expense of tremendous complexity due to the 3D grid search. In this paper, capitalizing on the symmetric structure of the RIS, we propose a novel modified MUSIC algorithm that can efficiently decouple the AoA and distance estimation problems and drastically reduce the complexity compared to the standard 3D MUSIC algorithm. Additionally, we introduce a spatial smoothing method by partitioning the RIS into overlapping sub-RISs to address the rank-deficiency issue in the signal covariance matrix. We corroborate the effectiveness of the proposed algorithm via numerical simulations and show that it can achieve the same performance as 3D MUSIC but with much lower complexity.

eess.SP↗

arXiv2024

Symbol-Level Precoding for Near-Field ISAC

The forthcoming 6G and beyond wireless networks are anticipated to introduce new groundbreaking applications, such as Integrated Sensing and Communications (ISAC), potentially leveraging much wider bandwidths at higher frequencies and using significantly larger antenna arrays at base stations. This puts the system operation in the radiative near-field regime of the BS antenna array, characterized by spherical rather than flat wavefronts. In this paper, we refer to such a system as near-field ISAC. Unlike the far-field regime, the near-field regime allows for precise focusing of transmission beams on specific areas, making it possible to simultaneously determine a target's direction and range from a single base station and resolve targets located in the same direction. This work designs the transmit symbol vector in near-field ISAC to maximize a weighted combination of sensing and communication performances subject to a total power constraint using symbol-level precoding (SLP). The formulated optimization problem is convex, and the solution is used to estimate the angle and range of the considered targets using the 2D MUSIC algorithm. The simulation results suggest that the SLP-based design outperforms the block-level-based counterpart. Moreover, the 2D MUSIC algorithm accurately estimates the targets' parameters.

eess.SP↗

arXiv2024

Accurate Direct Positioning in Distributed MIMO Using Delay-Doppler Channel Measurements

Distributed multiple-input multiple-output (D-MIMO) is a promising technology for simultaneous communication and positioning. However, phase synchronization between multiple access points in D-MIMO is challenging and methods that function without the need for phase synchronization are highly desired. Therefore, we present a method for D-MIMO that performs direct positioning of a moving device based on the delay-Doppler characteristics of the channel state information (CSI). Our method relies on particle-filter-based Bayesian inference with a state-space model. We use recent measurements from a sub-6 GHz D-MIMO OFDM system in an industrial environment to demonstrate near-centimeter accuracy under partial line-of-sight (LoS) conditions and decimeter accuracy under fully obstructed LoS.

eess.SP↗

arXiv2024

Parametric Near-Field Channel Estimation for Extremely Large Aperture Arrays

Accurate channel estimation is critical to fully exploit the beamforming gains when communicating with extremely large aperture arrays. The propagation distances between the user and receiver, which potentially has thousands of antennas/elements, are such that they are located in the radiative near-field region of each other when considering the Fraunhofer distance of the entire array. Therefore, it is imperative to consider near-field effects to achieve proper channel estimation. This paper proposes a parametric multi-user near-field channel estimation algorithm based on MUltiple SIgnal Classification (MUSIC) method to obtain the essential parameters describing the users' locations. We derive the estimated channel by incorporating the estimated parameters into the near-field channel model. Additionally, we implement a least-squares-based estimation corrector, resulting in a precise near-field channel estimation. Simulation results demonstrate that our proposed scheme outperforms classical least-squares and minimum mean-square error channel estimation methods in terms of normalized beamforming gain and normalized mean-square error.

eess.SP↗

arXiv2023

Exploiting the Depth and Angular Domains for Massive Near-Field Spatial Multiplexing

In this article, we present our vision for how extremely large aperture arrays (ELAAs), equipped with hundreds or thousands of antennas, can play a major role in future 6G networks by enabling a remarkable increase in data rates through spatial multiplexing of a massive number of data streams to both a single user and many simultaneous users. Specifically, with the quantum leap in the array aperture size, the users will be in the so-called radiative near-field region of the array, where previously negligible physical phenomena dominate the propagation conditions and give the channel matrices more favorable properties. This article presents the foundational properties of communication in the radiative near-field region and then exemplifies how these properties enable two unprecedented spatial multiplexing schemes: depth-domain multiplexing of multiple users and angular multiplexing of data streams to a single user. We also highlight research challenges and open problems that require further investigation.

eess.SP↗

arXiv2023

Untrained Neural Network based Bayesian Detector for OTFS Modulation Systems

The orthogonal time frequency space (OTFS) symbol detector design for high mobility communication scenarios has received numerous attention lately. Current state-of-the-art OTFS detectors mainly can be divided into two categories; iterative and training-based deep neural network (DNN) detectors. Many practical iterative detectors rely on minimum-mean-square-error (MMSE) denoiser to get the initial symbol estimates. However, their computational complexity increases exponentially with the number of detected symbols. Training-based DNN detectors typically suffer from dependency on the availability of large computation resources and the fidelity of synthetic datasets for the training phase, which are both costly. In this paper, we propose an untrained DNN based on the deep image prior (DIP) and decoder architecture, referred to as D-DIP that replaces the MMSE denoiser in the iterative detector. DIP is a type of DNN that requires no training, which makes it beneficial in OTFS detector design. Then we propose to combine the D-DIP denoiser with the Bayesian parallel interference cancellation (BPIC) detector to perform iterative symbol detection, referred to as D-DIP-BPIC. Our simulation results show that the symbol error rate (SER) performance of the proposed D-DIP-BPIC detector outperforms practical state-of-the-art detectors by 0.5 dB and retains low computational complexity.

eess.SP↗

arXiv2023

GNN-Enhanced Approximate Message Passing for Massive/Ultra-Massive MIMO Detection

Efficient massive/ultra-massive multiple-input multiple-output (MIMO) detection algorithms with satisfactory performance and low complexity are critical to meet the high throughput and ultra-low latency requirements in 5G and beyond communications, given the extremely large number of antennas. In this paper, we propose a low-complexity graph neural network (GNN) enhanced approximate message passing (AMP) algorithm, AMP-GNN, for massive/ultra-massive MIMO detection. The structure of the neural network is customized by unfolding the AMP algorithm and introducing the GNN module for multiuser interference cancellation. Numerical results will show that the proposed AMP-GNN significantly improves the performance of the AMP detector and achieves comparable performance as the state-of-the-art deep learning-based MIMO detectors but with reduced computational complexity. Furthermore, it presents strong robustness to the change of the number of users.

cs.IT↗

arXiv2022

Bayesian Neural Network Detector for an Orthogonal Time Frequency Space Modulation

The orthogonal time-frequency space (OTFS) modulation is proposed for beyond 5G wireless systems to deal with high mobility communications. The existing low complexity OTFS detectors exhibit poor performance in rich scattering environments where there are a large number of moving reflectors that reflect the transmitted signal towards the receiver. In this paper, we propose an OTFS detector, referred to as the BPICNet OTFS detector that integrates NN, Bayesian inference, and parallel interference cancellation concepts. Simulation results show that the proposed OTFS detector significantly outperforms the state-of-the-art.

eess.SP↗

arXiv2022

Graph Neural Network Aided MU-MIMO Detectors

Multi-user multiple-input multiple-output (MU-MIMO) systems can be used to meet high throughput requirements of 5G and beyond networks. A base station serves many users in an uplink MU-MIMO system, leading to a substantial multi-user interference (MUI). Designing a high-performance detector for dealing with a strong MUI is challenging. This paper analyses the performance degradation caused by the posterior distribution approximation used in the state-of-the-art message passing (MP) detectors in the presence of high MUI. We develop a graph neural network based framework to fine-tune the MP detectors' cavity distributions and thus improve the posterior distribution approximation in the MP detectors. We then propose two novel neural network based detectors which rely on the expectation propagation (EP) and Bayesian parallel interference cancellation (BPIC), referred to as the GEPNet and GPICNet detectors, respectively. The GEPNet detector maximizes detection performance, while GPICNet detector balances the performance and complexity. We provide proof of the permutation equivariance property, allowing the detectors to be trained only once, even in the systems with dynamic changes of the number of users. The simulation results show that the proposed GEPNet detector performance approaches maximum likelihood performance in various configurations and GPICNet detector doubles the multiplexing gain of BPIC detector.

eess.SP↗

arXiv2022

Graph Neural Network Aided Expectation Propagation Detector for MU-MIMO Systems

Multiuser massive multiple-input multiple-output (MU-MIMO) systems can be used to meet high throughput requirements of 5G and beyond networks. In an uplink MUMIMO system, a base station is serving a large number of users, leading to a strong multi-user interference (MUI). Designing a high performance detector in the presence of a strong MUI is a challenging problem. This work proposes a novel detector based on the concepts of expectation propagation (EP) and graph neural network, referred to as the GEPNet detector, addressing the limitation of the independent Gaussian approximation in EP. The simulation results show that the proposed GEPNet detector significantly outperforms the state-of-the-art MU-MIMO detectors in strong MUI scenarios with equal number of transmit and receive antennas.

cs.IT↗

arXiv2021

Density Evolution Analysis of the Iterative Joint Ordered-Statistics Decoding for NOMA

In this paper, we develop a density evolution (DE) framework for analyzing the iterative joint decoding (JD) for non-orthogonal multiple access (NOMA) systems, where the ordered-statistics decoding (OSD) is applied to decode short block codes. We first investigate the density-transform feature of the soft-output OSD (SOSD), by deriving the density of the extrinsic log-likelihood ratio (LLR) with known densities of the priori LLR. Then, we represent the OSD-based JD by bipartite graphs (BGs), and develop the DE framework by characterizing the density-transform features of nodes over the BG. Numerical examples show that the proposed DE framework accurately tracks the evolution of LLRs during the iterative decoding, especially at moderate-to-high SNRs. Based on the DE framework, we further analyze the BER performance of the OSD-based JD, and the convergence points of the two-user and equal-power systems.

cs.IT↗

arXiv2021

NOMA Joint Decoding based on Soft-Output Ordered-Statistics Decoder for Short Block Codes

In this paper, we design the joint decoding (JD) of non-orthogonal multiple access (NOMA) systems employing short block length codes. We first proposed a low-complexity soft-output ordered-statistics decoding (LC-SOSD) based on a decoding stopping condition, derived from approximations of the a-posterior probabilities of codeword estimates. Simulation results show that LC-SOSD has the similar mutual information transform property to the original SOSD with a significantly reduced complexity. Then, based on the analysis, an efficient JD receiver which combines the parallel interference cancellation (PIC) and the proposed LC-SOSD is developed for NOMA systems. Two novel techniques, namely decoding switch (DS) and decoding combiner (DC), are introduced to accelerate the convergence speed. Simulation results show that the proposed receiver can achieve a lower bit-error rate (BER) compared to the successive interference cancellation (SIC) decoding over the additive-white-Gaussian-noise (AWGN) and fading channel, with a lower complexity in terms of the number of decoding iterations.

cs.IT↗

arXiv2021

Improving Cell-Free Massive MIMO Detection Performance via Expectation Propagation

Cell-free (CF) massive multiple-input multiple-output (M-MIMO) technology plays a prominent role in the beyond fifth-generation (5G) networks. However, designing a high performance CF M-MIMO detector is a challenging task due to the presence of pilot contamination which appears when the number of pilot sequences is smaller than the number of users. This work proposes a CF M-MIMO detector referred to as CF expectation propagation (CF-EP) that incorporates the pilot contamination when calculating the posterior belief. The simulation results show that the proposed detector achieves significant improvements in terms of the bit-error rate and sum spectral efficiency performances as compared to the ones of the state-of-the-art CF detectors.

eess.SP↗

arXiv2021

A Linear Bayesian Learning Receiver Scheme for Massive MIMO Systems

Much stringent reliability and processing latency requirements in ultra-reliable-low-latency-communication (URLLC) traffic make the design of linear massive multiple-input-multiple-output (M-MIMO) receivers becomes very challenging. Recently, Bayesian concept has been used to increase the detection reliability in minimum-mean-square-error (MMSE) linear receivers. However, the latency processing time is a major concern due to the exponential complexity of matrix inversion operations in MMSE schemes. This paper proposes an iterative M-MIMO receiver that is developed by using a Bayesian concept and a parallel interference cancellation (PIC) scheme, referred to as a linear Bayesian learning (LBL) receiver. PIC has a linear complexity as it uses a combination of maximum ratio combining (MRC) and decision statistic combining (DSC) schemes to avoid matrix inversion operations. Simulation results show that the bit-error-rate (BER) and latency processing performances of the proposed receiver outperform the ones of MMSE and best Bayesian-based receivers by minimum $2$ dB and $19$ times for various M-MIMO system configurations.

cs.IT↗

arXiv2021

Bayesian-based Symbol Detector for Orthogonal Time Frequency Space Modulation Systems

Recently, the orthogonal time frequency space (OTFS) modulation is proposed for 6G wireless system to deal with high Doppler spread. The high Doppler spread happens when the transmitted signal is reflected towards the receiver by fast moving objects (e.g. high speed cars), which causes inter-carrier interference (ICI). Recent state-of-the-art OTFS detectors fail to achieve an acceptable bit-error-rate (BER) performance as the number of mobile reflectors increases which in turn, results in high inter-carrier-interference (ICI). In this paper, we propose a novel detector for OTFS systems, referred to as the Bayesian based parallel interference and decision statistics combining (B-PIC-DSC) OTFS detector that can achieve a high BER performance, under high ICI environments. The B-PIC-DSC OTFS detector employs the PIC and DSC schemes to iteratively cancel the interference, and the Bayesian concept to take the probability measure into the consideration when refining the transmitted symbols. Our simulation results show that in contrast to the state-of-the-art OTFS detectors, the proposed detector is able to achieve a BER of less than $10^{-5}$, when SNR is over $14$ dB, under high ICI environments.

eess.SP↗

arXiv2021

A Bayesian Receiver with Improved Complexity-Reliability Trade-off in Massive MIMO Systems

The stringent requirements on reliability and processing delay in the fifth-generation ($5$G) cellular networks introduce considerable challenges in the design of massive multiple-input-multiple-output (M-MIMO) receivers. The two main components of an M-MIMO receiver are a detector and a decoder. To improve the trade-off between reliability and complexity, a Bayesian concept has been considered as a promising approach that enhances classical detectors, e.g. minimum-mean-square-error detector. This work proposes an iterative M-MIMO detector based on a Bayesian framework, a parallel interference cancellation scheme, and a decision statistics combining concept. We then develop a high performance M-MIMO receiver, integrating the proposed detector with a low complexity sequential decoding for polar codes. Simulation results of the proposed detector show a significant performance gain compared to other low complexity detectors. Furthermore, the proposed M-MIMO receiver with sequential decoding ensures one order magnitude lower complexity compared to a receiver with stack successive cancellation decoding for polar codes from the 5G New Radio standard.

cs.IT↗

arXiv2019

Expectation Propagation Detector for Extra-Large Scale Massive MIMO

The order-of-magnitude increase in the dimension of antenna arrays, which forms extra-large-scale massive multiple-input-multiple-output (MIMO) systems, enables substantial improvement in spectral efficiency, energy efficiency, and spatial resolution. However, practical challenges, such as excessive computational complexity and excess of baseband data to be transferred and processed, prohibit the use of centralized processing. A promising solution is to distribute baseband data from disjoint subsets of antennas into parallel processing procedures coordinated by a central processing unit. This solution is called subarray-based architecture. In this work, we extend the application of expectation propagation (EP) principle, which effectively balances performance and practical feasibility in conventional centralized MIMO detector design, to fit the subarray-based architecture. Analytical results confirm the convergence of the proposed iterative procedure and that the proposed detector asymptotically approximates Bayesian optimal performance under certain conditions. The proposed subarray-based EP detector is reduced to centralized EP detector when only one subarray exists. In addition, we propose additional strategies for further reducing the complexity and overhead of the information exchange between parallel subarrays and the central processing unit to facilitate the practical implementation of the proposed detector. Simulation results demonstrate that the proposed detector achieves numerical stability within few iterations and outperforms its counterparts.

eess.SP↗