Search

Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in {−1, 1}). If $f$ is a nonzero sequence, then its autocorrelation demerit factor, $\text {ADF}(f)$ , is the sum of the squared magnitudes of the aperiodic autocorrelation values over all nonzero shifts for the sequence obtained by normalizing $f$ to have unit Euclidean norm. If $(f,g)$ is a pair of nonzero sequences, then their crosscorrelation demerit factor, $\text {CDF}(f,g)$ , is the sum of the squared magnitudes of the aperiodic crosscorrelation values over all shifts for the sequences obtained by normalizing both $f$ and $g$ to have unit Euclidean norm. Pursley and Sarwate showed that for binary sequences, the sum of $\text {CDF}(f,g)$ and the geometric mean of $\text {ADF}(f)$ and $\text {ADF}{(g)}$ must be at least 1. For randomly selected pairs of long binary sequences, this quantity is typically around 2. In this paper, we show that Pursley and Sarwate’s bound is met for binary sequences precisely when $(f,g)$ is a Golay complementary pair. We also prove a generalization of this result for sequences whose terms are arbitrary complex numbers. We investigate constructions that produce infinite families of Golay complementary pairs, and compute the asymptotic values of autocorrelation and crosscorrelation demerit factors for such families. [ABSTRACT FROM AUTHOR]

This paper proposes the combined use of two promising techniques in the design of 5G systems: fractal antennas and smart antennas. This new arrangement is capable to operating efficiently in multiband while directing the beam to the region of interest, promoting a better use of the spectrum and therefore allowing multiplesbeamforming to share resources in the time and frequency domain, an essential requirement for the fifth generation. In addition, the proposed array can be availed in projects that still use the previous generation technology, 4G, which would allow a more economically viable transition to 5G, especially for Latin American countries.A new type of smart fractal antenna is simulatedfor a wide range of frequencies.The parameters chosen for measuring the performance of the structure are the return loss, the radiation diagram and the 3D polar diagram, the most used in the literature. The proposed antenna achieved a return loss of -36 dB for 20.6 GHz and a notable gain of 15 dB, operating in multiband. These values are compared with other works already carried out by other researchers, which allows us to conclude that the proposed antenna is suitable for modern 5G communications. [ABSTRACT FROM AUTHOR]

This paper proposes a Hierarchical Rate Splitting (HRS)-based and Macro Base Station (MBS)-assisted cooperative content delivery scheme for Cache-enabled Cloud Radio Access Networks (C $^{2}$ -RANs). In this scheme, a user is served by a cluster of Small Base Stations (SBSs) that cache contents. If the user-requested content is missing in its cache, the SBS retrieves it from the central processor (backhaul link) and the MBS (wireless broadcast). We minimize the total delay of this system. We thus optimize user grouping, decoding order, RS variables, BS clustering, and beamforming subject to the transmit power and backhaul capacity constraints. This process formulates a non-convex problem, which we decouple into three subproblems. First, we must pair users to reduce intra-group interference. We thus develop a Low-Complexity User Pairing (LCUP) algorithm. Second, we optimize the decoding order to minimize the broadcast link delay. We, therefore, propose a Dynamic Delay-based Decoding Order Update (D $^{3}$ OU) algorithm. Third, we jointly design the RS variables, beamforming, and BS clustering. We use surrogate optimization via the Quadratic Transform (QT), Woodbury matrix identity, and Taylor expansion. We then recast this problem to a Two-Tier Alternating (TTA) problem, which we solve with closed-form (outer tier) and convex (inner tier) formulations. We integrate these algorithms to propose an overall algorithm. It achieves significant performance gains and a 3-fold reduction in time-complexity over the standard Semi-Definite Relaxation (SDR)-based algorithm and several benchmark schemes. [ABSTRACT FROM AUTHOR]

In this paper, we investigate security and energy efficiency of multicast communication in cognitive satellite terrestrial networks. To achieve high spectrum efficiency and low interference power transmissions in the cognitive terrestrial network, the rate splitting multiple access scheme (RSMA) is employed to prompt the massive access of the secondary users. In particular, we derive analytical and asymptotic closed-form expressions for secrecy outage probability of the satellite terrestrial network with eavesdropping, interfering, and imperfect channel state information. Hence, a beamforming (BF) scheme based on RSMA for secondary network is proposed to suppress eavesdropping, mitigate interference, and enhance energy efficiency of the proposed system model. Then, we transform non-convex optimization constraints into resoluble problems utilizing Taylor series expansion and successive convex approximation. Finally, simulation results corroborate the above theoretical analysis and highlight the superiority of the designed BF scheme on security and energy efficiency. [ABSTRACT FROM AUTHOR]

Rate-Splitting Multiple Access (RSMA) is an emerging flexible and powerful multiple access for downlink multi-antenna networks. In this paper, we introduce the concept of RSMA into short-packet downlink communications. We design optimal linear precoders that maximize the sum rate with Finite Blocklength (FBL) constraints. The relations between the sum rate and blocklength of RSMA are investigated for a wide range of network loads and user deployments. Numerical results demonstrate that RSMA can achieve the same transmission rate as Non-Orthogonal Multiple Access (NOMA) and Space Division Multiple Access (SDMA) with smaller blocklengths (and therefore lower latency), especially in overloaded multi-antenna networks. Hence, we conclude that RSMA is a promising multiple access for low-latency communications. [ABSTRACT FROM AUTHOR]

The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another figure of merit introduced by Goresky and Klapper generalizing Mandelbaum’s arithmetic autocorrelation. First we observe that the arithmetic crosscorrelation is constant for two binary sequences of coprime periods, which complements the analogous result for the classical crosscorrelation. Then we prove upper bounds for the constant arithmetic crosscorrelation of two Legendre sequences of different periods and of two binary $m$ -sequences of coprime periods, respectively. [ABSTRACT FROM AUTHOR]

A framework that could achieve submeter-level unmanned aerial vehicle (UAV) horizontal navigation in multipath-free environments with cellular carrier phase measurements is developed. This framework exploits the "loose" synchronization between cellular base transceiver station (BTS) clocks. It is shown through extensive experimental data that the beat frequency stability of cellular BTSs approaches that of atomic standards and that the clock deviations can be realized as a stable autoregressive moving average model. This BTS clock model is referred to as loose network synchronization. A rule-of-thumb is established for clustering the clock deviations to minimize the position estimation error, while significantly reducing the computational complexity. The presented models allow the UAV to achieve sustained carrier phase-based meter- to submeter-accurate navigation. To demonstrate the efficacy of the developed framework, this article presents three UAV flight experiments in Southern California, USA, utilizing signals from different cellular providers transmitting at different frequencies. The three experiments took place in open, semiurban environments with nearly multipath-free, line-of-sight (LOS) conditions, in which the UAV traveled 1.72, 3.07, and 0.61 km, achieving a horizontal position root mean squared error of 36.61, 88.58, and 89.33 cm, respectively, with respect to the UAV's on-board navigation system. [ABSTRACT FROM AUTHOR]

