arXiv subjects

Alireza Bayesteh

Publications and source records attributed to Alireza Bayesteh.

At least 19 recordsLinked to original sources

arXiv2023

Practical Channel Splicing using OFDM Waveforms for Joint Communication and Sensing in the IoT

Channel splicing is a rather new and very promising concept. It allows to realize a wideband channel sounder by combining multiple narrow-band measurements. Among others, channel splicing is a sparse sensing techniques suggested for use in joint communication and sensing (JCAS), channel measurements and prediction using cheap hardware that cannot measure wideband channels directly such as in the internet of things (IoT). This work validates the practicality of a channel splicing technique by integrating it into an OFDM-based IEEE 802.11ac system, which we consider representative for many IoT solutions. Our system allows computing both the channel impulse response (CIR) and the channel frequency response (CFR). In this paper, we concentrate on the impact of the number of sub-bands in our study and show that even using only 50% of the overall spectrum leads to very accurate CIR measures. We validate the system in simulation and confirm the results in an experimental in-door scenario using software defined radios.

cs.NI↗

arXiv2022

Unsourced Random Access with Threshold$-$Based Feedback

In this paper we focus on a feedback mechanism for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) as well as the feedback packet format that allows the users to estimate their channels and infer positive or negative feedback based on the presented thresholding algorithm. We demonstrate that the proposed feedback imposes a much smaller complexity burden on the users compared to the feedback that positively acknowledges all successful or negatively acknowledges all undecoded users. We also show that the proposed feedback technique can lead to a substantial reduction in the packet error rates and signal-to-noise ratios (SNR)s required to support various numbers of active users in the system.

cs.IT↗

arXiv2018

Towards the Standardization of Non-orthogonal Multiple Access for Next Generation Wireless Networks

Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing can root back to the network information theory. For generations of wireless communication systems design, orthogonal multiple access (OMA) schemes in time, frequency, or code domain have been the main choices due to the limited processing capability in the transceiver hardware, as well as the modest traffic demands in both latency and connectivity. However, for the next generation radio systems, given its vision to connect everything and the much evolved hardware capability, NoMA has been identified as a promising technology to help achieve all the targets in system capacity, user connectivity, and service latency. This article will provide a systematic overview of the state-of-the-art design of the NoMA transmission based on a unified transceiver design framework, the related standardization progress, and some promising use cases in future cellular networks, based on which the interested researchers can get a quick start in this area.

cs.IT↗

arXiv2015

SCMA for Open-Loop Joint Transmission CoMP

Sparse Code Multiple Access (SCMA), a non-orthogonal multiple access scheme, has been introduced as a key 5G technology to improve spectral efficiency. In this work, we propose SCMA to enable open-loop coordinated multipoint (CoMP) joint transmission (JT). The scheme combines CoMP techniques with multi-user SCMA (MU-SCMA) in downlink. This scheme provides open-loop user multiplexing and JT in power and code domains, with robustness to mobility and low overhead of channel state information (CSI) acquisition. The combined scheme is called MU-SCMA-CoMP, in which SCMA layers and transmit power of multiple transmit points (TPs) are shared among multiple users while a user may receive multiple SCMA layers from multiple TPs within a CoMP cluster. The benefits of the proposed scheme includes: i) drastic overhead reduction of CSI acquisition, ii) significant increase in throughput and coverage, and iii) robustness to channel aging. Various algorithms of MU-SCMA-CoMP are presented, including the detection strategy, power sharing optimization, and scheduling. System level evaluation shows that the proposed schemes provide significant throughput and coverage gains over OFDMA for both pedestrian and vehicular users.

cs.IT↗

arXiv2014

SCMA Codebook Design

Multicarrier CDMA is a multiple access scheme in which modulated QAM symbols are spread over OFDMA tones by using a generally complex spreading sequence. Effectively, a QAM symbol is repeated over multiple tones. Low density signature (LDS) is a version of CDMA with low density spreading sequences allowing us to take advantage of a near optimal message passing algorithm (MPA) receiver with practically feasible complexity. Sparse code multiple access (SCMA) is a multi-dimensional codebook-based non-orthogonal spreading technique. In SCMA, the procedure of bit to QAM symbol mapping and spreading are combined together and incoming bits are directly mapped to multi-dimensional codewords of SCMA codebook sets. Each layer has its dedicated codebook. Shaping gain of a multi-dimensional constellation is one of the main sources of the performance improvement in comparison to the simple repetition of QAM symbols in LDS. Meanwhile, like LDS, SCMA enjoys the low complexity reception techniques due to the sparsity of SCMA codewords. In this paper a systematic approach is proposed to design SCMA codebooks mainly based on the design principles of lattice constellations. Simulation results are presented to show the performance gain of SCMA compared to LDS and OFDMA.

