Search

The efficiency of link adaptation in wireless communications relies greatly on the accuracy of channel knowledge and transmission mode selection. In this paper, a novel deep learning based link adaptation framework is proposed for the orthogonal frequency-division multiplexing (OFDM) systems with compressed-sensing-assisted index modulation, termed as OFDM-CSIM, communicating over millimeter-wave (mmWave) channels. To achieve link adaptation, a novel multi-layer sparse Bayesian learning (SBL) algorithm is proposed for accurately and instantaneously providing the required channel state information. Meanwhile, a deep neural networks (DNN)-assisted adaptive modulation algorithm is proposed to choose the best possible transmission mode to maximize the achievable throughput. Simulation results show that the proposed multi-layer SBL algorithm enables more accurate channel estimation than the conventional techniques. The DNN-based adaptive modulator is capable of achieving a higher throughput than the learning-assisted solution based on the $k$ nearest neighbor ($k$ -NN) algorithm, and also the classic average signal-to-noise ratio (SNR)-based solutions. Moreover, analysis shows that both the multi-layer SBL algorithm and the DNN-assisted adaptive modulator achieve better performance than their respective conventional counterparts while at a significantly lower computational complexity cost. [ABSTRACT FROM AUTHOR]

This article discusses the self-sustainability of reconfigurable intelligent surface (RIS) in wireless powered Internet of Things (IoT) networks. Our vision is that RIS helps improve energy harvesting and data transmission capabilities simultaneously, without the extra utilization of RF spectrum and energy consumption. The inherent properties of RIS are first discussed to unveil its distinctive features, followed by a broader range of use cases motivated by RIS as their enabling technology. The focus is on the application of RIS in the wireless powered IoT networks, and its potential to interconnect and support these practical use cases. Such an application is then thoroughly evaluated in a case study of an RIS-assisted wireless powered sensor network, with system throughput, energy transmission time consumption, and energy harvesting as the key performance metrics. The comprehensive performance evaluation showcases the self-sustainable property of RIS being unlocked in the considered scenario, identifying a clear pathway toward the future wireless powered IoT networks. We further pave the way by exploring research challenges and open issues related to emerging technological development. [ABSTRACT FROM AUTHOR]

A forward error correction (FEC) and unity-rate coded (URC) autoencoder (AE)-assisted communication system is proposed for the first time, which relies on soft iterative decoding for attaining a vanishingly low error probability. The AE-demapper is specifically designed for directly calculating the extrinsic logarithmic likelihood ratios (LLRs), which can be directly entered into the URC decoder for soft iterative decoding. This avoids the potential degradation due to the conversion of symbol probabilities to bit LLRs. A comprehensive capacity analysis of the AE is performed, which demonstrates the capacity advantage of the AE-aided constellation design over its conventional quadrature amplitude modulation (QAM)/ phase shift keying (PSK) counterpart. Furthermore, we carry out its EXtrinsic Information Transfer (EXIT) chart analysis, which indicates that as a benefit of our URC, the EXIT curve always reaches the [1,1] point of perfect convergence, leading to a vanishingly low error probability. More explicitly, our bit error ratio (BER) and block error ratio (BLER) results demonstrate that the proposed FEC-URC-AE system achieves significant iterative gains both in additive white Gaussian noise (AWGN) and Rayleigh channels, outperforming both its model-based FEC-AE and its conventional coded QAM/QPSK counterparts. [ABSTRACT FROM AUTHOR]

