Search

In one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices, several orders of magnitude compared to today’s networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, this paper proposes two D2D clustering schemes, namely, random-based clustering and channel-gain-based clustering. Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, this paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, this paper discusses the implementation algorithm and some potential implementation issues and remedies. [ABSTRACT FROM AUTHOR]

This paper derives the maximum achievable sum-rate and presents the optimal encoding/decoding framework for rate-diverse wireless network coding (RD-WNC) over broadband channels consisting of multiple parallel subchannels. RD-WNC applies to a communication scenario in which a base station wants to deliver two different messages with different rates to two users. The base station combines the two separate messages into one network-coded message and broadcasts the network-coded message to both users. Each user then extracts its desired message from the network-coded message by subtracting from it the other message, which we assume to be side information available to the user. Deriving the maximum achievable sum-rate for RD-WNC is challenging when the channel consists of multiple parallel subchannels with different channel coefficients (e.g., the subcarrier channels of OFDM systems), since apart from the rate allocation between the two users, optimal power allocation among multiple subchannels needs to be identified. The first contribution of this paper is a new “mountain-leveling” power allocation algorithm to achieve the maximum sum-rate. With the resulting power allocation, we can then achieve the corresponding optimal sum-rate by having a separate encoding/decoding mechanism for each subchannels, but doing so is cumbersome and complex when the number of subchannels is large. The second contribution of this paper is a practical encoding/decoding framework using only one encoder-decoder mechanism for all subchannels without sacrificing sum-rate optimality. We provide numerical results to corroborate our theoretical findings and to demonstrate the benefits of our encoding/decoding framework. [ABSTRACT FROM AUTHOR]

This paper investigates the dynamic access point (AP) clustering and precoding problem in the downlink of user-centric virtual cell networks. The goal is to maximize the weighted sum spectral efficiency (SE) while satisfying the power constraints and AP clustering constraints in adjacent time slots (TSs). By adopting the random walk mobility to model the mobile user equipments’ movement behaviors, we consider dynamic and time-varying channel conditions. Therefore, the weighted sum SE maximization programming takes the form of discrete-time sequence of mixed-integer non-convex optimization problems. In this paper, we propose to solve this sequential problem in two stages. In the first stage, a dynamic AP clustering approach based on discrete particle swarm optimization is developed. This approach takes the advantage of the channel correlation by exploiting the relationship between AP clustering solutions in adjacent TSs to improve the SE performance and reduce complexity. In the second stage, given the AP clustering solution obtained in the first stage, a distributed precoding algorithm is devised via applying the weighted minimum mean square error method. By combining these two stages, we propose a novel dynamic AP clustering and precoding algorithm (DAPC-Pre). The effectiveness of the proposed DAPC-Pre algorithm is verified by the simulation results. In particular, the proposed algorithm converges fast and significantly outperforms benchmark algorithms in terms of sum SE under different dynamic environments. [ABSTRACT FROM AUTHOR]

Hardware non-idealities are among the main performance restrictions for upcoming wireless communication systems. Asymmetric hardware distortions (HWD) happen when the impairments of the I/Q branches are correlated or imbalanced, which in turn generate improper additive interference at the receiver side. When the interference is improper, as well as in other interference-limited scenarios, improper Gaussian signaling (IGS) has been shown to provide rate and/or power efficiency benefits. In this paper, we investigate the rate benefits of IGS in a two-user interference channel (IC) with additive asymmetric HWD when interference is treated as noise. We propose two iterative algorithms to optimize the parameters of the improper transmit signals. We first rewrite the rate region as an pseudo-signal-to-interference-plus-noise-ratio (PSINR) region and employ majorization minimization and fractional programming to find a suboptimal solution for the achievable user rates. Then, we propose a simplified algorithm based on a separate optimization of the powers and complementary variances of the users, which exhibits lower computational complexity. We show that IGS can improve the performance of the two-user IC with additive HWD. Our proposed algorithms outperform proper Gaussian signaling and competing IGS algorithms in the literature that do not consider asymmetric HWD. [ABSTRACT FROM AUTHOR]

This paper studies an unmanned aerial vehicle (UAV)-assisted wireless powered IoT network, where a rotary-wing UAV adopts fly-hover-communicate protocol to successively visit IoT devices in demand. During the hovering periods, the UAV works on full-duplex mode to simultaneously collect data from the target device and charge other devices within its coverage. Practical propulsion power consumption model and non-linear energy harvesting model are taken into account. We formulate a multi-objective optimization problem to jointly optimize three objectives: maximization of sum data rate, maximization of total harvested energy and minimization of UAV’s energy consumption over a particular mission period. These three objectives are in conflict with each other partly and weight parameters are given to describe associated importance. Since IoT devices keep gathering information from the physical surrounding environment and their requirements to upload data change dynamically, online path planning of the UAV is required. In this paper, we apply deep reinforcement learning algorithm to achieve online decision. An extended deep deterministic policy gradient (DDPG) algorithm is proposed to learn control policies of UAV over multiple objectives. While training, the agent learns to produce optimal policies under given weights conditions on the basis of achieving timely data collection according to the requirement priority and avoiding devices’ data overflow. The verification results show that the proposed MODDPG (multi-objective DDPG) algorithm achieves joint optimization of three objectives and optimal policies can be adjusted according to weight parameters among optimization objectives. [ABSTRACT FROM AUTHOR]

Underwater environments create a challenging channel for communications. In this paper, we design a novel receiver system by exploring the machine learning technique–Deep Belief Network (DBN) – to combat the signal distortion caused by the Doppler effect and multi-path propagation. We evaluate the performance of the proposed receiver system in both simulation experiments and sea trials. Our proposed receiver system comprises of DBN based de-noising and classification of the received signal. First, the received signal is segmented into frames before the each of these frames is individually pre-processed using a novel pixelization algorithm. Then, using the DBN based de-noising algorithm, features are extracted from these frames and used to reconstruct the received signal. Finally, DBN based classification of the reconstructed signal occurs. Our proposed DBN based receiver system does show better performance in channels influenced by the Doppler effect and multi-path propagation with a performance improvement of 13.2dB at 10−3 Bit Error Rate (BER). [ABSTRACT FROM AUTHOR]

