SearcharxivSearch

arXiv subjects

Kuntal Deka

Publications and source records attributed to Kuntal Deka.

At least 19 recordsLinked to original sources

On $\ell$-rank additive intersection pairs (RAIP) of codes

This paper introduces and studies \(\ell\)-rank additive intersection pairs (RAIP) of codes over finite fields for a given positive integer \(\ell\). The notion of \(\ell\)-RAIP provides a common framework that generalizes additive complementary dual (ACD) codes, additive complementary pairs (ACP) of codes, and the hull of an additive code. We establish necessary and sufficient conditions characterizing when a pair of additive codes forms an \(\ell\)-RAIP. Furthermore, for (q>2), we prove that any pair of additive codes is monomially equivalent to an ACP of codes. As a consequence, for (q>3), every additive code is monomially equivalent to an ACD code. { A key contribution of the paper is a general construction method for \(\ell\)-RAIP of codes derived from self-orthogonal additive codes, which yields families of \((\ell+1)\)-RAIP of codes under suitable conditions.} In addition, several explicit constructions of \(\ell\)-RAIP of codes are presented.

cs.IT

Twisted and Twisted Linearized Reed--Solomon Codes, LCD and ACD MDS constructions

We investigate a natural subfamily of twisted linearized Reed--Solomon (TLRS) codes in the sum-rank metric, where the twist is applied only to the constant term. We establish a simple necessary and sufficient condition for these codes to be linear complementary dual (LCD): the twisting parameter \(\eta\) must satisfy \(\eta^2 \neq -1\) in the underlying field. This criterion is independent of the evaluation subgroup, the dimension parameter, and the twisting exponent (subject only to a mild restriction on the code length). Furthermore, we construct infinite families of additive twisted linearized Reed--Solomon codes that are simultaneously additive complementary dual (ACD) and maximum distance separable (MDS) over quadratic extensions \(\mathbb{F}_{q^2}\), with respect to the trace-Hermitian inner product. These codes are explicit and achieve optimal parameters for all admissible lengths.

cs.IT

Tertiary-Mode STAR-RIS for Secure NOMA: Integrating Transmission, Reflection, and Jamming

This paper investigates the physical layer security of a non-orthogonal multiple access (NOMA) system assisted by a tertiary-mode simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS), which can perform transmission, reflection, and jamming simultaneously. The system comprises a base station (BS) serving two users located on opposite sides of the STAR-RIS, assuming perfect channel state information (CSI) at the transmitter. To enhance secrecy performance, a subset of STAR-RIS elements is adaptively configured for jamming. A penalty-based alternating optimization algorithm is developed to jointly optimize the BS's active beamforming and the STAR-RIS's passive beamforming and mode selection. Simulation results demonstrate that the proposed design substantially improves the achievable sum rate and secrecy performance compared to conventional RIS-assisted and no-RIS benchmarks, highlighting the potential of tertiary-mode STAR-RIS for secure and efficient next-generation wireless communications.

eess.SP

Optimally Deployed Multistatic OTFS-ISAC Design With Kalman-Based Tracking of Targets

This paper studies orthogonal time-frequency space (OTFS) modulation aided multistatic integrated sensing and communication (ISAC) in vehicular networks, whereby its delay-Doppler robustness is exploited for enhanced communication and high-resolution sensing. We present a triangulation-based deployment framework combined with Kalman filtering (KF) that enables accurate target localization and velocity estimation. In addition, we assess the ISAC performance in the multistatic topology to determine its effectiveness in the dynamic environment. Further, a suboptimal placement strategy for the multistatic receivers is devised to reduce the targets' localization error. Numerical results demonstrate significant reductions in the sensing error and bit error rate (BER) performances.

cs.NI

Hermitian LCD $2$-Quasi Abelian Codes over Finite Chain Rings