This paper investigates the first resource management problem for vehicular-to-infrastructure (V2I) networks under the in-band full-duplex (IBFD) backhauling scheme with guaranteed ultra-reliable and low-latency (URLLC) service. The considered networks suffers from interference caused by three node transmission in IBFD scheme and the mobility of vehicular user equipments (VUEs). The resource allocation problem is formulated to jointly optimize VUE association, resource block assignment (RA) and power allocation (PA), while satisfying the reliability and latency constraints at the same time. The formulated problem is a mixed integer non-linear problem with non-convex objective function and constraints. Finding globally optimal solution for this type of problem is still an open problem. To develop tractable solutions, the original problem is firstly simplified using derived equivalent expression for the objective function. The proposed method then decomposed it into RA and PA sub-problems. In each iteration, the PA sub-problem is solved for a set of given PA solution; while the solution for PA sub-problem is searched under determined RA results. The RA and PA sub-problems are solved iteratively until the converging condition is achieved. Theoretical analysis proves that the proposed method achieves Nash-stable equilibrium and local optimality for RA and PA sub-problems respectively. Simulation results verify the effectiveness of the derived performance analysis and demonstrate that the proposed algorithm outperforms the state-of-the-art algorithms in the literatures. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RIS) constitute a revolutionary technique of beneficially reconfiguring the smart radio environment. However, despite the fact that wireless propagation is of time-varying nature, most of the existing RIS contributions focus on time-invariant scenarios for the following reasons. Firstly, it becomes impractical to instantaneously feed back the control signal based on the doubly selective non-line-of-sight (NLoS) fading scenario. Secondly, channel estimation conceived for the high-mobility and high-dimensional RIS-assisted links has to take into account the spatial-domain (SD), time-domain (TD), and frequency-domain (FD) correlations imposed by the angle-of-arrival/departure (AoA/AoD), the Doppler and the orthogonal frequency-division multiplexing (OFDM) operations, respectively, where none of the existing solutions can be directly applied. Thirdly, it is far from trivial to maximize the NLoS channel powers on all subcarriers by a common set of RIS reflecting coefficients. Fourthly, in the face of double selectivity, it becomes inevitable to encounter either inter-symbol interference (ISI) or inter-channel interference (ICI) during the signal detection in the TD or in the FD, respectively. Against this background, firstly, we focus our attention on line-of-sight (LoS) dominated unmanned aerial vehicle (UAV) scenarios. Secondly, we conceive new minimum mean squared error (MMSE) channel estimation methods for doubly selective fading, which perodically transmit pilot symbols embedded into the TD and FD over the SD in order to beneficially exploit the correlations in the three domains. Thirdly, the RIS coefficients are optimized by a low-complexity algorithm based on the LoS representation of the end-to-end system model. Fourthly, tailor-made interference cancallation techniques are devised for improving the signal detection both in the FD and in the TD. Our simulation results are examined in six frequency bands licensed in 5 G, which confirms that the employment of RIS is capable of achieving substantial performance improvements. [ABSTRACT FROM AUTHOR]

In band full duplex (IBFD) has the potential to not only double spectral efficiency (SE) but also greatly reduce transmission latency. However, the immaturity of existing self-interference cancellation (SIC) techniques renders IBFD impractical for near-future wireless applications. To inherit the merits of FD but with practical SIC requirements, multicarrier-division duplex (MDD) was recently proposed and studied. In this article, we demonstrate the advantages of MDD over the IBFD mode and the conventional half-duplex (HD) modes of frequency-division duplex (FDD) and time-division duplex (TDD) from several essential aspects, including SIC capability, resource integration, and the support for high-mobility communications. Several numerical results are included to show that MDD outperforms IBFD in terms of energy efficiency (EE) and SIC. Compared with the HD modes, MDD is capable of efficiently integrating DL/UL resources to achieve higher SE and significantly outperforms TDD when communicating over fast time-varying channels. Finally, some implementation challenges of MDD systems are discussed. [ABSTRACT FROM AUTHOR]