Fog radio access network (Fog-RAN), which pushes caching and computing capabilities to the network edge, is capable of efficiently delivering content to users by using carefully designed caching placement and content replacement algorithms. In this paper, the transmission scheme design and coding parameter optimization will be considered for coded caching in Fog-RAN, where the reliability of content delivery, i.e., content outage probability, is used as the performance metric. The problem will be formulated as a complicated multi-objective probabilistic combinatorial optimization. A novel maximum $b$ -matching approach will then be proposed to obtain the Pareto optimal solution with fairness constraint. Based on the fast message passing approach, a distributed algorithm with a low memory usage of $O(M+N)$ is also proposed, where $M$ is the number of users and $N$ is the number of fog access points (Fog-APs). Although it is usually very difficult to derive the closed-form formulas for the optimal solution, the approximation formulas of the content outage probability will also be obtained as a function of coding parameters. The asymptotic optimal coding parameters can then be obtained by defining and deriving the outage exponent region and diversity-multiplexing region. Simulation results will illustrate the accuracy of the theoretical derivations, and verify the outage performance of the proposed approach. Therefore, this paper not only proposes a practical distributed Fog-AP selection algorithm for coded caching but also provides a systematic way to evaluate and optimize the performance of Fog-RANs. [ABSTRACT FROM AUTHOR]

Distribution matching is a fixed-length invertible mapping from a uniformly distributed bit sequence to shaped amplitudes and plays an important role in the probabilistic amplitude shaping framework. With conventional constant-composition distribution matching (CCDM), all output sequences have identical composition. In this paper, we propose multiset-partition distribution matching (MPDM), where the composition is constant over all output sequences. When considering the desired distribution as a multiset, MPDM corresponds to partitioning this multiset into equal-sized subsets. We show that MPDM allows addressing more output sequences and, thus, has a lower rate loss than CCDM in all nontrivial cases. By imposing some constraints on the partitioning, a constructive MPDM algorithm is proposed which comprises two parts. A variable-length prefix of the binary data word determines the composition to be used, and the remainder of the input word is mapped with a conventional CCDM algorithm, such as arithmetic coding, according to the chosen composition. Simulations of 64-ary quadrature amplitude modulation over the additive white Gaussian noise channel demonstrate that the block-length saving of MPDM over CCDM for a fixed gap to capacity is approximately a factor of 2.5–5 at medium to high signal-to-noise ratios. [ABSTRACT FROM AUTHOR]

This paper introduces a novel method to improve the Time of Arrival (ToA) estimation resolution for a fixed available bandwidth in the presence of unknown multipath frequency selective (MPFS) channels. Here, the maximum rising level detector technique is proposed which utilizes oversampling and multiple correlation paths to evaluate with high resolution the path corresponding to the maximum rising level of matched filters output. However, employing such technique demands for transmission of waveform that creates a very high rising level at autocorrelation center. This paper proposes an efficient technique to design proper waveforms (very high rising level at autocorrelation center) via minimization of weighted integrated sidelobe level, exploiting the trust-region algorithm. The performance of the proposed technique is evaluated via simulations of the ToA mean square error, and compared with the state-of-the-art approaches considering the same bandwidth, and Cramer–Rao lower bound as benchmark. Simulations confirm that the ToA resolution is improved as the number of correlation paths increases and verify the feasibility of the proposed technique compared with the available approaches for the MPFS channels. [ABSTRACT FROM PUBLISHER]

Conventional networks are based on layered protocols with intensive cross-layer interactions and complex signal processing at every node, making it difficult to meet the ultra-low latency requirement of mission critical applications in future communication systems. In this paper, we address this issue by proposing the concept of network template, which allows data to flow through it at the transmission symbol level, with minimal node processing. This is achieved by carefully calibrating the inter-connecting links among the nodes and pre-calculating the routing/network coding actions for each node, according to a set of preconfigured flows. In this paper, we focus on the minimum cost network template design to minimize the connections within the template, while ensuring that all the pre-defined configurations are feasible with the guaranteed throughput, latency and reliability. We show that the minimum cost network template design problem is difficult to solve optimally in general. We thus propose an efficient greedy algorithm to find a close-to-optimal solution. Simulation results show that the construction cost of the templates obtained by the proposed algorithm is very close to a lower bound. Furthermore, the construction cost increases only slightly with the number of pre-defined configurations, which confirms the flexibility of the network template design. [ABSTRACT FROM AUTHOR]

This paper explores the problem of joint mode selection, spectrum management, power control, and interference mitigation for device-to-device (D2D) communication underlaying a Long Term Evolution-Advanced (LTE-A) network. We consider a dynamic mode selection scenario, in which the modes (D2D or cellular) of the devices depend on optimal allocations. To improve the quality of service (QoS) for the users, the optimization objective in a corresponding problem is formulated in terms of buffer size of user equipments (UEs), which is estimated based on buffer status information collected by the UEs. The realizations of a resource allocation approach presented in the paper include its real-time and non-real-time implementations, as well as two modifications applicable to a standard LTE-Direct (LTE-D) network. Performance of the proposed algorithms has been evaluated using the OPNET-based simulations. All algorithms show improved performance in terms of mean packet end-to-end delay when compared to most relevant schemes proposed earlier. [ABSTRACT FROM AUTHOR]

In this paper, we present a new low-complexity iterative joint phase estimation and decoding algorithm which can be applied to low-density-parity-check (or turbo) codes for channels affected by strong phase noise. The algorithm exhibits a very good performance and a very low complexity even in strong phase noise, high code rate, and high-order constellations. The proposed algorithm works by first obtaining a preliminary pilots-aided phase estimation. Next, the expressions for the belief propagation messages are approximated around that reference and reduced to a Gaussian canonical form. This results in a simple closed form of a recursive update. Simulations results for phase-shift-keying modulation of size 8 and quadrature-amplitude modulation of size 64 are presented and compared with other algorithms in the literature. [ABSTRACT FROM AUTHOR]

Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users’ quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method. [ABSTRACT FROM AUTHOR]