This paper introduces a class of Hermitian LCD $2$-quasi-abelian codes over finite fields and presents a comprehensive enumeration of these codes in which relative minimum weights are small. We show that such codes are asymptotically good over finite fields. Furthermore, we extend our analysis to finite chain rings by characterizing $2$-quasi-abelian codes in this setting and proving the existence of asymptotically good Hermitian LCD $2$-quasi-abelian codes over finite chain rings as well.

cs.IT

Vehicular Multistatic OTFS-ISAC: A Geometry-Aware Deployment and Kalman-Based Tracking

Integrated sensing and communication (ISAC) is a promising paradigm for next-generation vehicular networks, yet existing orthogonal frequency-division multiplexing (OFDM)-based designs suffer from limited spatial diversity and severe sensitivity to Doppler and multipath effects. While orthogonal time-frequency space (OTFS) modulation offers robustness under high mobility, the impact of spatial node deployment in multistatic OTFS-ISAC has remained largely unexplored. This paper presents the first geometry-aware multistatic OTFS-ISAC framework, in which a triangulation-based cooperative sensing approach is developed for joint target localization and velocity estimation. Closed-form expressions for the localization error covariance are derived under general receiver topologies, revealing that maximizing the triangulation area is fundamental to minimizing estimation error. This leads to a near-optimal deployment strategy based on orthogonal receiver placement and its equivalence to multi-antenna architectures with cubic-order error reduction. To enable reliable tracking of moving targets, a correlated random walk (CRW)-based Kalman filter (KF) framework is integrated into multistatic OTFS-ISAC for active sensing and ISAC. Numerical results demonstrate significant reductions in localization root-mean-square error (RMSE) and communication bit error rate (BER), highlighting the effectiveness of geometry-aware, KF-assisted multistatic OTFS-ISAC in dynamic vehicular environments.

cs.NI

Trace duality and additive complementary pairs of additive cyclic codes over finite chain rings

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are free modules. Moreover, we present a necessary and sufficient condition for a pair of additive cyclic codes over a finite commutative ring to form an additive complementary pair. Finally, we construct a complementary pair of additive cyclic codes over a finite chain ring and show that one of the codes is permutation equivalent to the trace dual of the other.

cs.IT

Comprehensive Review of Deep Unfolding Techniques for Next-Generation Wireless Communication Systems

The application of machine learning in wireless communications has been extensively explored, with deep unfolding emerging as a powerful model-based technique. Deep unfolding enhances interpretability by transforming complex iterative algorithms into structured layers of deep neural networks (DNNs). This approach seamlessly integrates domain knowledge with deep learning (DL), leveraging the strengths of both methods to simplify complex signal processing tasks in communication systems. To provide a solid foundation, we first present a brief overview of DL and deep unfolding. We then explore the applications of deep unfolding in key areas, including signal detection, channel estimation, beamforming design, decoding for error-correcting codes, sensing and communication, power allocation, and security. Each section focuses on a specific task, highlighting its significance in emerging 6G technologies and reviewing recent advancements in deep unfolding-based solutions. Finally, we discuss the challenges associated with developing deep unfolding techniques and propose potential improvements to enhance their applicability across diverse wireless communication scenarios.

eess.SP

Hybrid Rate-Splitting and Sparse Code Multiple Access (RS-SCMA): Design and Performance

This paper proposes, for the first time, a hybrid multiple access framework that integrates the principles of rate-splitting (RS) and sparse code multiple access (SCMA) in an SISO downlink scenario. The proposed scheme, termed RS-SCMA, unifies the powerful interference management capability of rate-splitting multiple access (RSMA) with the near-optimal multiuser detection of SCMA. A key feature of RS-SCMA is a tunable splitting factor $\alpha$, which governs the allocation between the generic $M$-ary modulated common messages and SCMA-encoded private messages. This enables dynamic control over the fundamental trade-off between system sum-rate, bit error rate (BER), and the overloading factor. We develop novel transmitter and receiver architectures based on soft successive interference cancellation (SIC), incorporating message passing algorithm (MPA) detection and soft-symbol reconstruction. Furthermore, a unified analytical expression for the achievable sum-rate is derived as a function of the splitting factor $\alpha$. The performance of the proposed RS-SCMA system is evaluated in terms of both BER and sum-rate. Simulation results confirm the superiority of RS-SCMA over conventional SCMA and multi-carrier RSMA, demonstrating its scalability and robustness even in the presence of channel estimation errors.