Differential frequency hopping (DFH) technique is widely used in wireless communications by exploiting its capabilities of mitigating tracking interference and confidentiality. However, electronic attacks in wireless systems become more and more rigorous, which imposes a lot of challenges on the DFH sequences designed based on the linear congruence theory, fuzzy and chaotic theory, etc. In this article, we investigate the sequence design in DFH systems by exploiting the equivalence principle between the G-function algorithm and the encryption algorithm, in order to achieve high security. In more details, first, the novel G-function is proposed with the aid of the Government Standard algorithm and the Rivest–Shamir–Adleman algorithm. Then, two sequence design algorithms are proposed, namely, the G-function-assisted sequence generation algorithm, which takes the full advantages of the symmetric and asymmetric encryption algorithms, and the high-order G-function-aided sequence generation algorithm, which is capable of enhancing the correlation of the elements in a DFH sequence. Moreover, the security and ergodicity performance of the proposed algorithms are analyzed. Our studies and results show that the DFH sequences generated by the proposed algorithms significantly outperform the sequences generated by the reversible hash algorithm and affine transformation in terms of the uniformity, randomness, complexity, and the security. [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]

Message passing (MP) aided detectors are designed for orthogonal time frequency space (OTFS) modulated system. We first characterize the transmit-receive relationship of our OTFS-modulated system in the delay-Doppler (DD) domain by designing a joint factor graph. Based on this joint factor graph, we then conceive a joint message passing aided (JMPA) detector. Furthermore, a novel low-complexity Gaussian approximate MP (GA-MP) detector is also conceived, which models the a posteriori probabilities propagated through the proposed joint factor graph by Gaussian distributions. Finally, we demonstrate that the proposed GA-MP detector outperforms the state-of-the-art MP detector by at least 1.5 dB at a bit error ratio (BER) of $10^{-4}$ , while keeping the same complexity order. [ABSTRACT FROM AUTHOR]

Low complexity approximate message passing (AMP) orthogonal frequency division multiplexing combined with index modulation (OFDM-IM) detection algorithms are proposed, which exploit the sparse structure of the frequency domain (FD) OFDM-IM symbols. To circumvent the high root mean square error (RMSE) in the conventional AMP algorithm, a minimum mean square error (MMSE) denoiser is proposed based on the classic Bayesian approach and on the state evolution of AMP. Our simulation results demonstrate that it is capable of improving both the RMSE as well as the convergence rate. However, in practice, the channel's diagonal FD matrix may be a non-Gaussian sensing matrix, hence a damping strategy is conceived. In conclusion, the proposed MMSE denoiser based damping-assisted AMP-aided detector strikes a compelling bit error ratio vs. complexity trade-off. [ABSTRACT FROM AUTHOR]

In-band full-duplex (IBFD) systems require promising resource allocation (RA) strategies to fully exploit the available time-frequency resources. Furthermore, the acquisition of channel state information and signal reception in IBFD systems are significantly impacted by insufficient self-interference cancellation (SIC), impeding the applications of IBFD in practical wireless systems. Multicarrier-division duplex (MDD), which benefits low-budget SI mitigation in digital domain and flexible subcarrier assignment, is expected to be a promising transitional technique from half-duplex (HD) to IBFD. To demonstrate the advantages of MDD over HD, this paper first compares the upper-bound performance of MDD and HD by applying unfair greedy RA. Then, considering the millimeter-wave (mmWave) with hybrid beamforming, we propose the RA optimization with the quality-of-service constraints on both downlink (DL) and uplink (UL) mobile-stations (MSs). To solve this non-convex RA problem, we divide it into a suboptimal subcarrier allocation problem solved by the proposed improved fair greedy (IFG) algorithm, and a convex power allocation problem. Furthermore, we design two general hybrid precoder based on matrix factorization and direct approach, and a combiner having high SIC capability. Our results show that the proposed RA algorithm can achieve the performance near the upper-bound achieved by the unfair greedy algorithm, while guaranteeing the proportional fairness among all DL/UL MSs. The performance of the two precoding schemes is depended on the number of radio frequency chains supported. Finally, the proposed SIC algorithm is able to provide sufficient SI mitigation, which can be implemented without impacting the RA operation. [ABSTRACT FROM AUTHOR]