In applications of remote sensing, estimation, and control, timely communication is critical but not always ensured by high-rate communication. This work proposes decentralized age-efficient transmission policies for random access channels with $M$ transmitters. We propose the notion of age-gain of a packet to quantify how much the packet will reduce the instantaneous age of information at the receiver side upon successful delivery. We then utilize this notion to propose a transmission policy in which transmitters act in a decentralized manner based on the age-gain of their available packets. In particular, each transmitter sends its latest packet only if its corresponding age-gain is beyond a certain threshold which could be computed adaptively using the collision feedback or found as a fixed value analytically in advance. Both methods improve age of information significantly compared to the state of the art. In the limit of large $M$ , we prove that when the arrival rate is small (below $\frac {1}{eM}$), slotted ALOHA-type algorithms are order optimal. As the arrival rate increases beyond $\frac {1}{eM}$ , while age increases under slotted ALOHA, it decreases significantly under the proposed age-based policies. For arrival rates $\theta $ , $\theta =\frac {1}{o(M)}$ , the proposed algorithms provide a multiplicative gain of at least two compared to the minimum age under slotted ALOHA (minimum over all arrival rates). We conclude that it is beneficial to increase the sampling rate (and hence the arrival rate) and transmit packets selectively based on their age-gain. This is surprising and contrary to common practice where the arrival rate is optimized to attain the minimum AoI. We further extend our results to other random access technologies such as Carrier-sense multiple access (CSMA). [ABSTRACT FROM AUTHOR]

With the emerging unlicensed spectrum sharing and Machine-to-Machine communications, the coexistence performance of multiple devices with different access schemes operating at the same unlicensed bands has received significant research interests. As the two most representative random-access schemes, Aloha and Carrier Sense Multiple Access (CSMA) both found wide applications in unlicensed bands. Yet most of the studies have focused on the coexistence of CSMA-based networks, leaving the coexistence of Aloha-based and CSMA-based networks largely unexplored. The challenge originates from the lack of a coexistence model of slotted Aloha and CSMA. In this paper, the throughput performance of coexisting Aloha and CSMA networks is characterized and optimized by extending a unified analytical framework proposed for random-access networks. The analysis shows that different from the single-network case where the maximum throughput of CSMA is much higher thanks to carrier sensing, when Aloha and CSMA coexist, Aloha would significantly outperform CSMA if each network optimizes its own throughput performance without cooperation, leading to poor throughput performance for CSMA and severe unfairness. To achieve fair coexistence, inter-network cooperation is crucial. The optimal transmission probabilities of Aloha and CSMA for maximizing the total network throughput under a given throughput ratio are further derived, and applied to coexisting LTE Unlicensed and WiFi networks to optimize their coexistence performance. [ABSTRACT FROM AUTHOR]

This letter is the first part of a three-part tutorial focusing on rate-splitting multiple access (RSMA) for 6G. As Part I of the tutorial, the letter presents the basics of RSMA and its applications in light of 6G. To begin with, we first delineate the design principle and basic transmission frameworks of downlink and uplink RSMA. We then illustrate the applications of RSMA for addressing the challenges of various potential enabling technologies and use cases, consequently making it a promising next generation multiple access (NGMA) scheme for future networks such as 6G and beyond. We briefly discuss the challenges of RSMA and conclude the letter. In continuation of Part I, we will focus on the interplay of RSMA with integrated sensing and communication, and reconfigurable intelligent surfaces, respectively in Part II and Part III of this tutorial. [ABSTRACT FROM AUTHOR]

This paper investigates different precoding strategies for rate splitting multiple access (RSMA) in the downlink of multi-cell visible light communication (VLC) networks. Since classical Shannon capacity formula does not hold for VLC, we first provide a lower bound on the channel capacity for RSMA in such interfering networks. Then, we formulate a spectral efficiency maximization problem to jointly find the optimal rate-splitting and transmit precoding. Beside that, since cell-edge users suffer from additional inter-cell interference, we propose to design the precoders of different RSMA signals utilizing coordinated beamforming (CB). Subsequently, aiming to improve the performance of the CB design for RSMA, while maintain a reduced complexity, we introduce two enhanced precoding strategies for RSMA. To the best of the authors’ knowledge such a contribution has not been considered before in the open literature. It is shown in the paper that the formulated optimization problem is non-convex and a sub-optimal, yet, a low complexity solution can be obtained efficiently using semi-definite relaxation combined with successive convex approximation. Through analytical results, we illustrate the flexibility and superiority of the proposed precoding strategies for RSMA over conventional coordinated space division multiple access and non-orthogonal multiple access for different scenarios and network loads. [ABSTRACT FROM AUTHOR]

The scarcity of available spreading codes poses a hard limitation to user capacity for a code-division multiple access system. In previous work by Liu et al. (2020), the identical code cyclic shift multiple access (ICCSMA) scheme was developed, which allows multiple users to share one spreading code. However, the ICCSMA system uses the basic $m$ -sequence as the prime code to generate the identical code cyclic shift code, which has a nonideal correlation property and produces a considerable interference in a frequency-selective fading channel. To address this issue, we suggest using the complementary code (CC), which exhibits the perfect correlation property, to suppress the interference, and the proposed scheme is named CC-ICCSMA. Different from the article by Liu et al. (2020), a 3-D transceiver is designed in this article, and the CC set is employed to perform the multiple user detection. The simulation results demonstrate that the CC-ICCSMA strategy achieves a much better bit error rate performance than $m$ -sequence-based ICCSMA in the frequency-selective fading channels. Also, the outstanding anti-interference capability of CC-ICCSMA can help improve user capacity. [ABSTRACT FROM AUTHOR]

This letter proposes a hybrid multiple access (HMA) scheme to provide reliable connectivity for heterogeneous users in a satellite-aerial-terrestrial network (SATN). Here, multiple internet-of-things devices access a multi-antenna aerial platform through space division multiple access (SDMA) technology while the aerial platform and the earth station communicate with the satellite using uplink non-orthogonal multiple access (NOMA). Considering perfect and imperfect successive interference cancellation (SIC) at the satellite, we derive the closed-form ergodic sum rate (ESR) expression for the uplink transmission with the proposed HMA scheme, which is verified through Monte Carlo simulations. Besides, the priority of the proposed scheme is also demonstrated to some benchmarks in terms of ESR. [ABSTRACT FROM AUTHOR]