eess.SP

Prior Information-Aided ADMM for Multi-User Detection in Codebook-Based Grant-Free NOMA: Dynamic Scenarios

Code-domain non-orthogonal multiple access (CD-NOMA) systems offer key benefits such as high spectral efficiency, low latency, high reliability, and massive connectivity. NOMA's ability to handle overloading allows multiple devices to share a single resource element (RE) for data transmission. In CD-NOMA, different users are assigned distinct codewords, which are leveraged during multi-user detection (MUD). Codebook-based NOMA systems outperform spread-sequence (SS)-based NOMA due to the coding gains provided by the codebooks. Sparse code multiple access (SCMA) and dense code multiple access (DCMA) are two prominent examples of such systems. Additionally, NOMA is seen as a crucial technology for enabling grant-free access, especially in massive machine-type communications (mMTC). One of the main challenges in deploying grant-free NOMA systems is accurately detecting both user activity and transmitted data, particularly when user activity fluctuates dynamically across the transmission frame. This paper introduces codebook-based grant-free NOMA systems modeled using a block sparsity signal structure. The joint activity and data detection (JADD) problem in these systems is formulated as group LASSO and sparse group LASSO block compressive sensing (BCS) problems. To address these, a robust prior information-aided alternating direction method of multipliers (ADMM) algorithm is proposed. Extensive numerical experiments and theoretical analysis show the efficiency of the proposed algorithm, making it a suitable solution for mMTC networks.

eess.SP

IRS-Assisted OTFS: Beamforming Design and Signal Detection

Intelligent reflecting surface (IRS) technology has become a crucial enabler for creating cost effective, innovative, and adaptable wireless communication environments. This study investigates an IRS-assisted orthogonal time frequency space (OTFS) modulation that facilitates communication between users and the base station (BS). The users attainable downlink rate can be boosted by collaboratively improving the reflection coefficient (RC) matrix at the IRS and beamforming matrix at the BS. Then, in the IRS-aided OTFS network, the problem of cooperative precoding at BS and IRS to improve the network throughput is framed. The precoding design problem is non-convex and highly complicated; an alternate optimization (AO) approach is proposed to solve this. Specifically, an approach based on strongest tap maximization (STM) and fractional programming is proposed. It solves RC matrix (at IRS) and beamforming matrix (at BS) alternatively. Moreover, an efficient signal detector for IRS-aided OTFS communication systems using the alternating direction method of multipliers (ADMM) is proposed. Finally, to estimate the cascaded MIMO channel, using a parallel factor tensor model that separates the IRS-User and BS-IRS MIMO channels, respectively is suggested. Simulation results show that the proposed method significantly enhances the system capacity and bit error rate (BER) performance compared to conventional OTFS.

eess.SP

Sparse Code Multiple Access (SCMA) Technique