Space-time coded generalized spatial modulation-aided sparse code division multiple access (STC/GSM-SCDMA) is proposed, which exploits the two-dimensional transmit diversity potential of both the spatial and of the frequency domain. Hence, it constitutes a promising solution for the pervasive connectivity of devices in next-generation nonorthogonal multiple access (NOMA) systems. More explicitly, our STC/GSM scheme achieves diversity in the spatial-domain, while the sparse signal-spreading action of SCDMA results in frequency-domain (FD) diversity. A single-user bit error rate (BER) bound is derived as the benchmark of the BER performance of our STC/GSM-SCDMA system. Furthermore, a pair of novel detectors, namely a bespoke message passing aided (MPA) detector and a tailor-made approximate message passing (AMP) detector are conceived by designing a new factor graphs for our proposed STC/GSM-SCDMA system. The performance of these detectors is characterized in terms of their BER vs. complexity. Our simulation results show that the proposed AMP detector is capable of operating within 2 dB of the MPA detector’s signal-to-noise ratio (SNR) requirement, while supporting a normalized user load of 150%, despite its appealing low complexity, which is about 1000 times lower than the MPA detector. [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]

This paper proposes a novel transmission policy for a wireless powered sensor network (WPSN) assisted by an intelligent reflecting surface (IRS) to enhance the performance of wireless energy transfer (WET) and wireless information transfer (WIT) with certain phase shifts. To achieve its self-sustainability, IRS collects energy from the energy station to support its own control circuit operation. Our proposed policy for the considered WPSN is called IRS assisted harvest-then-transmit time switching (IRS-HTT-TS), which is capable to schedule the transmission time slots by switching between energy collection and energy reflection modes. We provide a joint design of the transmission time slots, the power allocation as well as the discrete phase shifts of the WET and WIT, aiming to maximize the system sum throughput. This formulates a problem as a mixed-integer non-linear program (MINLP), which is NP-hard and non-convex. To effectively solve this problem, we first relax it to the one with continuous phase shifts, and then propose a two-step approach and decompose the original problem into two sub-problems. We address the first sub-problem in closed form with respect to the phase shifts of the WIT. For the second sub-problem, we apply the Lagrange dual method and Karush-Kuhn-Tucker conditions to derive the optimal closed-form transmission time slots, power allocation, and phase shift of the WET, respectively. The optimal discrete phase shifts can be obtained by quantizing the continuous values. Numerical results demonstrate the effectiveness of the proposed policy and validate the beneficial role of the IRS in comparison to the benchmark schemes. [ABSTRACT FROM AUTHOR]

An edge-cancellation-aided iterative detection and decoding (EC-IDD) algorithm is proposed for polar-coded sparse code multiple access (SCMA), which jointly performs Gaussian-approximated message passing (GA-MP) detection of SCMA supported by the soft list decoding (SLD) of polar codes. A reduced-edge factor graph is formulated in each consecutive iteration with the aid of the cyclic redundancy check (CRC) and EC. Based on the simplified factor graph, the EC-IDD gradually reduces its complexity in each subsequent iteration, while improving the bit error rate (BER) performance, compared to the state-of-the-art joint detection and decoding (JDD) of polar-coded SCMA. Furthermore, an embedded decision-directed channel estimator (DD-CE) is proposed for our polar-coded SCMA system under realistic imperfect channel state information (CSI). Our simulation results demonstrate that the proposed EC-IDD achieves better BER performance than the state-of-the-art JDD under both perfect and imperfect CSI, despite achieving a complexity reduction of 92%. Finally, the BER of the proposed joint DD-CE and EC-IDD algorithm under imperfect CSI converges to that of EC-IDD operating under perfect CSI. [ABSTRACT FROM AUTHOR]