cs.IT↗

arXiv2014

Uplink Contention Based SCMA for 5G Radio Access

Fifth generation (5G) wireless networks are expected to support very diverse applications and terminals. Massive connectivity with a large number of devices is an important requirement for 5G networks. Current LTE system is not able to efficiently support massive connectivity, especially on the uplink (UL). Among the issues arise due to massive connectivity is the cost of signaling overhead and latency. In this paper, an uplink contention-based sparse code multiple access (SCMA) design is proposed as a solution. First, the system design aspects of the proposed multiple-access scheme are described. The SCMA parameters can be adjusted to provide different levels of overloading, thus suitable to meet the diverse traffic connectivity requirements. In addition, the system-level evaluations of a small packet application scenario are provided for contention-based UL SCMA. SCMA is compared to OFDMA in terms of connectivity and drop rate under a tight latency requirement. The simulation results demonstrate that contention-based SCMA can provide around 2.8 times gain over contention-based OFDMA in terms of supported active users. The uplink contention-based SCMA scheme can be a promising technology for 5G wireless networks for data transmission with low signaling overhead, low delay, and support of massive connectivity.

cs.IT↗

arXiv2014

SCMA for Downlink Multiple Access of 5G Wireless Networks

Sparse code multiple access (SCMA) is a new frequency domain non-orthogonal multiple-access technique which can improve spectral efficiency of wireless radio access. With SCMA, different incoming data streams are directly mapped to codewords of different multi-dimensional cookbooks, where each codeword represents a spread transmission layer. Multiple SCMA layers share the same time-frequency resources of OFDMA. The sparsity of codewords makes the near-optimal detection feasible through iterative message passing algorithm (MPA). Such low complexity of multi-layer detection allows excessive codeword overloading in which the dimension of multiplexed layers exceeds the dimension of codewords. Optimization of overloading factor along with modulation-coding levels of layers provides a more flexible and efficient link-adaptation mechanism. On the other hand, the signal spreading feature of SCMA can improve link-adaptation as a result of less colored interference. In this paper a technique is developed to enable multi-user SCMA (MU-SCMA) for downlink wireless access. User pairing, power sharing, rate adjustment, and scheduling algorithms are designed to improve the downlink throughput of a heavily loaded network. The advantage of SCMA spreading for lightly loaded networks is also evaluated.

cs.IT↗

arXiv2009

Diversity-Multiplexing Tradeoff in Multi-Antenna Multi-Relay Networks: Improvements and Some Optimality Results

This paper investigates the benefits of Amplify-and-Forward (AF) relaying in the setup of multi-antenna wireless networks. The concept of Random Sequential (RS) relaying is previously introduced in the literature and showed that it achieves the maximum diversity gain in a general multi-antenna network. Here, we show that random unitary matrix multiplication at the relay nodes empowers the RS scheme to achieve a better Diversity-Multiplexing Tradeoff (DMT) as compared to the traditional AF relaying. First, we study the case of a multi-antenna full-duplex single-relay two-hop network, for which we show that the RS achieves the optimum DMT. Applying this result, we derive a new achievable DMT for the case of multi-antenna half-duplex parallel relay network. Interestingly, it turns out that the DMT of the RS scheme is optimum for the case of multi-antenna two parallel non-interfering half-duplex relays. Next, we show that random unitary matrix multiplication also improves the DMT of the Non-Orthogonal AF relaying scheme in the case of a multi-antenna single relay channel. Finally, we study the general case of multi-antenna full-duplex relay networks and derive a new lower-bound on its DMT using the RS scheme.

cs.IT↗

arXiv2009

Randomized vs. orthogonal spectrum allocation in decentralized networks: Outage Analysis