Next-generation wireless networks require higher spectral efficiency and lower latency to meet the demands of various upcoming applications. Recently, non-orthogonal multiple access (NOMA) schemes are introduced in the literature for 5G and beyond. Various forms of NOMA are considered like power domain, code domain, pattern division multiple access, etc. to enhance the spectral efficiency of wireless networks. In this chapter, we introduce the code domain-based sparse code multiple access (SCMA) NOMA scheme to enhance the spectral efficiency of a wireless network. The design and detection of an SCMA system are analyzed in this chapter. Also, the method for codebooks design and its impact on system performance are highlighted. A hybrid multiple access scheme is also introduced using both code-domain and power-domain NOMA. Furthermore, simulation results are included to show the impact of various SCMA system parameters.ext-generation wireless networks require higher spectral efficiency and lower latency to meet the demands of various upcoming applications. Recently, non-orthogonal multiple access (NOMA) schemes are introduced in the literature for 5G and beyond. Various forms of NOMA are considered like power domain, code domain, pattern division multiple access, etc. to enhance the spectral efficiency of wireless networks. In this chapter, we introduce the code domainbased sparse code multiple access (SCMA) NOMA scheme to enhance the spectral efficiency of a wireless network. The design and detection of an SCMA system are analyzed in this chapter. Also, the method for codebooks design and its impact on system performance are highlighted. A hybrid multiple access scheme is also introduced using both code-domain and power-domain NOMA. Furthermore, simulation results are included to show the impact of various SCMA system parameters.

eess.SP

Joint Optimization of IRS Deployment and Passive Beamforming to Enhance the Received Power

Intelligent reflecting surface (IRS) has recently emerged as a promising technology for beyond fifth-generation (B5G) and 6G networks conceived from metamaterials that smartly tunes the signal reflections via a large number of low-cost passive reflecting elements. However, the IRS-assisted communication model and the optimization of available resources needs to be improved further for more efficient communications. This paper investigates the enhancement of received power at the user end in an IRS assisted wireless communication by jointly optimizing the phase shifts at the IRS elements and its location. Employing the conventional Friss transmission model, the relationship between the transmitted power and reflected power is established. The expression of received power incorporates the free space loss, reflection loss factor, physical dimension of the IRS panel, and radiation pattern of the transmit signal. Also, the expression of reflection coefficient of IRS panel is obtained by exploiting the existing data of radar communications. Initially exploring a single IRS element within a two-ray reflection model, we extend it to a more complex multi-ray reflection model with multiple IRS elements in 3D Cartesian space. The received power expression is derived in a more tractable form, then, it is maximized by jointly optimizing the underlying underlying variables, the IRS location and the phase shifts. To realize the joint optimization of underlying variables, first, the phase shifts of the IRS elements are optimized to achieve constructive interference of received signal components at the user. Subsequently, the location of the IRS is optimized at the obtained optimal phase shifts. Numerical insights and performance comparison reveal that joint optimization leads to a substantial 37% enhancement in received power compared to the closest competitive benchmark scheme.

cs.IT

ADMM-based Detector for Large-scale MIMO Code-domain NOMA Systems

Large-scale multi-input multi-output (MIMO) code domain non-orthogonal multiple access (CD-NOMA) techniques are one of the potential candidates to address the next-generation wireless needs such as massive connectivity, and high reliability. This work focuses on two primary CD-NOMA techniques: sparse-code multiple access (SCMA) and dense-code multiple access (DCMA). One of the primary challenges in implementing MIMO-CD-NOMA systems is designing the optimal detector with affordable computation cost and complexity. This paper proposes an iterative linear detector based on the alternating direction method of multipliers (ADMM). First, the maximum likelihood (ML) detection problem is converted into a sharing optimization problem. The set constraint in the ML detection problem is relaxed into the box constraint sharing problem. An alternative variable is introduced via the penalty term, which compensates for the loss incurred by the constraint relaxation. The system models, i.e., the relation between the input signal and the received signal, are reformulated so that the proposed sharing optimization problem can be readily applied. The ADMM is a robust algorithm to solve the sharing problem in a distributed manner. The proposed detector leverages the distributive nature to reduce per-iteration cost and time. An ADMM-based linear detector is designed for three MIMO-CD-NOMA systems: single input multi output CD-NOMA (SIMO-CD-NOMA), spatial multiplexing CD-NOMA (SMX-CD-NOMA), and spatial modulated CD-NOMA (SM-CD-NOMA). The impact of various system parameters and ADMM parameters on computational complexity and symbol error rate (SER) has been thoroughly examined through extensive Monte Carlo simulations.