Polar coding has been ratified for employment in the 3GPP New Radio standard and several soft-decision decoders achieved comparable performance to that of the state-of-the-art successive cancellation list decoder. Aiming for further improving the performance of the soft-decision polar decoders, we propose a soft-output successive cancellation stack (SSCS) polar decoder, which jointly exploits the benefits of the depth-first search of the stack decoder and the soft information output of the belief propagation decoder. This has the substantial benefit of facilitating soft-input soft-output (SISO) decoding and seamless iterative information exchange in turbo-style receivers. As a further contribution, we intrinsically amalgamate our SSCS decoder into polar-coded large-scale multiple-input multiple-output (MIMO) systems and conceive an iterative turbo receiver, operating on the basis of logarithmic likelihood ratios (LLRs). Our simulation results show that the proposed SSCS decoder is capable of outperforming the state-of-the-art SISO polar decoders, despite requiring a lower complexity at moderate to high signal-to-noise ratios (SNRs). Additionally, compared with the non-iterative hard-output SCS decoder, our SSCS scheme attained 1.5 dB SNR gain at a bit error ratio level of 10−5, when decoding the [256,512] polar code of a (64 × 64) MIMO system. [ABSTRACT FROM AUTHOR]

For improving the throughput while simultaneously enhancing the security in aeronautical ad-hoc networking (AANET), a channel quality indicator (CQI)-mapped spatially modulated sparse code multiple access (SM-SCMA) scheme is proposed in this paper. On one hand, we exploit the joint benefits of spatial modulation and SCMA for boosting the data rate. On the other hand, a physical-layer secret key is generated by varying the SM-SCMA mapping patterns based on the instantaneous CQI in the desired link. This guarantees the security of AANETs, since this secret key is not exchanged between the source aeroplane and its destination. Due to the line-of-sight (LoS) propagation in the AANET, other aeroplanes or eavesdroppers may detect the signals delivered in the desired link. However, they are unable to translate the detected signals into the original confidential information, even if multiple copies of the signals are recoined over multiple hops of the AANET, because they have no knowledge of the CQI-based SM-SCMA mapping pattern. The performance of the CQI-mapped SM-SCMA is evaluated in terms of both its bit error rate and its ergodic secrecy rate, which substantiates that the proposed scheme secures the confidential information exchange in the multi-hop AANET. [ABSTRACT FROM AUTHOR]

Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) polar decoder for the first time, by exploiting the left-to-right propagation of the Belief Propagation (BP) decoder, which opens new avenues for its employment in powerful turbo-receivers. In the case of decoding a half-rate polar code having a block length of 1024 bits, the proposed soft list polar decoder achieves a 1.5 dB Block Error Ratio (BLER) performance gain, 50% latency improvement and 26% complexity reduction, compared to the state-of-the-art SO Soft Cancellation (SCAN) polar decoder in a polar-coded Multiple-Input Multiple-Output (MIMO) system. Furthermore, we conceive a Memory-Efficient (ME) soft list polar decoder, which requires only 16% of the soft list polar decoder's memory, at the cost of slightly increased latency and complexity. [ABSTRACT FROM AUTHOR]

This paper proposes a novel spatial-modulated multicarrier sparse code-division multiple access (SM/MC-SCDMA) system for achieving massive connectivity in device-centric wireless communications. In our SM/MC-SCDMA system, the advantages of both MC signalling and SM are amalgamated to conceive a low-complexity transceiver. Sparse frequency-domain spreading is utilized to mitigate the peak-to-average power ratio (PAPR) of MC signalling, as well as to facilitate low-complexity detection using the message passing algorithm. We then analyze the single-user bit error rate performance of SM/MC-SCDMA systems communicating over frequency-selective fading channels. Furthermore, the performance of SM/MC-SCDMA systems is evaluated based on both Monte-Carlo simulations and analytical results. We demonstrate that our low-complexity SM/MC-SCDMA transceivers are capable of achieving near-maximum likelihood (ML) performance even when the normalized user-load is as high as two, hence constituting a variable solution to support massive connectivity in device-centric wireless systems. [ABSTRACT FROM AUTHOR]