In this paper, the joint spectrum sensing and resource allocation problem is investigated in a multi-band-multi-user cognitive radio (CR) network. Assuming imperfect spectrum sensing information, our goal is to jointly optimize the sensing threshold and power allocation strategy such that the average total throughput of secondary users (SUs) is maximized. In Addition, the power of SUs is constrained to keep the interference introduced to primary users under certain limit, which gives rise to a nonconvex mixed integer non-linear programming (MINLP) optimization problem. Our contribution in this paper is threefold. First, it is illustrated that the dimension of the nonconvex MINLP problem can be significantly reduced, which helps to re-formulate the optimization problem without resorting to integer variables. Second, it is demonstrated that the simplified formulation admits the canonical form of a monotonic optimization, and an $\epsilon $ -optimal solution can be achieved using the polyblock outer approximation algorithm. Third, a practical low-complexity spectrum sensing and resource allocation algorithm is developed to reduce the computational cost. Finally, the effectiveness of proposed algorithms is verified by simulations. [ABSTRACT FROM AUTHOR]

In this paper, we show how the presence of locality within a binary cyclic code can be exploited to improve decoding performance and to reduce decoding complexity. We pursue two approaches. Under the first approach, we show how the ordered statistics decoding (OSD) method can be modified by inserting a simple single round belief-propagation step at the start that involves only the local codes. The resultant locality-aware OSD algorithm yields an appreciable signal-to-noise ratio (SNR) gain for a given level of reliability and essentially the same level of decoder complexity. Under the second, trellis decoding approach, we show that the careful introduction of locality results in the creation of a cyclic subcode that possesses lower maximum state complexity. In addition, we present a simple means of deriving an upper bound to the state complexity profile of any cyclic code that is based only on the zeros of the code. Furthermore, we show how the decoding speed of either locality-aware OSD or trellis decoding can be significantly increased in the presence of locality, in the moderate-to-high SNR regime, by making the use of a quick-look decoder that often returns the maximum likelihood code word. [ABSTRACT FROM AUTHOR]

Filtered orthogonal frequency division multiplexing (F-OFDM) system is a promising waveform for 5G and beyond to enable the multi-service system and spectrum efficient network slicing. However, the performance for F-OFDM systems has not been systematically analyzed in the literature. In this paper, we first establish a mathematical model for an F-OFDM system and derive the conditions to achieve the interference-free one-tap channel equalization. In the practical cases (e.g., insufficient guard interval, asynchronous transmission, and so on), the analytical expressions for inter-symbol interference, inter-carrier interference, and adjacent-carrier interference are derived, where the last term is considered as one of the key factors for asynchronous transmissions. Based on the framework, an optimal power compensation matrix is derived to make all of the subcarriers having the same ergodic performance. Another key contribution of this paper is that we propose a multi-rate F-OFDM system to enable low-complexity low-cost communication scenarios, such as narrow-band Internet of Things, at the cost of generating inter-subband interference (ISubBI). Low computational complexity algorithms are proposed to cancel the ISubBI. The result shows that the derived analytical expressions match the simulation results, and the proposed ISubBI cancelation algorithms can significantly save the original F-OFDM complexity (up to 100 times) without significant performance loss. [ABSTRACT FROM PUBLISHER]

Future wireless networks need to support massive machine type communication (mMTC) where a massive number of devices accesses the network and massive MIMO is a promising enabling technology. Massive access schemes have been studied for co-located massive MIMO arrays. In this paper, we investigate the activity detection in grant-free random access for mMTC in cell-free massive MIMO networks using distributed arrays. Each active device transmits a non-orthogonal pilot sequence to the access points (APs) and the APs send the received signals to a central processing unit (CPU) for joint activity detection. The maximum likelihood device activity detection problem is formulated and algorithms for activity detection in cell-free massive MIMO are provided to solve it. The simulation results show that the macro diversity gain provided by the cell-free architecture improves the activity detection performance compared to co-located architecture when the coverage area is large. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of designing good non-binary LDPC codes for Slepian-Wolf coding. The design method is based on Density Evolution which gives the asymptotic error probability of the decoder for given code degree distributions. Density Evolution was originally introduced for channel coding under the assumption that the channel is symmetric. In Slepian-Wolf coding, the correlation channel is not necessarily symmetric and the source distribution has to be taken into account. In this paper, we express the non-binary Density Evolution recursion for Slepian-Wolf coding. From Density Evolution, we then perform code degree distribution optimization using an optimization algorithm called differential evolution. Both asymptotic performance evaluation and finite-length simulations show the gain at considering optimized degree distributions for SW coding. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the design of linear precoders for simultaneously wireless information and power transfer (SWIPT) in a multi-input multi-output (MIMO) broadcasting system with discrete input signals. The considered system model consists of one base station (BS), one information receiver (IR), and one energy receiver (ER). The design objective is to maximize the input–output mutual information of the IR subject to the power constraint and the harvested energy requirement for the ER. We derive the structure of the optimal linear precoder by using manifold optimization, and propose an algorithm to find the optimal precoder. Simulation results show that the proposed algorithm can achieve better performance than the time sharing scheme and the Gaussian optimal precoder when Gaussian inputs are replaced by discrete input signals. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate resource allocation for IRS-assisted green multiuser multiple-input single-output (MISO) systems. To minimize the total transmit power, both the beamforming vectors at the access point (AP) and the phase shifts at multiple IRSs are jointly optimized, while taking into account the minimum required quality-of-service (QoS) of multiple users. First, two novel algorithms, namely a penalty-based alternating minimization (AltMin) algorithm and an inner approximation (IA) algorithm, are developed to tackle the non-convexity of the formulated optimization problem when perfect channel state information (CSI) is available. Existing designs employ semidefinite relaxation in AltMin-based algorithms, which, however, cannot ensure convergence. In contrast, the proposed penalty-based AltMin and IA algorithms are guaranteed to converge to a stationary point and a Karush-Kuhn-Tucker (KKT) solution of the design problem, respectively. Second, the impact of imperfect knowledge of the CSI of the channels between the AP and the users is investigated. To this end, a non-convex robust optimization problem is formulated and the penalty-based AltMin algorithm is extended to obtain a stationary solution. Simulation results reveal a key trade-off between the speed of convergence and the achievable total transmit power for the two proposed algorithms. In addition, we show that the proposed algorithms can significantly reduce the total transmit power at the AP compared to various baseline schemes and that the optimal numbers of transmit antennas and IRS reflecting elements, which maximize the system energy efficiency of the considered system, are finite. [ABSTRACT FROM AUTHOR]