Cooperative vehicle safety (CVS) systems have been receiving significant attention as key enablers of important intelligent transportation system (ITS) applications, such as cooperative collision warning, emergency braking, and auto driving. In CVS systems, vehicles periodically broadcast short packets that include various types of vehicular information, e.g., position and speed. In this paper, we propose an optimization method for the broadcast rate in vehicle-to-vehicle (V2V) broadcast communications at an intersection based on theoretical analysis. We consider a model in which the locations of vehicles are modeled separately as queuing, and running segments and derive key performance metrics of V2V broadcast communications through a stochastic geometry approach. We develop closed-form approximate formulas for the theoretical expressions because they are mathematically intractable. Based on approximate analysis, we optimize the broadcast rate such that the interference at an intersection is mitigated and the overall performance of V2V communications is maximized. Because of the closed-form approximation, the optimal rate can be used as a guideline for a real-time control-method, which cannot be achieved through time-consuming simulations. We evaluate our method through numerical examples and demonstrate its effectiveness. [ABSTRACT FROM AUTHOR]

Rate-splitting (RS) has recently been recognized as a promising physical-layer technique for multi-antenna broadcast channels (BC). Due to its ability to partially decode the interference and partially treat the remaining interference as noise, RS is an enabler for a powerful multiple access, namely rate-splitting multiple access (RSMA), that has been shown to achieve higher spectral efficiency (SE) and energy efficiency (EE) than both space division multiple access (SDMA) and non-orthogonal multiple access (NOMA) in a wide range of user deployments and network loads. As SE maximization and EE maximization are two conflicting objectives in the moderate and high signal-to-noise ratio (SNR) regimes, the study of the tradeoff between the two criteria is of particular interest. In this work, we address the SE-EE tradeoff by studying the joint SE and EE maximization problem of RSMA in multiple input single output (MISO) BC with rate-dependent circuit power consumption at the transmitter. To tackle the challenges coming from multiple objective functions and rate-dependent circuit power consumption, we first propose two models to transform the original problem into two single-objective problems, namely, weighted-sum method and weighted-power method. A low-complexity algorithm with closed-form solution is proposed to solve each single-objective problem in the two-user system. For the generalized $K$ -user system, a successive convex approximation (SCA)-based algorithm is then proposed to optimize the precoders of each transformed problem. Numerical results show that our algorithm converges much faster than existing algorithms. In addition, the performance of RSMA is superior to or equal to SDMA and NOMA in terms of SE, EE and their tradeoff. [ABSTRACT FROM AUTHOR]

In this paper, a dense Internet of Things (IoT) monitoring system is studied in which a large number of devices contend for transmitting timely status packets to their corresponding receivers over wireless noisy channels, using a carrier sense multiple access (CSMA) scheme. When each device completes one transmission, due to possible transmission failure, two cases with and without transmission feedback to each device must be considered. Particularly, for the case with no feedback, the device uses policy (I): It will go to an idle state and release the channel regardless of the outcome of the transmission. For the case with perfect feedback, if the transmission succeeds, the device will go to an idle state, otherwise it uses either policy (W), i.e., it will go to a waiting state and re-contend for channel access; or it uses policy (S), i.e., it will stay at a service state and occupy this channel to attempt another transmission. For those three policies, the closed-form expressions of the average age of information (AoI) of each device are characterized under schemes with and without preemption in service. It is shown that, for each policy, the scheme with preemption in service always achieves a smaller average AoI, compared with the scheme without preemption. Then, a mean-field approximation approach with guaranteed accuracy is developed to analyze the asymptotic performance for the considered system with an infinite number of devices and the effects of the system parameters on the average AoI are characterized. Simulation results show that the proposed mean-field approximation is accurate even for a small number of devices. The results also show that olicy (S) achieves the smallest average AoI compared with policies (I) and (W), and the average AoI does not always decrease with the arrival rate for all three policies. [ABSTRACT FROM AUTHOR]

This letter proposes a rate splitting (RS)-based secure transmit approach against multiple eavesdroppers in cache-enabled cloud radio access networks (C2-RANs). Unlike existing secure schemes, our approach uses the common stream for dual purposes, serving as the desired message for legitimate users (LUs) and artificial noise (AN) for eavesdroppers. We jointly optimize message splitting, remote radio head (RRH) clustering, and beamforming to maximize the minimum secrecy rate among all LUs and to meet the fronthaul capacity and transmit power per RRH constraints. We transform the formulated problem into two-tier alternating optimization by constructing accurate surrogates for the non-convex objective functions and constraints. We solve the outer-tier and inner-tier problems with the semi-closed-form expressions and the convex framework, respectively. The proposed transmit approach achieves significant gains over existing schemes. [ABSTRACT FROM AUTHOR]

The next generation wireless communications aiming at enhancing capacity and massive connectivity significantly over high-frequency bands urge the development of novel multiple access technologies. In this paper, we propose a new type of space-division multiple access (SDMA), called holographic-pattern division multiple access (HDMA). We develop the principle for HDMA with the main idea of mapping the intended signals for receivers to a superposed holographic pattern. The multi-user holographic beamforming scheme for HDMA is then presented. Based on the theoretical analysis, we find that there exists an optimal holographic pattern such that the sum rate with simple zero-forcing precoding can achieve the asymptotic capacity of the HDMA system. Simulation results verify the theoretical analysis and show that the HDMA scheme outperforms the traditional SDMA scheme in terms of both the cost-efficiency and the sum rate. [ABSTRACT FROM AUTHOR]

In this letter, the design of non-orthogonal multiple access (NOMA) beamforming is investigated in a spatial division multiple access (SDMA) legacy system. In particular, two popular beamforming strategies in the NOMA literature, one to use existing SDMA beams and the other to form new beams, are adopted and compared. The studies carried out in the letter show that the two strategies realize different tradeoffs between system performance and complexity. For example, riding on existing beams offers a significant reduction in computational complexity, at the price of a slight performance loss. Furthermore, this simple strategy can realize the optimal performance when the users’ channels are structured. [ABSTRACT FROM AUTHOR]

In an orthogonal frequency division multiplexing (OFDM) system, cyclic prefix (CP) has to be added to eliminate multipath-induced inter-symbol interference (ISI) with a severely sacrificed bandwidth efficiency. Peak-to-average ratio (PAPR) may impair its performance further if a large number of carriers are used. On the other hand, traditional multi-carrier modulation suffers a prohibitive complexity, which can not be implemented with colorred current available silicon technologies. This work proposes a cost-effective way to implement multi-carrier modulation, namely multi-layer quadrature (MLQ) modulation, which requires only two oscillators. As an application example, we apply MLQ modulation to a complementary coded code division multiple access (MLQ-CC-CDMA) system, whose multi-carrier transmission is based on MLQ modulation to mitigate ISI and multi-user interference (MUI) with ideal auto- and cross-correlations of complementary codes. Compared to a frequency domain (FD) CC-CDMA system, MLQ-CC-CDMA has a lower RF complexity. Compared to OFDM direct sequence (DS) CDMA and single carrier frequency division multiple access (SC-FDMA) CDMA schemes, MLQ-CC-CDMA achieves a higher spectrum efficiency (SE) and a lower bit error rate with Rake and minimum mean square error (MMSE) detection due to its powerful multipath and multi-carrier diversity gains. [ABSTRACT FROM AUTHOR]