We address a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of users $N$ is a random variable with a given distribution and the channel gains are quasi-static Rayleigh fading. The transmitters are assumed to be unaware of the number of active users in the network as well as the channel gains and not capable of detecting the presence of other users in a given frequency sub-band. Moreover, the users are unaware of each other's codebooks and hence, no multiuser detection is possible. We consider a randomized Frequency Hopping (FH) scheme in which each transmitter randomly hops over a subset of the $u$ sub-bands from transmission to transmission. Developing a new upper bound on the differential entropy of a mixed Gaussian random vector and using entropy power inequality, we offer a series of lower bounds on the achievable rate of each user. Thereafter, we obtain lower bounds on the maximum transmission rate per user to ensure a specified outage probability at a given Signal-to-Noise Ratio (SNR) level. We demonstrate that the so-called outage capacity can be considerably higher in the FH scheme than in the Frequency Division (FD) scenario for reasonable distributions on the number of active users. This guarantees a higher spectral efficiency in FH compared to FD.

cs.IT↗

arXiv2009

A model for randomized resource allocation in decentralized wireless networks

In this paper, we consider a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of active users is a random variable with a given probability mass function. Moreover, users are unaware of each other's codebooks and hence, no multiuser detection is possible. We propose a randomized Frequency Hopping (FH) scheme in which each transmitter randomly hops over a subset of $u$ sub-bands from transmission to transmission. We derive lower and upper bounds on the mutual information of each user and demonstrate that, for large Signal-to-Noise Ratio (SNR) values, the two bounds coincide. This observation enables us to compute the sum multiplexing gain of the system and obtain the optimum hopping strategy for maximizing this quantity. We compare the performance of the FH system with that of the Frequency Division (FD) system in terms of several performance measures and show that (depending on the probability mass function of the number of active users) the FH system can offer a significant improvement implying a more efficient usage of the spectrum.

cs.IT↗

arXiv2009

On the Delay-Throughput Tradeoff in Distributed Wireless Networks

This paper deals with the delay-throughput analysis of a single-hop wireless network with $n$ transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with shadowing, described by parameters $(α,\varpi)$, where $α$ denotes the probability of shadowing and $\varpi$ represents the average cross-link gains. The analysis relies on the distributed on-off power allocation strategy (i.e., links with a direct channel gain above a certain threshold transmit at full power and the rest remain silent) for the deterministic and stochastic packet arrival processes. It is also assumed that each transmitter has a buffer size of one packet and dropping occurs once a packet arrives in the buffer while the previous packet has not been served. In the first part of the paper, we define a new notion of performance in the network, called effective throughput, which captures the effect of arrival process in the network throughput, and maximize it for different cases of packet arrival process. It is proved that the effective throughput of the network asymptotically scales as $\frac{\log n}{\hatα}$, with $\hatα \triangleq α\varpi$, regardless of the packet arrival process. In the second part of the paper, we present the delay characteristics of the underlying network in terms of the packet dropping probability. We derive the sufficient conditions in the asymptotic case of $n \to \infty$ such that the packet dropping probability tend to zero, while achieving the maximum effective throughput of the network. Finally, we study the trade-off between the effective throughput, delay, and packet dropping probability of the network for different packet arrival processes.

cs.IT↗

arXiv2009

Multilevel Coding over Two-Hop Single-User Networks

In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with a single antenna and the Channel State Information (CSI) of each hop is not available at the corresponding transmitter. The relay is assumed to be simple, i.e., not capable of data buffering over multiple coding blocks, water-filling over time, or rescheduling. A commonly used design criterion in such configurations is the maximization of the average received rate at the destination. We show that using a continuum of multilevel codes at both the source and the relay, in conjunction with decode and forward strategy at the relay, performs optimum in this setup. In addition, we present a scheme to optimally allocate the available source and relay powers to different levels of their corresponding codes. The performance of this scheme is evaluated assuming Rayleigh fading and compared with the previously known strategies.

cs.IT↗

arXiv2008

On the Throughput Maximization in Dencentralized Wireless Networks

A distributed single-hop wireless network with $K$ links is considered, where the links are partitioned into a fixed number ($M$) of clusters each operating in a subchannel with bandwidth $\frac{W}{M}$. The subchannels are assumed to be orthogonal to each other. A general shadow-fading model, described by parameters $(α,\varpi)$, is considered where $α$ denotes the probability of shadowing and $\varpi$ ($\varpi \leq 1$) represents the average cross-link gains. The main goal of this paper is to find the maximum network throughput in the asymptotic regime of $K \to \infty$, which is achieved by: i) proposing a distributed and non-iterative power allocation strategy, where the objective of each user is to maximize its best estimate (based on its local information, i.e., direct channel gain) of the average network throughput, and ii) choosing the optimum value for $M$. In the first part of the paper, the network hroughput is defined as the \textit{average sum-rate} of the network, which is shown to scale as $Θ(\log K)$. Moreover, it is proved that in the strong interference scenario, the optimum power allocation strategy for each user is a threshold-based on-off scheme. In the second part, the network throughput is defined as the \textit{guaranteed sum-rate}, when the outage probability approaches zero. In this scenario, it is demonstrated that the on-off power allocation scheme maximizes the throughput, which scales as $\frac{W}{α\varpi} \log K$. Moreover, the optimum spectrum sharing for maximizing the average sum-rate and the guaranteed sum-rate is achieved at M=1.