In this paper, we establish a framework for enabling ultra-reliable and low-latency communications in the control and non-payload communications (CNPC) links of the unmanned aerial vehicle (UAV) communication systems. We first derive the available range of the CNPC links between UAVs and a ground control station. The available range is defined as the maximal horizontal communication distance within which the round-trip delay and the overall packet loss probability can be ensured with a required probability. To exploit the macro-diversity gain of the distributed multi-antenna systems (DAS) and the array gain of the centralized multi-antenna systems (CAS), we consider a modified DAS (M-DAS), where the ground control station is equipped with the distributed access points (APs), and each AP can have multiple antennas. We then show that the available range can be maximized by judiciously optimizing the altitude of UAVs, the duration of the uplink and downlink phases, and the antenna configuration. To solve the non-convex problem, we propose an algorithm that can converge to the optimal solution in DAS and CAS, and then extend it into more general M-DAS. The simulation and numerical results validate our analysis and show that the available range of M-DAS can be significantly larger than those of the DAS and CAS. [ABSTRACT FROM AUTHOR]

The broadcast nature of wireless communications makes transmission susceptible to eavesdropping. Recently, physical-layer security has been extensively studied to secure the wireless transmissions, but the security is severely compromised when the eavesdropper has the superiority in the channel quality. Toward this issue, we in this paper propose a joint ARQ and network coding method exploiting the characteristics of both the physical layer and the link layer. Specifically, we relate the message to be transmitted in the current slot with the successfully decoded messages in previous slots, where the ARQ is employed at the legitimate side to guarantee the successful transmission and decoding. Once one or more received messages fail to be decoded at the eavesdropper, it further prevents the eavesdropper from decoding the transmissions in later slots and thus the message transmitted currently and later is secured at the legitimate side. Moreover, for the more disadvantageous case that the eavesdropper is geographically closer to the transmitter, we further propose a destination-aided network coding scheme, which secures private information no matter where the eavesdropper is. The closed-form expressions of intercept probability and loss probability of the private information are analytically presented. The simulation results are provided to confirm our theoretical findings. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is a promising new paradigm to achieve high spectral and energy efficiency for future wireless networks by reconfiguring the wireless signal propagation via passive reflection. To reap the promising gains of IRS, channel state information (CSI) is essential, whereas channel estimation errors are inevitable in practice due to limited channel training resources. In this paper, in order to optimize the performance of IRS-aided multiuser communications with imperfect CSI, we propose to jointly design the active transmit precoding at the access point (AP) and passive reflection coefficients of the IRS, each consisting of not only the conventional phase shift and also the newly exploited amplitude variation. First, the achievable rate of each user is derived assuming a practical IRS channel estimation method, which shows that the interference due to CSI errors is intricately related to the AP transmit precoders, the channel training power and the IRS reflection coefficients during both channel training and data transmission. Next, for the single-user case, by combining the benefits of the penalty method, Dinkelbach method and block successive upper-bound minimization (BSUM) method, a new penalized Dinkelbach-BSUM algorithm is proposed to optimize the IRS reflection coefficients for maximizing the achievable data transmission rate subjected to CSI errors; while for the multiuser case, a new penalty dual decomposition (PDD)-based algorithm is proposed to maximize the users’ weighted sum-rate. Finally, simulation results are presented to validate the effectiveness of our proposed algorithms as compared to benchmark schemes. In particular, useful insights are drawn to characterize the effect of IRS reflection amplitude control (with/without the conventional phase-shift control) on the system performance under imperfect CSI. [ABSTRACT FROM AUTHOR]

In Vehicle-to-Everything (V2X) networks, where all vehicles and infrastructures are interconnected for information sharing, data dissemination is increasingly playing a significant role in superior and pluralistic communication services. To empower the efficiency of data dissemination, in this paper, we propose a novel unmanned aerial vehicle (UAV)-enabled scheduling protocol consisting of a proactive caching policy and a file sharing strategy in V2X networks. In the proactive caching process, we deploy UAVs as flying base stations (BSs) with caching capability, where we propose a UAV dynamic trajectory scheduling (DTS) algorithm to optimize the caching duration. Whereas in the file sharing strategy, based on the previous vehicular caching status, we provide a framework of file sharing cycle for data dissemination scheduling and employ a channel prediction algorithm to alleviate communication overhead. Moreover, we propose a relay ordering algorithm to effectively improve the file sharing process. Simulation results demonstrate that, our proposed scheduling protocol can enhance the efficiency of data dissemination and achieve an improved network performance in terms of caching process, system throughput, and file sharing latency in V2X networks. [ABSTRACT FROM AUTHOR]

This paper investigates the design and performance of delayed bit-interleaved coded modulation (DBICM) with low-density parity-check (LDPC) codes. For Gray labeled square M-ary quadrature amplitude modulation (QAM) constellations, we investigate the optimal delay scheme with the largest spectrum efficiency of DBICM for a fixed maximum number of delayed time slots and a given signal-to-noise ratio. When analyzing the capacity of DBICM, we find two important properties: the capacity improvement due to delayed coded bits being mapped to the real and imaginary parts of the transmitted symbols are independent of each other; a pair of delay schemes with delayed coded bits having identical bit-channel capacity lead to equivalent DBICM capacity. Using these two properties, we efficiently optimize the delay scheme for any uniform Gray-QAM systems. Furthermore, these two properties enable efficient LDPC code designs regarding unequal error protection via bit-channel type classifications. Moreover, we use protograph-based extrinsic information transfer charts to jointly optimize degree distributions and channel assignments of LDPC codes and propose a constrained progressive edge growth like algorithm to jointly construct LDPC codes and bit-interleavers for DBICM, taking distinctive bit-channel’s capacity into account. Simulation results demonstrate that the designed LDPC coded DBICM systems significantly outperform LDPC coded BICM systems. [ABSTRACT FROM AUTHOR]