This paper studies the precoder design problem of achieving max-min fairness (MMF) amongst users in multigateway multibeam satellite communication systems with feeder link interference. We propose a beamforming strategy based on a newly introduced transmission scheme known as rate-splitting multiple access (RSMA). RSMA relies on multi-antenna rate-splitting at the transmitter and successive interference cancellation (SIC) at the receivers, such that the intended message for a user is split into a common part and a private part and the interference is partially decoded and partially treated as noise. In this paper, we formulate the MMF problem subject to per-antenna power constraints at the satellite for the system with imperfect channel state information at the transmitter (CSIT). We also consider the case of two-stage precoding which is assisted by on- board processing (OBP) at the satellite. Numerical results obtained through simulations for RSMA and the conventional linear precoding method are compared. When RSMA is used, MMF rate gain is promised and this gain increases when OBP is used. RSMA is proven to be promising for multigateway multibeam satellite systems whereby there are various practical challenges such as feeder link interference, CSIT uncertainty, per-antenna power constraints, uneven user distribution per beam and frame-based processing. [ABSTRACT FROM AUTHOR]

Rate-Splitting Multiple Access (RSMA) has recently appeared as a powerful and robust multiple access and interference management strategy for downlink Multi-user (MU) multi-antenna communications. In this work, we study the precoder design problem for RSMA scheme in downlink MU systems with both perfect and imperfect Channel State Information at the Transmitter (CSIT) and assess the role and benefits of transmitting multiple common streams. Unlike existing works which have considered single-antenna receivers (Multiple-Input Single-Output–MISO), we propose and extend the RSMA framework for multi-antenna receivers (Multiple-Input Multiple-Output–MIMO) and formulate the precoder optimization problem with the aim of maximizing the Weighted Ergodic Sum-Rate (WESR). Precoder optimization is solved using Sample Average Approximation (SAA) together with the proposed vectorization and Weighted Minimum Mean Square Error (WMMSE) based approach. Achievable sum-Degree of Freedom (DoF) of RSMA is derived for the proposed framework as an increasing function of the number of transmitted common and private streams, which is further validated by the Ergodic Sum Rate (ESR) performance using Monte Carlo simulations. Conventional MU–MIMO based on linear precoders and Non-Orthogonal Multiple Access (NOMA) schemes are considered as baselines. Numerical results show that with imperfect CSIT, the sum-DoF and ESR performance of RSMA is superior to those of the two baselines, and is increasing with the number of transmitted common streams. Moreover, by better managing the interference, RSMA not only has significant ESR gains over baseline schemes but is more robust to CSIT inaccuracies, network loads and user deployments. [ABSTRACT FROM AUTHOR]

Relay-aided multi-user OFDM is investigated under which multiple sources transmit their signals to a multi-antenna relay during the first relaying stage and then the relay amplifies and forwards the composite signal to all destinations during the second stage. The signal transmission of both stages experience frequency selectivity. The relay is powered both by an energy source through the wireless power transfer as well as by the energy recycled from its own self-interference during the second stage. Accordingly, we jointly design the power allocations both at the multiple source nodes and at a common relay node for maximizing the network’s sum-throughput, which poses a large-scale nonconvex problem, regardless whether proper Gaussian signaling (PGS) or improper Gaussian signaling (IGS) is used for signal transmission to the relay. We develop new alternating descent procedures for solving our joint optimization problems, which are based on closed-forms and thus are of very low computational complexity even for large numbers of subcarriers. The results show the superiority of IGS over PGS in terms of both its sum-rate and individual user-rate. Another benefit of IGS over PGS is that the former promises fairer rate distribution across the subcarriers. Moreover, the recycled self-interference also provides a beneficial complementary energy source. [ABSTRACT FROM AUTHOR]

Spectrum efficiency is a critical performance metric in wireless communications due to an increasing demand for radio spectrum to support high data rate applications. Direct sequence spread spectrum technology enables a code division multiple access (CDMA) system a strong anti-interference capability but with a relatively low spectrum efficiency. To address this issue, complementary coded scrambling multiple access (CCSMA) (X. Liu et al., in 2018) was proposed to use three-dimensional (space-time-frequency) resources for performance enhancement. However, in a CCSMA system, if the number of multipath returns is larger than the number of transmit (Tx) antennas, a code reuse problem occurs to degrade bit error rate performance significantly. This work designs a new scrambling code, namely generalized complementary coded scrambling multiple access (GCCSMA) codes, to overcome the code reuse problem in CCSMA. GCCSMA uses complementary codes, scrambling modulation, and multiple-input-multiple-output (MIMO) techniques jointly, which works well even in multipath channels with more paths than the number of Tx antennas. The analysis and simulations are conducted to validate the effectiveness of the proposed GCCSMA system. [ABSTRACT FROM AUTHOR]

Low-complexity detectors are conceivedfor the spatial modulation-aided sparse code-division multiple-access (SM-SCDMA). Firstly, the approximate message passing (AMP) algorithm is adapted for the detection of SM-SCDMA, which has less than 1% detection complexity of the state-of-the-art message passing-aided (MPA) detection albeit at a bit error ratio (BER) degradation. Therefore, inspired by the benefits of interference cancellation (IC) and the unique characteristics of SM, an enhanced AMP (EAMP) detector is proposed for mitigating BER degradation without increasing the detection complexity. Finally, the classic expectation propagation (EP) is intrinsically amalgamated with our EAMP detector, leading to a novel EAMP-EP detector, which further reduces the detection complexity of the EAMP algorithm. The three detectors are compared both in terms of their coded and uncoded BER, as well as complexity. [ABSTRACT FROM AUTHOR]

In this article, we investigate the rate-splitting multiple access (RSMA) framework in a multiuser multiple-input single-output (MISO) underlay cognitive radio system with power-splitting secondary users and information secondary users by using simultaneous wireless information and power transfer. The RSMA framework is a novel multiple access method based on linearly precoded rate splitting at the secondary base station, and successive interference cancellation at the secondary receivers, which has shown better performance compared with the traditional space-division multiple access (SDMA) method. In particular, the objective is to minimize the transmit power at the secondary base station subject to the constraints of minimum energy harvesting, minimum data rate, and a maximum power level for allowable interference with the primary users. The challenging problem under consideration is nonconvex, and the solution relies on dividing it into outer and inner optimization problems. Then, we propose a particle-swarm-optimization-based algorithm to solve the outer problem, with the inner problem managed by the semidefinite relaxation method. In addition, we present a comparative scheme based on the successive convex approximation method and a scheme based on SDMA. Finally, simulation results confirm the superior performance of the proposed approach in comparison with the other schemes. [ABSTRACT FROM AUTHOR]