Index modulation (IM) is a recently proposed multi-carrier transmission scheme, which conveys information both by conventional symbols as well as by the specific subcarrier activation patterns conveying them. However, an impediment of IM is that it lacks transmit diversity gain. In this paper, we circumvent this limitation by proposing a limited-feedback assisted IM transmission scheme. Specifically, Euclidean distance based subcarrier subset selection (ED-SSS) is proposed and its attainable transmit diversity order is shown to be $N_c-N_{IM}+1$ , where $N_c$ is the total number of subcarriers in an IM block and $N_{IM}$ is the number of subcarriers used for IM. Furthermore, the ED-SSS is shown to be amenable to low-complexity implementation owing to the orthogonality of its subcarriers. In order to attain the maximum transmit diversity order of $N_c$ , ED-SSS is further extended with the aid of transmit precoding and its transmit diversity order is quantified. The proposed precoding assisted ED-SSS is shown to subsume several of the existing precoding aided IM transmission schemes. Simulation studies are conducted for validating our theoretical claims and also for quantifying the attainable performance gains of the proposed schemes. Specifically, at a BER of $10^{-3}$ an SNR gain as high as 8 dB is observed in case of precoding when compared to its counterpart operating without precoding. [ABSTRACT FROM AUTHOR]

A large-scale differential-detection aided generalized spatial modulation (GSM) system is proposed, which relies on a novel Gram–Schmidt basis set and an adaptive low-complexity detector, and is evidently suitable for high-mobility millimeter-wave (mmWave) channels. We consider nonstationary time-varying mmWave channels and assume that the beam-angles remain relatively fixed, while the channel coefficients vary rapidly. In this scenario, it is a challenging task to find the accurate estimates of channel coefficients for digital beamforming, which becomes an even more severe problem, as the numbers of subarrays and subcarriers increase. Our analog-beamforming-aided nonsquare differentially detected scheme achieves a higher transmission rate than the conventional coherent multiple-input multiple-output schemes because the pilot overhead and the complex-valued feedback are eliminated. Our simulation results following the IEEE 802.11ad specifications show that the performance of our proposed nonsquare differential GSM improved upon increasing the number of subarrays, where the maximum transmission rate of 16 b/s/Hz was considered. [ABSTRACT FROM AUTHOR]

In order to take the advantages of spatial modulation (SM) and support the multiple-access (MA) communications requiring high connectivity, we integrate the SM with DS-CDMA to propose a SM/DS-CDMA scheme, which is in favor of attaining both antenna diversity and frequency diversity. Associated with the SM/DS-CDMA scheme, a range of linear and nonlinear multiuser detectors (MUDs) are proposed and studied. Specifically, for linear MUDs, both minimum mean-square-error-aided joint spatial demodulation (MMSE-JSD) and MMSE-aided separate spatial demodulation (MMSE-SSD) are introduced. For nonlinear MUDs, we first present the joint maximum-likelihood MUD (JML-MUD) for demonstrating the potential of the SM-/DS-CDMA systems. Then, the MMSE-relied iterative interference cancellation (MMSE-IIC) is suggested, and the associated two types of low-complexity high-efficiency reliability measurement schemes are proposed. In this paper, we mathematically analyze both the single-user average bit error rate (ABER) of the SM/DS-CDMA systems employing joint spatial demodulation (JSD) and the approximate ABER of the SM/DS-CDMA systems employing the MMSE-JSD. We investigate and compare the ABER performance of the SM/DS-CDMA systems with various detection schemes and also with some legacy schemes. Our studies and performance results show that the SM/DS-CDMA systems in conjunction with appropriate MUD schemes are capable of providing a desirable tradeoff among the number of users supportable, implementation complexity, and the ABER performance. [ABSTRACT FROM AUTHOR]