cs.IT↗

arXiv2008

On the Diversity-Multiplexing Tradeoff in Multiple-Relay Network

This paper studies the setup of a multiple-relay network in which $K$ half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are assumed to be either connected through a quasi-static Rayleigh fading channel, or disconnected. We propose a new scheme, which we call \textit{random sequential} (RS), based on the amplify-and-forward relaying. We prove that for general multiple-antenna multiple-relay networks, the proposed scheme achieves the maximum diversity gain. Furthermore, we derive diversity-multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. It is shown that for single-antenna two-hop multiple-access multiple-relay ($K>1$) networks (without direct link between the transmitter(s) and the receiver), the proposed RS scheme achieves the optimum DMT. However, for the case of multiple access single relay setup, we show that the RS scheme reduces to the naive amplify-and-forward relaying and is not optimum in terms of DMT, while the dynamic decode-and-forward scheme is shown to be optimum for this scenario.

cs.IT↗

arXiv2008

On the Capacity of Wireless Multicast Networks

The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information is available only at the receiver side and single antenna nodes, the highest expected rate achievable by a random user in the network, called expected typical rate, is derived in two scenarios: hard coverage constraint and soft coverage constraint. In the first case, the coverage is expressed in terms of the outage probability, while in the second case, the expected rate should satisfy certain minimum requirement. It is shown that the optimum solution in both cases (achieving the highest expected typical rate for given coverage requirements) is achieved by an infinite layer superposition code for which the optimum power allocation among the different layers is derived. For the MISO case, a suboptimal coding scheme is proposed, which is shown to be asymptotically optimal, when the number of transmit antennas grows at least logarithmically with the number of users in the network.

cs.IT↗

arXiv2007

Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network

In this paper, a multiple-relay network in considered, in which $K$ single-antenna relays assist a single-antenna transmitter to communicate with a single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF) scheme is proposed for this network and is shown to achieve the optimum diversity-multiplexing trade-off curve.

cs.IT↗

arXiv2007

Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network

This paper considers the setup of a parallel MIMO relay network in which $K$ relays, each equipped with $N$ antennas, assist the transmitter and the receiver, each equipped with $M$ antennas, in the half-duplex mode, under the assumption that $N\geq{M}$. This setup has been studied in the literature like in \cite{nabar}, \cite{nabar2}, and \cite{qr}. In this paper, a simple scheme, the so-called Incremental Cooperative Beamforming, is introduced and shown to achieve the capacity of the network in the asymptotic case of $K\to{\infty}$ with a gap no more than $O(\frac{1}{\log(K)})$. This result is shown to hold, as long as the power of the relays scales as $ω(\frac{\log^9(K)}{K})$. Finally, the asymptotic SNR behavior is studied and it is proved that the proposed scheme achieves the full multiplexing gain, regardless of the number of relays.

cs.IT↗

arXiv2007

Scheduling and Codeword Length Optimization in Time Varying Wireless Networks

In this paper, a downlink scenario in which a single-antenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. It is assumed that channel state information is perfectly known at each receiver, while the statistical characteristics of the fading process and the fading gain at the beginning of each frame are known to the transmitter. By evaluating the random coding error exponent of the time-correlated fading channel, it is shown that there is an optimal codeword length which maximizes the throughput. The throughput of the conventional scheduling that transmits to the user with the maximum signal to noise ratio is examined using both fixed length codewords and variable length codewords. Although optimizing the codeword length improves the performance, it is shown that using the conventional scheduling, the gap between the achievable throughput and the maximum possible throughput of the system tends to infinity as K goes to infinity. A simple scheduling that considers both the signal to noise ratio and the channel time variation is proposed. It is shown that by using this scheduling, the gap between the achievable throughput and the maximum throughput of the system approaches zero.

cs.IT↗