In this paper, we present a low-complexity recursive approach for massive and scalable code-domain nonorthogonal multiple access (NOMA) with applications to emerging low-capacity scenarios. The problem definition in this paper is inspired by three major requirements of the next generations of wireless networks. Firstly, the proposed scheme is particularly beneficial in low-capacity regimes which is important in practical scenarios of utmost interest such as the Internet-of-Things (IoT) and massive machine-type communication (mMTC). Secondly, we employ code-domain NOMA to efficiently share the scarce common resources among the users. Finally, the proposed recursive approach enables code-domain NOMA with low-complexity detection algorithms that are scalable with the number of users to satisfy the requirements of massive connectivity. To this end, we propose a novel encoding and decoding scheme for code-domain NOMA based on factorizing the pattern matrix, for assigning the available resource elements to the users, as the Kronecker product of several smaller factor matrices. As a result, both the pattern matrix design at the transmitter side and the mixed symbols’ detection at the receiver side can be performed over matrices with dimensions that are much smaller than the overall pattern matrix. Consequently, this leads to significant reduction in both the complexity and the latency of the detection. We present the detection algorithm for the general case of factor matrices. The proposed algorithm involves several recursions each involving certain sets of equations corresponding to a certain factor matrix. We then characterize the system performance in terms of average sum rate, latency, and detection complexity. Our latency and complexity analysis confirm the superiority of our proposed scheme in enabling large pattern matrices. Moreover, our numerical results for the average sum rate show that the proposed scheme provides better performance compared to straightforward code-domain NOMA with comparable complexity, especially at low-capacity regimes. [ABSTRACT FROM AUTHOR]

Reconfigurable Intelligent Surfaces (RISs) have been recently considered as an energy-efficient solution for future wireless networks due to their fast and low-power configuration, which has increased potential in enabling massive connectivity and low-latency communications. Accurate and low-overhead channel estimation in RIS-based systems is one of the most critical challenges due to the usually large number of RIS unit elements and their distinctive hardware constraints. In this paper, we focus on the uplink of a RIS-empowered multi-user Multiple Input Single Output (MISO) uplink communication systems and propose a channel estimation framework based on the parallel factor decomposition to unfold the resulting cascaded channel model. We present two iterative estimation algorithms for the channels between the base station and RIS, as well as the channels between RIS and users. One is based on alternating least squares (ALS), while the other uses vector approximate message passing to iteratively reconstruct two unknown channels from the estimated vectors. To theoretically assess the performance of the ALS-based algorithm, we derived its estimation Cramér-Rao Bound (CRB). We also discuss the downlink achievable sum rate computation with estimated channels and different precoding schemes for the base station. Our extensive simulation results show that our algorithms outperform benchmark schemes and that the ALS technique achieves the CRB. It is also demonstrated that the sum rate using the estimated channels always reach that of perfect channels under various settings, thus, verifying the effectiveness and robustness of the proposed estimation algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we investigate parameter estimation for generalized frequency division multiplexing (GFDM) signals over frequency-selective fading channels. Based on the characteristics of the second-order cyclostationary statistics of GFDM signals, we develop algorithms to blindly estimate pure block duration, overall block duration, symbol duration, and number of subcarriers. The proposed algorithms are robust to timing, phase, and carrier frequency uncertainties and do not require any a priori knowledge of the received signal. Simulation results verify the feasibility of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Path planning is an important component of autonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sensor networks, to drive power-distortion metrics for path planning problems. The Gaussian multiple-access channel is employed as a channel model and two source models are considered. In the first setting, the underlying source is estimated with minimum mean-squared-error, while in the second, reconstruction of a random spatial field is considered. For both problem settings, the upper and the lower bounds of sensor power-distortion curve are derived. For both settings, the upper bounds follow from the amplify-and-forward scheme and the lower bounds admit a unified derivation based on data processing inequality and tensorization property of the maximal correlation measure. Next, closed-form solutions of the optimal power allocation problems are obtained under a weighted sum-power constraint. The gap between the upper and the lower bounds is analyzed for both weighted sum and individual power constrained settings. Finally, these metrics are used to drive a path planning algorithm and the effects of power-distortion metrics, network parameters, and power optimization on the optimized path selection are analyzed. [ABSTRACT FROM AUTHOR]

Phase noise poses a serious challenge for high-speed digital communications systems mainly when going to higher and higher carrier frequencies, such as in satellite communications. Traditionally, phase noise estimation was performed separately from the decoding task and it was shown, recently, that there is much to be gained from joint estimation and decoding, particularly when using LDPC (low-density parity check)/turbo codes. However, jointly estimating phase noise and decoding is a very complex and computationally demanding task. In this paper, we propose several algorithms based on the sum and product algorithm (SPA) for low complexity joint decoding and estimation of coded information in strong phase noise channels. These algorithms are based on a novel approximation of SPA messages as Tikhonov mixtures of a given order. Since mixture-based Bayesian inference such as SPA, creates an exponential increase in mixture order for consecutive messages, a mixture reduction scheme is a must. Therefore, in this paper, we propose a low complexity mixture reduction algorithm, which provably satisfies an upper bound on the Kullback Leibler (KL) divergence between the mixture and the reduced mixture. We then reduce the complexity even further, including limiting the model order and reducing the clustering effort to simple component selection. As an extreme case, it is even possible to reduce the number of modes to one. We show the relation between the simplified algorithm to the phase locked loop (PLL). Finally, we show simulation results and complexity analysis for the proposed algorithms, which show superior performance over other state of the art low complexity algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we consider the downlink transmission of URLLC packets requiring very low latency and ultra-reliability. Because of the low latency constraint, the Base Station may not have enough time to acquire the instantaneous Channel State Information (CSI) of the corresponding device and has then to transmit urgent packets immediately in the absence of CSI. To enhance reliability, we explore frequency diversity where a packet can be simultaneously sent over multiple channels. Using a Markov Decision Process framework, we address the problem of dynamic channel allocation to the URLLC devices in absence of instantaneous CSI. More precisely, we define a multi-agent MDP wherein the state of each device is the packet loss rate experienced in the previous time slots and the decision variable is how to split the available orthogonal channels across the devices. We design a new low-complexity algorithm which avoids the exhaustive enumeration of all possible resource allocations and enables significant computational savings compared to the Value Iteration algorithm. We investigate the gap between our proposed low complexity algorithm and the Value Iteration policy. We provide numerical performance results and show that our algorithm can achieve more than 80% of the optimal reward with substantial computational complexity reduction. [ABSTRACT FROM AUTHOR]