IEEE 802.11ax partitions a regular 20MHz channel into smaller sub-channels called resource units to support simultaneous multiuser operation using orthogonal frequency division multiple access (OFDMA). Uplink OFDMA random access (UORA) in IEEE 802.11ax allows stations to transmit via a scheduled random access mechanism. UORA is initiated via a trigger frame which aside from serving as a synchronization mechanism, also informs stations which resource units are allowed for random access. Using the trigger frame information, the stations engage in an OFDMA backoff process to win access to a resource unit. Similar to slotted ALOHA, the maximum normalized throughput of UORA is only 37 percent due to high probability of collisions at high loads. To reduce collisions, we equip UORA with carrier sensing capability resulting in a new uplink hybrid UORA (H-UORA) OFDMA access mechanism. Unlike other multi-carrier CSMA methods previously proposed in literature, H-UORA is an easily implementable modification to current 802.11ax WLANs. We show that H-UORA can achieve a normalized throughput of at least 80 percent (which increases further depending on the buffering capabilities of the access point) using various numerical analysis and simulations. [ABSTRACT FROM AUTHOR]

Dual-Functional Radar-Communication (DFRC) is a promising paradigm to achieve Integrated Sensing and Communication (ISAC) in beyond 5G. In parallel, Rate-Splitting Multiple Access (RSMA), relying on multi-antenna Rate-Splitting (RS) by splitting messages into common and private streams at the transmitter and Successive Interference Cancellation (SIC) at the receivers, has emerged as a new strategy for multi-user multi-antenna communications systems. In this paper, we show that RSMA can be used as a unified and powerful multiple access and interference management strategy for multi-antenna DFRC system, where the base station has a dual communication and radar capability to simultaneously communicate with downlink users and probe detection signals to azimuth angles of interests. To that end, we design the message splits as well as the precoders of the communication (private and common) streams and radar sequence to jointly maximize the Weighted Sum Rate (WSR) and minimize the radar beampattern approximation Mean Square Error (MSE) subject to the per-antenna power constraint. We make key and refreshing observations. First, the proposed RSMA-assisted DFRC framework embraces existing DFRC frameworks based on Space-Division Multiple Access (SDMA) as subschemes. Second, RSMA exploits synergies in DFRC by making a better use of the common stream and the SIC receivers for the triple function of managing interference among communication users, managing interference between communication and radar, and enhancing radar sensing. Third, by contrasting with existing SDMA-based DFRC schemes where transmitting an additional radar sequence enhances the WSR-MSE tradeoff, RSMA-assisted DFRC frameworks with and without radar sequence achieve the same tradeoff performance and outperform all schemes using SDMA or orthogonal resources. Therefore, by enabling RSMA in DFRC, the system performance is enhanced and the system architecture is simplified since there is no need to use an additional radar sequence. We conclude that RSMA is a powerful multiple access and interference management strategy for DFRC. [ABSTRACT FROM AUTHOR]

Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on multi-antenna Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. In this work, we study the performance of RSMA under the important setup of imperfect Channel State Information at the Transmitter (CSIT) originating from user mobility and latency/delay (between CSI acquisition and data transmission) in the network. We derive a lower bound on the ergodic sum-rate of RSMA for an arbitrary number of transmit antennas, number of users, user speed and transmit power. Then, we study the power allocation between common and private streams and obtain a closed-form solution for optimal power allocation that maximizes the obtained lower bound. The proposed power allocation greatly reduces precoder design complexity for RSMA. By Link-Level Simulations (LLS), we demonstrate that RSMA with the proposed power allocation is robust to the degrading effects of user mobility and has significantly higher performance compared to conventional multi-user (massive) Multiple-Input Multiple-Output (MIMO) strategies. The work has important practical significance as results demonstrate that, in contrast to conventional multi-user (massive) MIMO whose performance collapse under mobility, RSMA can maintain reliable multi-user connectivity in mobile deployments. [ABSTRACT FROM AUTHOR]

A novel carrier sense multiple access strategy with collision avoidance (CSMA/CA) balancing contention probability and channel access time is proposed. The approach can be applied to any context where the computational simplicity of the MAC must be preferred to the complexity of the channel access strategy. Our MAC, called Delay-Collision CSMA (DC-CSMA), is a slotted nonpersistent CSMA/CA with nonuniform contention probability distribution, designed to reduce at the same time latency of contenders and preserve a high successful access probability. An utility function aiming at equalizing the effects of these two performance metrics is introduced, and the related theoretical properties and optimal distribution are derived. DC-CSMA is insensitive to the number of contenders and very robust with respect to contention window size, packet length, and impairments such as frame synchronization errors and hidden terminals, and it does not require any adaptive tuning to optimize its performance. Current technologies such as WSN, RFID, IoT devices can benefit from such a simple access technique. The numerical evaluation has been led out considering latency, successful probability and throughput, and DC-CSMA has been compared with other classical strategies such as CSMA with uniformly distributed contention probability, CSMA/ $p^{\ast}$ and Sift distribution. [ABSTRACT FROM AUTHOR]

Based on DFT matrices and no-hit-zone (NHZ) frequency hopping sequence sets, a construction of multiple optimal polyphase zero correlation zone sequence sets with inter-set zero cross-correlation zone (ZCCZ) is proposed. The parameters of each subset are optimal, and arbitrary two sequences from different subsets have the same inter-set ZCCZ. Furthermore, new NHZ frequency hopping sequence sets are proposed, which can be used in the construction of multiple polyphase ZCZ sequence sets with inter-set ZCCZ. The resultant sequence sets presented in this letter can be applied to multi-cell QS-CDMA systems. [ABSTRACT FROM AUTHOR]

Fast chirp FMCW MIMO radar with inter-chirp coding provides high emission power by utilizing simultaneous antennas transmissions. However, the coding produces high side-lobes in the Doppler and angle dimensions of the radar's ambiguity function. The high side-lobes may cause miss-detection due to masking between targets that are at similar range and have large received power difference, as is often the case in automotive scenarios. In this paper, we develop a novel code optimization method that attenuates the side-lobes of the radar's ambiguity function and hence improves the probability of detection in the case of multiple targets. We formulate an analytical expression for the ambiguity function side-lobes, which takes into account that the targets range difference migrates during the detection interval, and that the migration is proportional to the targets Doppler frequency difference. We then develop an optimization algorithm that finds the code that minimizes the ambiguity function side-lobes average energy. The optimized code attenuates the ambiguity function side-lobes at the Doppler frequencies that are near the main lobe frequency. These frequencies correspond to targets with small speed difference, for which the range difference between the targets does not change significantly during the detection interval, and hence overlapping in range can cause severe interference. We demonstrate by simulation that the optimized code achieves an improvement in the ambiguity function side-lobes attenuation and an improvement in the probability of detection compared to reference codes. [ABSTRACT FROM AUTHOR]