In this paper, we propose an energy-efficient spatial modulation-based molecular communication (SM-MC) scheme, in which a transmitted symbol is composed of two parts, i.e., a space derived symbol and a concentration derived symbol. The space symbol is transmitted by embedding the information into the index of a single activated transmitter nanomachine. The concentration symbol is drawn according to the conventional concentration shift keying (CSK) constellation. Benefiting from a single active transmitter during each symbol period, SM-MC can avoid the inter-link interference problem existing in the current multiple-input multiple-output (MIMO) based MC schemes, which hence enables low-complexity symbol detection and performance improvement. Correspondingly, we propose a low-complexity scheme, which first detects the space symbol by energy comparison, and then detects the concentration symbol by the maximum ratio combining assisted CSK demodulation. In this paper, we analyze the symbol error rate (SER) of the SM-MC and of its special case, namely the space shift keying-based MC (SSK-MC), where only space symbol is transmitted and no CSK modulation is invoked. Finally, the analytical results are validated by computer simulations. Our studies demonstrate that both the SSK-MC and SM-MC are capable of achieving better SER performance than the conventional MIMO-MC and single-input single-output-based MC, when given the same symbol rate. [ABSTRACT FROM AUTHOR]

The existing literature on transmit antenna selection (TAS) aided spatial modulation (SM) systems extensively deals with the Euclidean distance (ED) based TAS owing to its high transmit diversity gain. In this paper, we consider the ED-TAS aided generalized spatial modulation (GSM) system that transmits multiple symbols in each channel use and characterize its attainable diversity gain. Second, we show that the minimum ED of the received constellation does not grow beyond a certain point when the size of the signal set is sufficiently large, which facilitates low-complexity implementations of the ED-TAS aided SM system. Our numerical studies revealed that a signal-to-noise gain of about 8 dB is achievable by employing ED-TAS in the GSM system compared to its counterpart dispensing with ED-TAS. [ABSTRACT FROM AUTHOR]

Simultaneous wireless information and power transfer (SWIPT) has gained significant popularity in the recent past owing to its applications in a wide range of use cases. Although SWIPT has been fairly well investigated in the literature, the existing work has mainly focused on attaining the optimal rate energy (RE) tradeoff assuming Gaussian input alphabet. However, practical systems operate with finite input alphabets such as quadratic-amplitude modulation (QAM)/phase-shift keying. We characterize the attainable RE tradeoff in SWIPT systems employing finite input alphabet for transmission over parallel Gaussian channels of say orthogonal frequency-division multiplexing subcarriers or multiple-input multiple-output streams. Some of the key results in the literature that assume Gaussian input alphabet are shown to be special cases of our results. Furthermore, we provide insights into our results with the aid of graphical illustrations, which throw light on the optimal power allocation policy for various energy-harvesting constraints. Furthermore, we consider practically relevant time-sharing and power-splitting schemes operating with finite input alphabet and characterize their RE tradeoff. Their optimal solutions in the asymptotic regime are obtained, which serve as low-complexity solutions suitable for practical implementation. Our simulation studies have demonstrated that the Gaussian input assumption significantly over-estimates the attainable RE tradeoff, especially when the signal set employed is small. Furthermore, it is observed through numerical simulations that the proposed optimal power allocation performs significantly better than the power allocation based on the Gaussian input assumption. Specifically, as much as 30% rate improvement is observed when employing the classic 4-QAM signal set. [ABSTRACT FROM AUTHOR]

Index modulation (IM) is an attractive concept for next generation communication systems. However, as an emerging technique, there are still some challenges need to be tackled in this frontier. In this paper, we consider two aspects of IM, which are diversity and detection complexity. Specifically, we propose a linear precoding assisted index modulation (LPIM) scheme for orthogonal frequency division multiplexing (OFDM) systems. We commence by analyzing the diversity and coding gains of the proposed scheme. Moreover, a detailed codebook design criterion is proposed. Then, our LPIM codebook is designed based on the maximum diversity and coding gain criteria. In contrast to the signaling model of the existing full diversity precoder designed for OFDM, we introduce a modeling method to link the zero-valued IM symbols to the origin of a Lattice for implementing our full diversity precoder designed for OFDM-IM. Both analytical and computer simulation results are provided for characterizing the attainable performance of OFDM-LPIM, demonstrating that it is capable of achieving full diversity as well as an attractive coding gain. However, the maximum-likelihood (ML) detection complexity of OFDM-LPIM is excessive, hence a low-complexity generalized iterative residual check detector (GIRCD) is proposed, which is inspired by the existing sparse recovery algorithms. Finally, computer simulation results are provided for demonstrating that GIRCD can provide a beneficial trade-off between bit error ratio performance and complexity. [ABSTRACT FROM AUTHOR]