Modern coding advances, including dirty paper coding and information hiding, require quantizing a given binary word to a code word. A 'good' solution would approach the rate-distortion bound in lossy source compression. Here we propose a simple variant on belief propagation which is observed to converge to a solution giving respectable rate-distortion performance. Comparisons with other recently proposed source quantization methods reveal that the proposed algorithm holds particular interest in short block-length applications, as encountered in packet-based communication systems. [ABSTRACT FROM AUTHOR]

This paper proposes a cross-layer optimization framework for the wireless sensor networks. In a wireless sensor network, each sensor makes a local observation of the underlying physical phenomenon and sends a quantized version of the observation to a central location via wireless links. As the sensor observations are often partial and correlated, the network performance is a complicated and nonseparable function of individual data rates at each sensor. In addition, due to the shared nature of wireless medium, nearby transmissions often interfere with each other. Thus, the traditional "bit-pipe" model for network link capacity no longer holds. This paper deals with the joint optimization of source quantization, routing, and power control in a wireless sensor network. We follow a separate source and channel coding approach and show that the overall network optimization problem can be naturally decomposed into a source coding subproblem at the application layer and a wireless power control subproblem at the physical layer. The interfaces between the layers are precisely the dual optimization variables. In addition, we introduce a novel source coding model at the application layer, which allows the efficient design of practical source quantization schemes at each sensor. Finally, we propose a dual algorithm for the overall network optimization problem. The dual algorithm, when combined with a column-generation method, allows an efficient solution for the overall network optimization problem. [ABSTRACT FROM AUTHOR]

This paper studies the asymptotic performance of a multiple-input multiple-output (MIMO) multiple-access (MA) wireless network where spatial correlations at both the transmitters (i.e., mobile stations) and the central receiver (i.e., base station) exist, and more than one multiantenna sets are employed at the receiver to provide macrodiversity. The sense of asymptotic behavior we consider is the large-system limit in which the numbers of antennas at each mobile station and antenna set go to infinity with their ratios fixed. Using the replica method, we derive analytical solutions to the asymptotic spectral efficiency (SE) of the MIMO-MA systems for any given input distributions (not necessarily Gaussian) from the mobile transmitters. Our results can be regarded as the generalization of many previously known results for degenerate cases. Another contribution of this paper is an efficient algorithm to determine the asymptotic optimum transmit-signal covariance matrices that can maximize the SE of the MIMO-MA network within the period in which the spatial channel covariance information (CCI) can be considered static, and assuming that only CCI is available at the transmitters. [ABSTRACT FROM AUTHOR]

Multi-user spatial modulation (SM) assisted by sparse code multiple access (SCMA) has been recently proposed to provide uplink high spectral efficiency transmission. The message passing algorithm (MPA) is employed to detect the transmitted signals, which suffers from high complexity. This paper proposes three low-complexity algorithms for the first time to the SM-SCMA. The first algorithm is referred to as successive user detection (SUD), while the second algorithm is the modified version of SUD, namely modified SUD (MSUD). Then, for the first time, the tree-search of the SM-SCMA is constructed. Based on that tree-search, another variant of the sphere decoder (SD) is proposed for the SM-SCMA, referred to as fixed-complexity SD (FCSD). SUD provides a benchmark for decoding complexity at the expense of bit-error-rate (BER) performance. Further, MSUD slightly increases the complexity of SUD with a significant improvement in BER performance. Finally, FCSD provides a near-optimum BER with a considerable reduction of the complexity compared to the MPA decoder and also supports parallel hardware implementation. The proposed algorithms provide flexible design choices for practical implementation based on system design demands. The complexity analysis and Monte-Carlo simulations of the BER are provided for the proposed algorithms. [ABSTRACT FROM AUTHOR]

The interpolation based algebraic soft decoding yields a high decoding performance for Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expensive interpolation can be facilitated using the module structure. The desired Gröbner basis can be achieved by reducing the basis of a module. This paper proposes the low-complexity Chase (LCC) decoding algorithm using this module basis reduction (BR) interpolation technique, namely the LCC-BR algorithm. By identifying $\eta $ unreliable symbols, $2^\eta $ decoding test-vectors will be formulated. The LCC-BR algorithm first constructs a common basis which will be shared by the decoding of all test-vectors. This eliminates the redundant computation in decoding each test-vector, resulting in a lower decoding complexity and latency. This paper further proposes the progressive LCC-BR algorithm that decodes the test-vectors sequentially and terminates once the maximum-likelihood decision decoding outcome is reached. Exploiting the difference between the adjacent test-vectors, this progressive decoding is realized without any additional memory cost. Complexity analysis shows that the LCC-BR algorithm yields a lower complexity and latency, especially for high rate codes, which will be validated by the numerical results. [ABSTRACT FROM AUTHOR]

Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems (DSSs) such as Microsoft Azure Storage and Facebook HDFS-RAID (Hadoop Distributed File System-Redundant Array of Independent Disks). Since information in DSSs is changed frequently, reducing update complexity (UC) of LRCs is of great interest. In this paper, we propose code design algorithms that can reduce UC of existing LRCs without sacrificing their important code parameters such as minimum distance, code rate, or locality. We establish bounds on UC, and use them to show that our algorithms can achieve optimal or near optimal UC for a large class of LRCs. [ABSTRACT FROM AUTHOR]