Barcoding photons, atoms, and any quantum states can provide a host of functionalities that could benefit future quantum communication systems and networks beyond today’s imagination. As a significant application of barcoding photons, we introduce code division multiple-access (CDMA) communication systems for various applications. In this context, we introduce and discuss the fundamental principles of a novel quantum CDMA (QCDMA) technique based on spectrally encoding and decoding of continuous-mode quantum light pulses. In particular, we present the mathematical models of various QCDMA modules that are fundamental in describing an ideal and typical QCDMA system, such as quantum signal sources, quantum spectral encoding phase operators, M × M quantum broadcasting star-coupler, quantum spectral phase decoding operators, and the quantum receivers. Following the above discussions, we then elaborate on a QCDMA system with M users. In describing a QCDMA system, this paper considers a unified approach where the input continuous-mode quantum light pulses can take on any form of pure states such as quantum coherent (Glauber) states and quantum number (Fock) states. The mathematical presentation is independent of the form of the input pure quantum states. We show that the spectrally encoded quantum states of the light at the quantum star-coupler output are not, in general, factorized states, except for input Glauber states. For input number states, one can observe features like entanglement and quantum interference. Moreover and interestingly, as a consequence of Heisenberg’s uncertainty principle, the quantum signals sent by photon number states obtain complete phase uncertainty at the time of measurement. Therefore, at the receiver output, the multiaccess inter-signal interference vanishes. Due to Heisenberg’s uncertainty principle, the received signal intensity at the photodetector’s output, right at the time of measurement, changes from coherent detection scheme for input Glauber states to incoherent detection scheme for input number states. We also would like to highlight that the mathematical models and tools developed in this paper, in the context of QCDMA, become very useful for developing and analyzing other quantum multiple-access techniques based on wavelength, space and time domain. Furthermore, our mathematical model is valuable in signal design and data modulations of point-to-point quantum communications, quantum pulse shaping, and quantum radar signals and systems where the inputs are continuous mode quantum signals. QCDMA may open up novel possibilities for various quantum technologies such as data privacy, distributed quantum computation, quantum internet, and anti-jamming quantum communication systems. [ABSTRACT FROM AUTHOR]

This paper is focused on code-domain non-orthogonal multiple access (CD-NOMA), which is an emerging paradigm to support massive connectivity for future machine-type wireless networks. We take a comparative approach to study two types of overloaded CD-NOMA, i.e., sparse code multiple access (SCMA) and dense code multiple access (DCMA), which are distinctive from each other in terms of their codebooks having sparsity or not. By analysing their individual diversity orders (DO) in Rayleigh fading channels, it is found that DCMA can be designed with the aid of generalized sphere decoder (i.e., a nonlinear multiuser detector) to enjoy full DO which is equal to the maximum number of resource nodes in the system. This is in contrast to SCMA whose error rate suffers from limited DO equal to the codebook sparsity (i.e., the effective number of resource nodes occupied by each user). We conduct theoretical analysis for the codebook design criteria and propose to use generalized sphere decoder for DCMA detection. We numerically evaluate two types of multiple access schemes under “4 × 6” (i.e., six users communicate over four subcarriers) and “5 × 10” NOMA settings and reveal that DCMA gives rise to significantly improved error rate performance in Rayleigh fading channels, whilst having decoding complexity comparable to that of SCMA. [ABSTRACT FROM AUTHOR]

In this article, the key influence of the feed-probe position for the excitation of desired modes in a circular sector microstrip antenna (CSMA) is thoroughly investigated via physical analysis comprising simulations and measurements. The approximate feed location used to excite a particular mode is also empirically determined to facilitate further exploration of CSMAs. Based on the proposed analysis and simulations, CSMAs with a wide range of sector angles are studied, and good agreements are revealed when compare with the measurements. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles (UAVs) have found compelling applications in intelligent logistics, search and rescue as well as in air-borne Base Station (BS). However, their communications are prone to both channel errors and eavesdropping. Hence, we investigate the max-min secrecy fairness of UAV-aided cellular networks, in which Cooperative Rate-Splitting (CRS) aided downlink transmissions are employed by each multi-antenna UAV Base Station (UAV-BS) to safeguard the downlink of a two-user Multi-Input Single-Output (MISO) system against an external multi-antenna Eavesdropper ($Eve$). Realistically, only Imperfect Channel State Information (ICSI) is assumed to be available at the transmitter. Additionally, we consider a realistic total power constraint and guarantee the specific Quality of Service (QoS) requirements of the legitimate users. To handle the worst-case channel uncertainty of the legitimate users and an external $Eve$ , we conceive a robust secure resource allocation algorithm, which maximizes the minimum worst-case secrecy rate of the legitimate users. Based on the CRS principle, the transmitter splits and encodes the messages of legitimate users into common as well as private streams and the user having stronger CSI is asked to help the cell-edge user by opportunistically forwarding its decoded common message. In contrast to the existing schemes adopted in the literature for ensuring secure transmission of the first cooperative phase only, in our proposed solution the common message has a twin-fold mission. Explicitly, apart from serving as the desired message, it also acts as Artificial Noise (AN) for drowning out $Eve$ without consuming extra power. This is in stark contrast to the conventional AN designs. In the second phase, the pure AN is directed towards the $Eve$ , deploying a robust Maximum Ratio Transmitter (MRT) beamformer at the UAV-BS. To solve the resultant non-convex optimization problem we resort to the Sequential Parametric Convex Approximation (SPCA) method together with a bespoke initialization algorithm to avoid any failure due to infeasibility. Our simulation results confirm that the proposed secure transmission scheme outperforms the existing cooperative benchmarkers. [ABSTRACT FROM AUTHOR]

Easily and flexibly deployable ad-hoc communication networks emerging in tactical military or even civilian contexts, frequently suffer from poor synchronization due to lack of coordinating infrastructure. In addition to synchronization issues, and especially in military settings, security from the aspect of detectability is also of crucial importance. Imperfect synchronization can be dealt with by making use of Quasi-Synchronous Code Division Multiple Access (QS-CDMA), relying on Loosely Synchronous Codes to maintain orthogonality in the presence of limited time delays. Security, in terms of low probability of detection (LPD) from the standpoint of a malicious adversary, can be improved (reduced detection) by employing randomization techniques that disrupt the inherent structure of the transmitted QS-CDMA signals. This is based on the fact that QS-CDMA signals are Cyclostationary, having (almost) periodic Auto-Correlation functions (ACF) due to eminent signal periodicities (such as spreading code repetition). In this paper, we propose techniques to disturb the ACF and equivalently the Spectral Correlation function, and reduce the Degree of Cyclostationarity (DCS), our LPD measure. Specifically, we investigate randomization via 1) random per symbol time dithering and 2) random selection of spreading sequences, as well as a hybrid approach combining time dithering and code randomization. In all proposed techniques knowledge of the randomization pattern is not required at the legitimate receiver. We derive the Spectral Correlation function of the QS-CDMA signal under the proposed randomization schemes and compare it to simulations. We show through analysis and extensive numerical simulations that the proposed technique can reduce the DCS by almost two orders of magnitude. We also show that enhanced LPD can be achieved using the proposed techniques while sacrificing a part of the reduced time synchronization requirement. We further analyze the implications of the friendly receiver not knowing the randomization pattern and present results on the resulting communication performance. [ABSTRACT FROM AUTHOR]