cs.IT

Convolutional Sparse Coding based Channel Estimation for OTFS-SCMA in Uplink

Orthogonal time frequency space (OTFS) has emerged as the most sought-after modulation technique in a high mobility scenario. Sparse code multiple access (SCMA) is an attractive code-domain non-orthogonal multiple access (NOMA) technique. Recently a code-domain NOMA approach for OTFS, named OTFS-SCMA, is proposed. OTFS-SCMA is a promising framework that meets the demands of high mobility and massive connectivity. This paper presents a channel estimation technique based on the convolutional sparse coding (CSC) approach for OTFS-SCMA in the uplink. The channel estimation task is formulated as a CSC problem following a careful rearrangement of the OTFS input-output relation. We use an embedded pilot-aided sparse-pilot structure that enjoys the features of both OTFS and SCMA. The existing channel estimation techniques for OTFS in multi-user scenarios for uplink demand extremely high overhead for pilot and guard symbols, proportional to the number of users. The proposed method maintains a minimal overhead equivalent to a single user without compromising on the estimation error. The results show that the proposed channel estimation algorithm is very efficient in bit error rate (BER), normalized mean square error (NMSE), and spectral efficiency (SE).

eess.SP

Design of SCMA Codebooks Using Differential Evolution

Non-orthogonal multiple access (NOMA) is a promising technology which meets the demands of massive connectivity in future wireless networks. Sparse code multiple access (SCMA) is a popular code-domain NOMA technique. The effectiveness of SCMA comes from: (1) the multi-dimensional sparse codebooks offering high shaping gain and (2) sophisticated multi-user detection based on message passing algorithm (MPA). The codebooks of the users play the main role in determining the performance of SCMA system. This paper presents a framework to design the codebooks by taking into account the entire system including the SCMA encoder and the MPA-based detector. The symbol-error rate (SER) is considered as the design criterion which needs to be minimized. Differential evolution (DE) is used to carry out the minimization of the SER over the codebooks. The simulation results are presented for various channel models.

cs.IT

Hybrid NOMA for Future Radio Access: Design, Potentials and Limitations

Next-generation internet of things (IoT) applications need trillions of low-powered wireless mobile devices to connect with each other having ultra-reliability and low-latency. Non-orthogonal multiple access (NOMA) is a promising technology to address massive connectivity for 5G and beyond by accommodating several users within the same orthogonal resource block. Therefore, this article explores hybrid NOMA (HNOMA) for massive multiple access in the uplink scenarios due to its higher spectral efficiency. The HNOMA includes both power domain and code domain NOMA method due to diverse channel conditions in practice. We highlight that polar coded based data transmission can achieve higher reliability and lower latency in HNOMA-based wireless networks. Further, at the base station (BS), channel state information (CSI) of each link is not perfectly available or very complex to estimate due to non-orthogonal links. Therefore, we analyze and review the performance of uplink based system involving HNOMA transmission in the presence of imperfect CSI. Furthermore, we summarize some key technical challenges as well as their potential solutions in futuristic IoT applications using HNOMA transmission. Finally, we offer some design guidelines for HNOMA-based systems using deep learning approach to implement adaptive and efficient wireless networks.

eess.SP

Design of Puncturing for Length-Compatible Polar Codes Using Differential Evolution

This paper presents a puncturing technique to design length-compatible polar codes. The punctured bits are identified with the help of differential evolution (DE). A DE-based optimization framework is developed where the sum of the bit-error-rate (BER) values of the information bits is minimized. We identify a set of bits which can be avoided for puncturing in the case of additive white Gaussian noise (AWGN) channels. This reduces the size of the candidate puncturing patterns. Simulation results confirm the superiority of the proposed technique over other state-of-the-art puncturing methods.

cs.IT