In this paper, an optimization problem to maximize the energy efficiency of a hybrid automatic repeat request with incremental redundancy (HARQ-IR) is considered for massive multiple-input multiple-output (MIMO) systems. Because a sum rate for multiple HARQ-IR rounds is approximated by a Gaussian distribution, a problem maximizing energy efficiency becomes tractable. In particular, a simplified form of energy efficiency for massive MIMO transmissions with an HARQ-IR protocol is derived using an outage probability, which is given by a tail probability of the Gaussian distribution. By exploiting the proposed simplified form, we show that the energy efficiency of the system is approximated by a piecewise quasi-concave function. Using these properties, an algorithm finding the optimal transmission power and number of transmission rounds for maximizing energy efficiency is proposed. Moreover, we show that the optimal number of HARQ transmission rounds can be less than the maximum allowable retransmissions when considering the constant power consumption of the massive MIMO system with an HARQ-IR protocol. Simulation results verify the theoretical analysis and show the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we devise a fast encoding algorithm for triply extended Reed–Solomon codes. The proposed approach requires approximately two XORs per bit, which improves the prior result of three XORs per bit established by certain maximum distance separable (MDS) array codes. We also prove that, for MDS codes with two and three parities, the scheduling algorithms require at least two XORs per bit. To the best of our knowledge, this is the first provable scheduling algorithm for the triple-parity MDS codes to approach the theoretical lower bounds. The implementation with SIMD instructions is provided. The simulations show that the proposed approach is competitive, as compared with other cutting edge implementations. [ABSTRACT FROM AUTHOR]

In this paper, we give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) of variable-regular LDPC codes with any girth, $g$ , and irregular ones with girth 8, where $a$ is the size and $b$ is the number of degree-one check nodes. Our proposed lower bounds are analytical, applicable to all values of $g$ and $b$ , based on graph theories and tighter than the existing ones in the literature. Our results mostly depend on the girth. We also propose results, which are independent of the girth and rely on the variables $a$ , $b$ , $\gamma $ , and the column weight value. We obtain the tightest lower bounds on the size of ETSs of variable-regular LDPC codes with girth eight. These results provide us with a chance to present a method to achieve the minimum size of ETSs of irregular LDPC codes with girth, especially those whose column weight values are a subset of {2, 3, 4, 5, 6} and fulfill the inequality $(b/a)<1$. Moreover, we present a range of numerical results about $(a,b)$ ETSs with girths 8 and 10 to compare the tightness between our proposed lower bounds and the existing bounds in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we design a robust resource allocation algorithm for a wireless-powered communication network (WPCN) taking into account residual hardware impairments (HWIs) at the transceivers, the imperfectness of the channel state information, and the non-linearity of practical radio frequency energy harvesting circuits. In order to ensure power-efficient secure communication, physical layer security techniques are exploited to deliberately degrade the channel quality of a multiple-antenna eavesdropper. The resource allocation algorithm design is formulated as a non-convex optimization problem for minimization of the total power consumption in the network, while guaranteeing the quality of service of the information receivers in terms of secrecy rate. The globally optimal solution of the optimization problem is obtained via a 2-D search and semidefinite programming relaxation. To strike a balance between computational complexity and system performance, a low-complexity iterative suboptimal resource allocation algorithm is also proposed. Numerical results demonstrate that both the proposed optimal and suboptimal schemes can significantly reduce the total system power consumption required for guaranteeing secure communication, and unveil the impact of HWIs on the system performance: 1) residual HWIs create a system performance bottleneck in WPCN in the high transmit/receive power regimes; 2) increasing the number of transmit antennas can effectively reduce the power consumption of wireless power transfer and alleviate the performance degradation due to residual HWIs; and 3) imperfect CSI exacerbates the impact of residual HWIs, which increases the power consumption of both wireless power and wireless information transfer. [ABSTRACT FROM AUTHOR]

Algebraic-geometric (AG) codes have good error-correction capability due to their generally large code word length. However, their decoding remains complex, preventing practical applications. Addressing the challenge, this paper proposes two interpolation-based low-complexity Chase (LCC) decoding algorithms for one of the most popular AG codes-Hermitian codes. By choosing $\eta $ unreliable symbols and realizing them with the two most likely decisions, $2^\eta $ decoding test-vectors can be formulated. The first LCC algorithm performs interpolation for the common elements of the test-vectors, producing an intermediate outcome that will be shared by the uncommon element interpolation. It eliminates the redundant computation for decoding each test-vector, resulting in a low-complexity. With an interpolation multiplicity of one, the decoding is further facilitated by removing the requirement of pre-calculating the Hermitian curve’s corresponding coefficients. The second LCC algorithm is an adaptive variant of the first algorithm, where the number of test-vectors is determined by the reliability of received information. When the channel condition improves, it can reduce the complexity without compromising the decoding performance. Simulation results show that the both LCC algorithms outperform a number of existing algebraic decoding algorithms for Hermitian codes. Finally, our complexity analysis will reveal the proposals’ low-complexity feature. [ABSTRACT FROM PUBLISHER]

Generalized frequency division multiplexing (GFDM) is one of the new waveforms with several attractive features such as lower out of band radiation, higher spectral efficiency, and better immunity to carrier frequency offset errors as compared with orthogonal frequency division multiplexing. However, it requires receivers with high computational complexity. Among different linear receiver structures, the joint minimum mean square error (joint-MMSE) receiver for GFDM achieves the best bit-error-rate (BER) performance, but it is the most computationally complex linear receiver. In this paper, we present a novel low complexity joint-MMSE receiver. We derive the closed-form expression for the joint-MMSE receiver filter by harnessing circulant properties of the matrices involved in the demodulation process. Amidst different operations involved in the receiver processing, inversion of a positive definite circulant-plus-diagonal matrix is found to be the costliest. Two low-complexity algorithms for the inversion of a positive definite circulant-plus-diagonal matrix are developed to design the low complexity receiver. We also propose a low complexity bias correction to improve BER performance. Our proposed receiver achieves a log-linear order of complexity without any noticeable loss in BER performance. [ABSTRACT FROM AUTHOR]

In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check block codes and exploit suitable unwrapping procedures to obtain SC-LDPC-CCs. We show that the direct design of the SC-LDPC-CCs syndrome former matrix or, equivalently, the symbolic parity-check matrix, leads to codes with smaller syndrome former constraint lengths with respect to the best solutions available in the literature. We provide theoretical lower bounds on the syndrome former constraint length for the most relevant families of SC-LDPC-CCs, under constraints on the minimum length of cycles in their Tanner graphs. We also propose new code design techniques that approach or achieve such theoretical limits. [ABSTRACT FROM PUBLISHER]