The time-modulated array (TMA)-based space-division multiple access (SDMA) approach is studied and verified, including the performance analysis and experimental verification. It utilizes the multibeam characteristic of TMA to implement the SDMA. For the uplink, the main power of signals with different incident angles would be redistributed to different harmonic components after time modulation. In this case, it plays a key role in this system to determine the harmonic order, which is selected to detect the received signal. A novel harmonic selection method for the uplink TMA-based SDMA systems is proposed by maximizing the received signal power. Furthermore, a closed-form expression of the spectral efficiency is deduced to verify the advantage of the simple harmonic selection scheme. Numerical results show that the TMA-based SDMA system can significantly improve the spectral efficiency compared with traditional single radio frequency (RF) chain systems. Meanwhile, it does not increase the number of RF chains. An L-band eight-element TMA is fabricated and tested to validate the feasibility of the TMA-based SDMA method. [ABSTRACT FROM AUTHOR]

Let m be an even positive integer. A Boolean bent function ƒ on F2m-1 × F2 is called a cyclic bent function if for any a ≠ b ∈ F2m-1 and ε ∈ F2, ƒ(ax1, x2)+ ƒ(bx1, x2 + ε) is always bent, where x1 ∈ F2m-1, x2 ∈ F2. Cyclic bent functions look extremely rare. This paper focuses on cyclic bent functions on F2m-1 × F2 and their applications. The first objective of this paper is to establish a link between quadratic cyclic bent functions and a special type of prequasifields, and construct a class of quadratic cyclic bent functions from the Kantor-Williams prequasifields. The second objective is to use cyclic bent functions to construct families of optimal sequences. The results of this paper show that cyclic bent functions have nice applications in several fields such as coding theory, symmetric cryptography, and CDMA communication. [ABSTRACT FROM AUTHOR]

Conflict-avoiding codes (CACs) were introduced by Levenshtein as a single-channel transmission scheme for a multiple-access collision channel without feedback. When the number of simultaneously active source nodes is less than or equal to the weight of a CAC, it is able to provide a hard guarantee that each active source node transmits at least one packet successfully within a fixed time duration, no matter what the relative time offsets between the source nodes are. In this article, we extend CACs to multichannel CACs for providing such a hard guarantee over multiple orthogonal channels. Upper bounds on the number of codewords for multichannel CACs of weights three and four are derived, and constructions that are optimal with respect to these bounds are presented. [ABSTRACT FROM AUTHOR]

This brief presents the measurement/modeling of a dual-input outphasing Chireix power amplifier (PA) for the analysis of nonlinear and memory effects behavior when excited with modulated signals. Moreover, we formulate a cubic-spline (CS) memory model with a closed-loop for the digital predistortion (DPD) linearization algorithm. An FPGA system has been developed to automate the outphasing angles and their respective asymmetrical incident power levels applied at the Class-F PAs of the Chireix under test. Based on experimental results, the CS model offers a DPD with a normalized mean square error (NMSE) of −21.87 dB, and −52.47 dB for a WCDMA 5-MHz and an LTE-A 10-MHz with −26.84 dB and −43.91 dB in extraction and prediction, respectively. An output power improvement of −43.5 dBc in adjacent channel power ratio (ACPR) with 9.3 dB PAPR yield 50% average efficiency enhance at 2 GHz, is achieved. [ABSTRACT FROM AUTHOR]

How to achieve efficient multiple access for Terahertz (THz) networks is still an open problem. The key obstacle is the extremely narrow angular coverage by a highly directional THz beam. Thus, a hybrid THzPrism beamforming (HTB) architecture is designed in this paper to greatly enlarge angular coverage by spreading frequency subcarriers to different directions. Based on the HTB architecture, a spatial-spread orthogonal frequency division multiple access (SS-OFDMA) scheme is developed. To serve users dispersed in a large angular range, a user grouping mechanism is first designed for SS-OFDMA to utilize SDMA and suppress the inter-group interference. To improve the spectrum and energy efficiency for sporadic users within a group, a non-uniform beam spreading mechanism is then developed for SS-OFDMA by joint design of digital and analog beamforming. Finally, a resource allocation algorithm is designed to minimize the transmit power of the base station by optimizing the subarray allocation among groups as well as the subcarrier and power allocation for each user within a group. Compared with the existing schemes, SS-OFDMA increases the achievable data rate by up to 124%, reduces the power consumption by up to 71%, and increases the average number of concurrently served users by up to 147%. [ABSTRACT FROM AUTHOR]

Consider a multihop wireless network serving multiple flows in which wireless interference constraints between links are described by a link-interference graph. The timely-throughput of a flow is defined as the throughput of packets of that flow that reach their destination node within a specified deadline, and the weighted timely throughput of the network is their weighted average over the flows with a given set of positive weights. The problem is particularly challenging, and has generally been open, when there is wireless interference between transmissions. We show that a modified CSMA routing-scheduling policy with an appropriate set of attempt probabilities is nearly optimal for maximizing weighted timely-throughput. This policy has the useful property that the routing-scheduling decision for an individual packet is solely a function of its location and time-to-deadline, and so a wireless node does not require knowledge of the global network state. It is easily implementable in a decentralized fashion by the nodes given the attempt probabilities. A gradient-based adaptive CSMA routing-scheduling policy to determine the optimal attempt probabilities is further provided. It moves along the gradient of the timely throughput and converges to a local maximum. [ABSTRACT FROM AUTHOR]