Intrusion detection is one of the important applications of wireless sensor networks (WSNs). Prior research indicated that the barrier coverage method combined with mobile sensor networks (MSNs) can enhance the effectiveness of intrusion detection by mitigating coverage holes commonly appearing in stationary WSNs. However, the trajectories of moving sensors and moving intruders have not been investigated thoroughly, whereas the impact between two adjacent moving sensors and between a moving sensor and a moving intruder are still under-determined. In order to address these open problems, in this paper, we firstly discuss the virtual potential field between sensors as well as between sensors and intruders. We then propose to formulate the mobility pattern of sensor node using elastic collision model and that of intruder using point charge model. The point charge model describes an hitherto unexplored mobility pattern of empowered intruders, which are capable of acting upon the virtual repulsive forces from sensors in order to hide them away from being detected. With the aid of the two models developed, analytical expressions and simulation results demonstrate that our proposed design achieves a higher $k$ -barrier coverage probability in intrusion detection compared to that of the conventional designs. It is also worth mentioning that these improvements are achieved with shorter average displacement distance and under much more challenging MSNs settings. [ABSTRACT FROM AUTHOR]

In order to enhance the secrecy performance of the generalized space shift keying (GSSK) visible light communication (VLC) system, in this paper, an optical jamming-aided secrecy enhancement scheme is proposed, in which the source transmitter (S) simultaneously sends both the confidential desired signal and optical jamming signals under the amplitude and power constraints. The optical jamming signals obey the truncated Gaussian distribution for satisfying the constraints. Given the discrete set of channel inputs, the optical jamming-aided GSSK-VLC system’s secrecy performance is analyzed. Explicitly, the average mutual information (AMI), the lower bound of AMI and its closed-form approximation as well as the achievable secrecy rate are formulated analytically. Furthermore, the optimal power sharing strategy of the proposed GSSK-VLC systems relying on optical jamming is derived. Closed-form expressions are provided for the optimal power sharing in both the low- and high-SNR regions. Finally, the extensive simulation results are presented to validate our analytical results. [ABSTRACT FROM AUTHOR]

A delay of less than one millisecond is required by low-latency 5G wireless communication systems for supporting the “tactile” Internet. Hence, conventional initial synchronisation cannot be readily employed because of its potentially excessive delay. In this paper, an extrinsic information transfer (EXIT) chart assisted approach is used for the convergence analysis of $m$-sequences using recursive soft sequence estimation (RSSE) in the context of Nakagami-m fading channels. Explicitly, the novelty of our work is based on employing a new type of EXIT charts operating without using interleavers. This is a challenge, because the original EXIT charts rely on the employment of long, high-delay interleavers for ensuring that the inputs to the decoders become uncorrelated. We then evaluate the performance of various classes of $m$-sequences with the aid of the proposed EXIT charts and demonstrate that the $m$-sequences generated by the lower order polynomials maximize the mutual information more promptly with the aid of our RSSE scheme than those that belong to a higher order polynomial. [ABSTRACT FROM PUBLISHER]

Non-orthogonal multiple access (NOMA) is a promising technique for future mobile communication systems, which can approach multiuser channel capacity by sharing the same time-frequency resources with multiple users. In this article, we provide a unified framework for NOMA and review the principles of various NOMA schemes in different domains with the objective of creating a unified framework. A systematic performance comparison of different NOMA schemes regarding their peak-to-average power ratio, receiver complexity, latency, grant-free access, user load, and peak throughput is also provided for different application scenarios. Relying on our unified framework, we generalize the current understanding of the NOMA principle from the conventional code and power domains to the spatial domain as well as to their hybrids and to the networking domain. Finally, the challenges in terms of resource allocation, channel estimation, security, system flexibility, and implementation issues are also discussed. [ABSTRACT FROM PUBLISHER]