The exponential growth of mobile data traffic is driving the deployment of dense wireless networks, which will not only impose heavy backhaul burdens, but also generate considerable power consumption. Introducing caches to the wireless network edge is a potential and cost-effective solution to address these challenges. In this paper, we will investigate the problem of minimizing the network power consumption of cache-enabled wireless networks, consisting of the base station (BS) and backhaul power consumption. The objective is to develop efficient algorithms that unify adaptive BS selection, backhaul content assignment, and multicast beamforming, while taking account of user QoS requirements and backhaul capacity limitations. To address the NP-hardness of the network power minimization problem, we first propose a generalized layered group sparse beamforming (LGSBF) modeling framework, which helps to reveal the layered sparsity structure in the beamformers. By adopting the reweighted \ell 1 /\ell 2 -norm technique, we further develop a convex approximation procedure for the LGSBF problem, followed by a three-stage iterative LGSBF framework to induce the desired sparsity structure in the beamformers. Simulation results validate the effectiveness of the proposed algorithm in reducing the network power consumption, and demonstrate that caching plays a more significant role in networks with higher user densities and less power-efficient backhaul links. [ABSTRACT FROM PUBLISHER]

Location-aware wireless networks can provide precise location information in harsh environments, however, which is only possible when all nodes are well-functioning. In this paper, we propose algorithms and analyze the performance limits for both non-cooperative and cooperative localization networks in the presence of ranging outliers. Especially, we show that the localization performance can be boosted by using the cooperative outlier detection scheme. An algorithm based on expectation-maximization is proposed for non-cooperative localization networks, while a variational message passing-based algorithm is proposed for the cooperative counterparts. Performance limits are investigated using Cramér–Rao lower bound. Further inspection on the performance limits confirms the performance gain from the cooperative detection scheme. Stochastic geometric analysis is also carried out to account for the stochastic nature of wireless networks, as well as to provide simpler expressions and additional insights. Simulation results corroborate the analytical results, and show that both of the proposed algorithms are capable of attaining the corresponding performance limits at a significantly reduced computational cost compared with existing algorithms. [ABSTRACT FROM PUBLISHER]

In this paper, we study the user pairing in a downlink non-orthogonal multiple access (NOMA) network, where the base station allocates the power to the pairwise users within the cluster. In the considered NOMA network, a user with poor channel condition is paired with a user with good channel condition, when both their rate requirements are satisfied. Specifically, the quality of service for weak users can be guaranteed, since the transmit power allocated to strong users is constrained following the concept of cognitive radio. A distributed matching algorithm is proposed in the downlink NOMA network, aiming to optimize the user pairing and power allocation between weak users and strong users, subject to the users’ targeted rate requirements. Our results show that the proposed algorithm outperforms the conventional orthogonal multiple access scheme and approaches the performance of the centralized algorithm, despite its low complexity. In order to improve the system’s throughput, we design a practical adaptive turbo trellis coded modulation scheme for the considered network, which adaptively adjusts the code rate and the modulation mode based on the instantaneous channel conditions. The joint design work leads to significant mutual benefits for all the users as well as the improved system throughput. [ABSTRACT FROM PUBLISHER]

In this paper, we consider a cooperative diffusion-based molecular communication (MC) network consisting of single source, single decode-and-forward relay, and single destination. The source and the relay nodes use different types of molecules for information transmission. Considering both the relay and the direct links at the destination node, we have two different received signals that can be used by the destination node to retrieve the data transmitted by the source node. Therefore, diversity arises at the destination node. For detection, we adopt the energy detector applying the diversity combining technique. Since the optimum relay position in relay-aided networks plays a crucial role to enhance their performance, we study the relay location optimization problem. We first derive a closed-form expression for the bit error probability of the proposed detection scheme in which the received energy from the source and the relay nodes are linearly combined at the destination node. Then, in order to find the optimum relay position as well as the optimal destination decision threshold for a given number of molecules released by the source and the relay nodes, we formulate a joint optimization problem whose objective is to minimize the bit error probability of the network. To solve this optimization problem, we propose an iterative algorithm based on the block coordinate descent algorithm and study its convergence behavior. Numerical results show that the error performance can be improved by optimizing the position of the relay node. Our analyses help us in designing a reliable cooperative diffusion-based MC network. [ABSTRACT FROM PUBLISHER]

This paper studies robust energy optimization for the cloud radio access network (C-RAN). The objective of this paper is to jointly minimize network power consumption through optimizing the base station (BS) mode, multi-user (MU)-BS association, and beamforming vectors given imperfect channel state information (CSI). To solve this non-trivial problem, we first transform the problem to a semi-definite programming (SDP) one using the S-lemma with the aid of the semi-definite relaxation technique, and then propose a SDP-based group sparse beamforming approach to solve it iteratively. Since the computational complexity of solving SDP problems is intractable, we propose to translate the uncertainty in the CSI to the uncertainty in its covariance matrix, and then recast the original problem as a mixed-integer second-order cone programming problem. We further propose a two-stage rank selection framework to determine the BS mode and MU-BS association separately and successively. Simulation results demonstrate the convergence of our proposed algorithms, and validate the effectiveness of the proposed algorithms in minimizing the network power consumption of the C-RAN. [ABSTRACT FROM PUBLISHER]

This paper investigates the problem of dynamic spectrum access for canonical wireless networks, in which the channel states are time-varying. In the most existing work, the commonly used optimization objective is to maximize the expectation of a certain metric (e.g., throughput or achievable rate). However, it is realized that expectation alone is not enough since some applications are sensitive to fluctuations. Effective capacity is a promising metric for time-varying service process since it characterizes the packet delay violating probability (regarded as an important statistical quality-of-service index), by taking into account not only the expectation but also other high-order statistic. Therefore, we formulate the interactions among the users in the time-varying environment as a non-cooperative game, in which the utility function is defined as the achieved effective capacity. We prove that it is an ordinal potential game which has at least one pure strategy Nash equilibrium. Based on an approximated utility function, we propose a multi-agent learning algorithm which is proved to achieve stable solutions with dynamic and incomplete information constraints. The convergence of the proposed learning algorithm is verified by simulation results. Also, it is shown that the proposed multi-agent learning algorithm achieves satisfactory performance. [ABSTRACT FROM PUBLISHER]