In this article, we present a stochastic geometry-based model to investigate alternative medium access choices for LoRaWAN—a widely adopted low-power wide-area network (LPWAN) technology for the Internet-of-Things. LoRaWAN adoption is driven by its simplified network architecture, air interface, and medium access. The physical layer, known as Long Range (LoRa), provides quasi-orthogonal virtual channels through spreading factors (SFs) and time-power capture gains. However, the adopted pure ALOHA access mechanism suffers, in terms of scalability, under the same-channel same-SF transmissions from a large number of devices. In this article, our objective is to explore access mechanisms beyond-ALOHA for LoRaWAN. Using recent results on time- and power-capture effects of LoRa, we develop a unified model for the comparative study of other choices, i.e., slotted ALOHA and carrier-sense multiple access (CSMA). The model includes the necessary design parameters of these access mechanisms, such as guard time and synchronization accuracy for slotted ALOHA, carrier sensing threshold for CSMA. It also accounts for the spatial interaction of devices in annular shaped regions, characteristic of LoRa, for CSMA. The performance metrics derived from the model in terms of coverage probability, channel throughput, and energy efficiency are validated using Monte-Carlo simulations. Our analysis shows that slotted ALOHA indeed has higher reliability than pure ALOHA but at the cost of lower energy efficiency for low device densities. Whereas, CSMA outperforms slotted ALOHA at smaller SFs in terms of reliability and energy efficiency, with its performance degrading to pure ALOHA at higher SFs. [ABSTRACT FROM AUTHOR]

In this letter, we address the problem of designing unit modulus complementary sequence set with impulse-like complementary auto-correlation function which has immense potential with applications in ultra wide-band (UWB) communication system, code-division multiple-access (CDMA) system and active sensing systems like MIMO RADAR and SONAR. We have formulated the design problem as the minimization of complementary peak side-lobe level and proposed a monotonic algorithm based on the majorization-minimization technique. Through numerical simulations, we show the construction of sequence sets (of different lengths) with impulse like complementary auto-correlation - which is first of its kind in the sequence design literature. We also discuss the computationally efficient implementation of the proposed algorithm via FFT, IFFT operations. [ABSTRACT FROM AUTHOR]

The concept of a fully connected world in the fifth generation technology envisions the massive rollout of small and constrained Internet of Things (IoT) devices. In such IoT environments, machine-to-machine (M2M) communications is key for allowing these devices (e.g., sensors, actuators, smart meters/monitors) to collect data toward a remote server. We address this particular scenario by building and evaluating an IoT multi-access reference architecture, with a multipath TCP (MPTCP) gateway connected to multiple cellular networks to offload M2M data traffic. Experimental results from CoAP-emulated traffic indicate that the our proposed system together with the benefits of MPTCP improve IoT application performance. More specifically, multipath-based M2M data traffic offloading increases throughput and significantly reduces latency of CoAP requests as the number of sensor networks increases. [ABSTRACT FROM AUTHOR]

This paper investigates the massive access for a satellite-aerial-terrestrial network (SATN), where a high-altitude platform (HAP) is deployed as a relay to assist the uplink transmission from terrestrial user equipment (UE) to satellite. Unlike previous works, we adopt radio frequency (RF) and free space optical for the aerial-terrestrial and satellite-aerial links, respectively. Specifically, by assuming that imperfect angular information (IAI) of each UE is known at the HAP, we develop a space division multiple access (SDMA) scheme to maximize the ergodic sum rate (ESR). To this end, we first exploit the IAI to calculate the analytical expression of channel correlation matrix. Then, by considering the limitation of array freedom, we propose a subspace-based UE grouping and scheduling scheme to cluster all UEs into groups. Next, we present a computationally effective beamforming (BF) scheme for each UE at HAP to efficiently implement SDMA in the RF link. Furthermore, a closed-form expression for the ESR of the SATN is derived to validate the proposed BF and SDMA schemes. Finally, simulation results corroborate the derived theoretical formulas and reveal the impacts of array size, angular estimation error, the number of UEs and scheduling threshold on the system performance. [ABSTRACT FROM AUTHOR]

As a crucial technique for integrated circuits (IC) test response compaction, X-compact employs a special kind of codes called X-codes for reliable compressions of the test response in the presence of unknown logic values (Xs). From a combinatorial view point, Fujiwara and Colbourn introduced an equivalent definition of X-codes and studied X-codes of small weights that have good detectability and X-tolerance. An $({\it\text { m, n, d, x}})~\text {X}$ -code is an $\text {m}\times \text {n}$ binary matrix with column vectors as its codewords. The parameters ${\it\text { d, x}}$ correspond to the test quality of the code. In this paper, bounds and constructions for constant weighted X-codes are investigated. First, we obtain a general result on the maximum number of codewords n for an $({\it\text { m, n, d, x}})~\text {X}$ -code of weight w, and we further improve this lower bound for the case with $\text {x}=2$ and $\text {w}=3$ through the probabilistic method. Then, using tools from additive combinatorics and finite fields, we present some explicit constructions for constant weighted X-codes with $\text {d}=3,7$ and $\text {x}=2$ , which are optimal for the case when $\text {d}=3, \text {w}=4$ and nearly optimal for the case when $\text {d}=3,\text {w}=3$. We also consider a special class of X-codes introduced by Fujiwara and Colbourn and improve the best known lower bound on the maximum number of codewords for this kind of X-codes. [ABSTRACT FROM AUTHOR]

Low-density spreading non-orthogonal multiple-access (LDS-NOMA) is considered where $K$ single-antenna user-equipments (UEs) communicate with a base-station (BS) over $F$ fading sub-carriers. Each UE $k$ spreads its data symbols over $\text {d}_{\text {k}}\ll \text {F}$ sub-carriers. The performance of LDS-NOMA system depends on the allocation of the non-zero elements in the LDS-codes. We aim to identify the LDS resource allocations, based solely on pathlosses, that maximize the ergodic mutual information (EMI). This problem can be solved only via an exhaustive search. Thus, relying on analysis in the regime where $F$ , $K$ , and ${{d}_{{k}},\forall {k}}$ converge to $+\infty $ at the same rate, we present EMI as a deterministic equivalent plus a residual term. The deterministic equivalent is a function of pathloss values and LDS-codes, and the small residual term scales as $\mathcal {O}\left({\frac {1}{\min ({d}_{{k}}^{2})}}\right)$. First, we formulate an optimization problem to identify the resource allocations that maximize the deterministic equivalent of EMI. The Karush-Kuhn-Tucker conditions give a simple resource allocation rule that facilitates the construction of desired LDS-codes via an efficient partitioning algorithm. The finite-regime analysis shows that such sparse solutions additionally harness the small incremental gain inherent in the residual term, and thus, provides a near-optimal performance. The spectral efficiency enhancement relative to regular and random spreading is validated numerically. [ABSTRACT FROM AUTHOR]

In this letter, a novel and compact 180° circular sector microstrip antenna has been proposed. The patch surface has been designed with a proper design insight to perturb and control the orthogonal surface current paths and orthogonal field components at the truncated edges for suppression of cross-polar (XP) radiations over the whole elevation without hampering its radiation pattern and bandwidth. The proposed antenna gives consistently better performance with different (large, medium, and small) ground plane sizes in spite of massive miniaturization (of 82%) with reference to conventional circular microstrip antenna at the same frequency. The proposed antenna can also be circumscribed completely within a sphere of radius (λ/2π), i.e., wheeler limit and hence can stand well as a small antenna. [ABSTRACT FROM AUTHOR]