Search

In this paper, we investigate the uplink transmission for user-centric cell-free massive multiple-input multiple-output (MIMO) systems. The largest-large-scale-fading-based access point (AP) selection method is adopted to achieve a user-centric operation. Under this user-centric framework, we propose a novel inter-cluster interference-based (IC-IB) pilot assignment scheme to alleviate pilot contamination. Considering the local characteristics of channel estimates and statistics, we propose a location-aided distributed uplink combining scheme to balance the relationship among the spectral efficiency (SE), user equipment (UE) fairness and complexity, in which local partial minimum mean-squared error (LP-MMSE) combining is adopted for some APs, while maximum-ratio (MR) combining is adopted for the remaining APs. A corresponding AP selection scheme based on a novel proposed metric representing inter-user interference is proposed. We also propose a new fairness coefficient taking SE performance into account to indicate the UE fairness. Moreover, the performance of the proposed scheme is investigated under fractional power control and max–min fairness (MMF) power control. Simulation results demonstrate that the channel estimation accuracy of our proposed IC-IB pilot assignment scheme outperforms that of the conventional pilot assignment schemes. It is also shown that compared with the benchmark LP-MMSE combining, the proposed location-aided combining trades 13.45 % average SE loss for 26.61 % UE fairness improvement and 28.58 % complexity reduction when γ = 0.6 . And by adjusting the threshold γ , a good trade-off between the average SE, UE fairness and computational complexity can be provided by the proposed scheme. Furthermore, the proposed scheme with fractional power control can better demonstrate the advantages of trade-off performance than MMF power control and full power transmission. [ABSTRACT FROM AUTHOR]

This paper presents three multiuser multiple input-multiple output (MU-MIMO) downlink transmission strategies based on the extended quadrature spatial modulation (EQSM) system for mobile communication. The three MU-MIMO precoding strategies utilised are block diagonalisation (BD), dirty paper coding (DPC), and a combined BD-DPC strategy. We analyse and compare the performance of these three MU-MIMO-EQSM schemes with the conventional MU-MIMO spatial multiplexing (MU-MIMO-SMux) system in terms of bit error rate (BER) and detection complexity considering correlated and uncorrelated fading channels. Results show that the BD-MIMO-EQSM and DPC-MIMO-EQSM systems outperform by 2−3 dB in BER performance their conventional counterparts with the additional advantage of a detection complexity reduction of up to 62% for the analysed cases. For the uncorrelated fading channel, the BD technique has better BER performance for a spectral efficiency (SE) of 12 bits per channel use (bpcu), while the DPC technique has better BER performance for an SE of 8 bpcu. Considering the correlated channel, DPC suffers a deep BER degradation of up to 30 dB compared with BD. However, still in this scenario, both proposed MU-MIMO-EQSM systems outperform their conventional counterparts. In terms of detection complexity, DPC has a complexity reduction of 77% as compared with the BD technique. The BD-DPC-MIMO-EQSM hybrid system heritages the low detection complexity of DPC with the advantage of all users in the system having the same BER performance. [ABSTRACT FROM AUTHOR]

We investigate individual secrecy performance in a K-user quasi-static Rayleigh fading homogeneous multiple access wiretap channel (MAC-WT), where a legitimate receiver employs successive interference cancellation (SIC) decoding. We first evaluate individual secrecy performance under an arbitrary SIC order by deriving closed-form expressions with respect to secrecy outage probability and effective secrecy throughput (EST) as main metrics. The resulting closed-form expressions disclose a significant impact on the secrecy performance from the order of SIC decoding. Therefore, we propose three SIC decoding order scheduling schemes: (1) round-robin scheme, absolutely fair and served as a benchmark; (2) suboptimal scheme, based on each user's main channel condition; and (3) optimal scheme, based on each user's achievable secrecy rate. Comparison results show that the last two schemes outperform the first one with regard to both the EST and the multi-user diversity gain, whereas the performance of the suboptimal scheme is highly close to that of the optimal scheme which is usually impractical due to a requirement for the eavesdropper's channel state information (CSI). [ABSTRACT FROM AUTHOR]

In this paper, we investigate the impact of hardware impairments on the outage performance and the instantaneous capacity of dual-hop decode-and-forward (DF) satellite relay networks in the presence of co-channel interference. Specifically, the exact closed-form expression for the outage probability and the analytical expression for the instantaneous capacity of the system are derived over a shadowed-Rician fading channel, which provides a fast means to evaluate the impact of hardware impairments on the system performance. Our results demonstrate that the outage floor occurs and the capacity upper bound appears when the hardware impairments exist. In addition, simulation results were provided to verify the correctness of the analytical results. [ABSTRACT FROM AUTHOR]

In this paper, we study a K-user fading multiple access channel (F-MAC), with and without an eavesdropper (Eve). In the system without Eve, we assume that each user knows only its own channel gain and is completely ignorant about the other users' channel state. The legitimate receiver sends a short acknowledgement message Acknowledge (ACK) if the message is correctly decoded and a No Acknowledge (NACK) if the message is not correctly decoded. Under these assumptions, we use game theoretic learning setup to make transmitters learn about the power allocation under each state. We use multiplicative weight no-regret algorithm to achieve an ε-coarse correlated equilibrium. We also consider the case where a user can receive other users' ACK/NACK messages. Now, we can maximize a weighted sum utility and achieve Pareto optimal points. We also obtain Nash bargaining solutions, which are Pareto points that are fairer to the transmitting users. Fairness among users is quantified using Jain's index. With Eve, we first assume each user knows only its own channel gain to the receiver as well as to Eve. The receiver decides whether to send an ACK or a NACK to the transmitting user based on the secrecy-rate condition. We use the above developed algorithms to get the equilibrium points. Next, we study the case where each user knows only the distribution of the channel state of Eve. Finally, we also consider the system where the users do not know even the distribution of the Eve's channel. [ABSTRACT FROM AUTHOR]

We investigate outage performance of fixed-gain and variable-gain amplify-and-forward (AF) full-duplex (FD) relaying systems under residual loop-interference (LI) in non-identical Nakagami- m fading channels. New exact outage probability expressions are derived analytically in a single-integral form by using the cumulative distribution function approach. Moreover, tight lower-bound and asymptotic outage probability expressions are derived in closed-form for the evaluated systems. It is shown that the fixed-gain AF-FD relaying outperforms the variable-gain AF-FD relaying when LI power and/or signal-to-noise ratio increase. The analytical results are verified by Monte-Carlo simulations. [ABSTRACT FROM AUTHOR]

In this paper, a method for approximating the probability distribution of sum of independent and identical Weibull random variables is adopted to analyze the performance of equal gain combiner (EGC) receiver over non-identical Weibull fading channel (WFC). Our main result is to derive a generalized expression of the probability density function (PDF) of the signal-to-noise ratio (SNR) at the EGC output in the case of non-identical WFC. Based on this PDF, accurate approximation of significant performance criteria, such as outage probability (OP), the amount of fading (AoF), and average symbol/bit error probability (ASEP/ABEP), are derived. In addition, we derived the analytical expressions for channel capacities under various adaptation policies such as optimal rate adaptation (ORA), optimal simultaneous power and rate adaptation (OPRA), channel inversion with fixed rate (CIFR), and truncated channel inversion with fixed rate (TCIFR). The proposed mathematical analysis is complemented by several numerical results and validated using Monte Carlo simulation method. [ABSTRACT FROM AUTHOR]

A vehicular ad hoc network (VANET) is a specific type of mobile ad hoc networks (MANETs); it can provide direct or multi-hop vehicle-to-vehicle (V2V), vehicle-to-roadside (V2R), vehicle-to-pedestrian (V2P), and vehicle-to-internet (V2I) communications based on the pre-existing road layouts. The emerging and promising VANET technologies have drawn tremendous attention from the government, academics, and industry over the past few years and have been increasingly available for a large number of cutting edge applications that can be classified into road safety, traffic efficiency, and infotainment categories. Due to the unique characteristics of VANETs, such as high mobility with an organized but constrained pattern, and diverse radio propagation conditions, the conventional researches dedicated for general MANETs cannot be directly applied to VANETs. This paper presents an analytical framework to investigate the minimum node degree of k-connected VANETs, with a homogeneous range assignment in highway scenarios. We simulate the mobility patterns with realistic vehicular traces, model the network topology as a two-path fading geometric random graph, and conduct extensive experiments on the derived analytical results. Through a combination of mathematical modeling and simulations, we derive a probabilistic bound for the minimum node degree of a homogeneous vehicular ad hoc network in highway scenarios. The analytical framework is useful in the study of connectivity and estimation of performance in one-dimensional vehicular ad hoc networks. [ABSTRACT FROM AUTHOR]

The work focuses on the max link selection (MLS) schemes of buffer-aided relaying over the independent and non-identically distributed (i.ni.d) Nakagami- m fading channels in terms of outage probability, average packet delay, and improved diversity-delay trade-off schemes. By modeling the transition of buffer states as a Markov chain, we first obtain the outage probability and average packet delays for MLS schemes, which are given with closed-form expressions. The achieved results show that the i.ni.d fading channels impose severe loss in the diversity and coding gains of MLS schemes. Especially, when the disparity among the channel powers is very large, the diversity order provided by the MLS schemes is less than the ones provided by the traditional best relay selection (T-BRS) and max-max link selection (MMLS) schemes even if the buffers' size is large enough. For the average packet delay of MLS schemes, our results show that they are impacted by the transmit power and the fading severity factors. In general, in the low transmit power, the average packet delays are varying with the transmit power. However, in the high transmit power, the average packet delays approach the stationary values. Besides of this, it is also achieved that the i.ni.d fading makes the average packet delays of MLS schemes at all relays are different. When the powers of relay-destination links are greater than the ones of source-relay links, the average packet delays can be reduced evidently. Motivated by the observations, a weight-based MLS (W-MLS) diversity-delay trade-off scheme is proposed. The proposed W-MLS diversity-delay trade-off schemes not only have the low packet delays at all relays but also provide enough diversity and coding gains over T-BRS and MMML, which can overcome the performance loss caused by non-identical distribution on MLS schemes. [ABSTRACT FROM AUTHOR]

This paper presents the mathematical model for symbol error probability of triangular quadrature amplitude modulation in a single-input multi-output environment. The symbol error probability performance is evaluated over fading channels namely Rayleigh, Nakagami-m, Nakagami-n, and Nakagami-q. The maximal-ratio combining technique is considered as spatial diversity algorithm and unified moment-generating-function-based approach is applied to derive the results. The multiple channels considered are independent but not necessarily identically distributed. The results presented are valid for slow and frequency non-selective fading channels only. The symbol error probability expressions obtained contain single integrals with finite limits and integrand composed of elementary functions which help us evaluate our analytical expressions numerically. We also compare these expressions with the error performances obtained through computer simulation, which show excellent agreement. In addition, an example has been simulated to validate our derived mathematical expressions. [ABSTRACT FROM AUTHOR]

The training-based channel estimation (TBCE) scheme in multiple-input multiple-output (MIMO) frequency-selective Rician fading channels is investigated. We propose the new technique of shifted scaled least squares (SSLS) and the minimum mean square error (MMSE) estimator that are suitable to estimate the above-mentioned channel model. Analytical results show that the proposed estimators achieve much better minimum possible Bayesian Cramér-Rao lower bounds (CRLBs) in the frequency-selective Rician MIMO channels compared with those of Rayleigh one. It is seen that the SSLS channel estimator requires less knowledge about the channel and/or has better performance than the conventional least squares (LS) and MMSE estimators. Simulation results confirm the superiority of the proposed channel estimators. Finally, to estimate the channel Rice factor, an algorithm is proposed, and its efficiency is verified using the result in the SSLS and MMSE channel estimators. [ABSTRACT FROM AUTHOR]

This paper proposes a new distributed space-time block code (DSTBC) over frequency-selective fading channels for two-hop amplify and forward relay networks, consisting of a source node (S), two relay nodes (R1 and R2), and a destination node (D). The proposed DSTBC is designed to achieve maximal spatial diversity gain and decoupling detection of data blocks with a low- complexity receiver. To achieve these two goals, S uses zero-sequence padding, and relay nodes precode the received signals with a proper precoding matrix. The pairwise error probability (PEP) analysis is provided to investigate the achievable diversity gain of the proposed DSTBC for a general channel model in which one hop is modeled by Rayleigh fading and the other by Rician fading. This mixed Rayleigh-Rician channel model allows us to analyze two typical scenarios where {Ri} are in the neighborhood of either S or D. [ABSTRACT FROM AUTHOR]

We investigate the performance of coded diversity systems employing generalized selection combining (GSC) over Nakagami fading channels. In particular, we derive a numerical evaluation method for the cutoff rate of the GSC systems. In addition, we derive a new union bound on the bit-error probability based on the code's transfer function. The proposed bound is general to any coding scheme with a known weight distribution such as convolutional and trellis codes. Results show that the new bound is tight to simulation results for wide ranges of diversity order, Nakagami fading parameter, and signal-to-noise ratio (SNR). [ABSTRACT FROM AUTHOR]

This paper deals with the design of blind mobile station (MS) receiver for time-hopping (TH) ultrawide-band (UWB) impulse radio (IR) system employing antipodal pulse amplitude modulation (PAM). In the presence of multipath fading channel, batch-mode minimum output energy (MOE) receiver, as well as a blind channel estimator, is first developed. To reduce the computational complexity, we propose two blind adaptive algorithms to determine the weight vector of the MS receiver. The rational of the algorithms premises on iteratively maximizing the minimum possible receiver's output energy. The first (indirect) approach is derived by first developing an adaptive blind channel estimator, then the updated channel impulse response (IR) is used to calculate the MS receiver's weight vector. Meanwhile the second (direct) method jointly and iteratively optimizes the weight vector and channel IR to improve system performance. Simulation results demonstrate convergence of both algorithms. Moreover, the algorithms are shown to be robust to multiuser interference (MUI) and near-far problems. [ABSTRACT FROM AUTHOR]

We investigate the performance of turbo interference cancellation receivers in the space time block coded (STBC) direct-sequence code division multiple access (DS-CDMA) system. Depending on the concatenation scheme used, we divide these receivers into the partitioned approach (PA) and the iterative approach (IA) receivers. The performance of both the PA and IA receivers is evaluated in Rayleigh fading channels for the uplink scenario. Numerical results show that the MMSE front-end turbo space-time iterative approach receiver (IA) effectively combats the mixture of MAI and intersymbol interference (ISI). To further investigate the possible achievable data rates in the turbo interference cancellation receivers, we introduce the puncturing of the turbo code through the use of rate compatible punctured turbo codes (RCPTCs). Simulation results suggest that combining interference cancellation, turbo decoding, STBC, and RCPTC can significantly improve the achievable data rates for a synchronous DS-CDMA system for the uplink in Rayleigh flat fading channels. [ABSTRACT FROM AUTHOR]

Link adaptation, in particular adaptive coded modulation (ACM), is a promising tool for bandwidth-efficient transmission in a fading environment. The main motivation behind employing ACM schemes is to improve the spectral efficiency of wireless communication systems. In this paper, using a finite number of capacity achieving component codes, we propose new transmission schemes employing constant power transmission, as well as discrete- and continuous-power adaptation, for slowly varying flat-fading channels. We show that the proposed transmission schemes can achieve throughputs close to the Shannon limits of flat-fading channels using only a small number of codes. Specifically, using a fully discrete scheme with just four codes, each associated with four power levels, we achieve a spectral efficiency within 1 dB of the continuous-rate continuous-power Shannon capacity. Furthermore, when restricted to a fixed number of codes, the introduction of power adaptation has significant gains with respect to average spectral efficiency and probability of no transmission compared to a constant power scheme. [ABSTRACT FROM AUTHOR]

The capacity of time-hopping pulse position modulation (PPM) and pulse amplitude modulation (PAM) for an ultra-wideband (UWB) communication system is investigated based on the multipath fading statistics of UWB indoor wireless channels. A frequency-selective fading channel is considered for both single-user and multiple-user UWB wireless systems. A Gaussian approximation based on the single-user results is used to derive the multiple access capacity. Capacity expressions are derived from a signal-to-noise-ratio (SNR) perspective for various fading environments. The capacity expressions are verified via Monte Carlo simulation. [ABSTRACT FROM AUTHOR]

Orthogonal frequency division multiplexing- (OFDM-) based amplify-and-forward (AF) cooperative communication is an effective way for single-antenna systems to exploit the spatial diversity gains in frequency-selective fading channels, but the receiver usually requires the knowledge of the channel state information to recover the transmitted signals. In this paper, a training-sequences-aided linear minimum mean square error (LMMSE) channel estimation method is proposed for OFDM-based cooperative diversity systems with multiple AF relays over frequency-selective fading channels. The mean square error (MSE) bound on the proposed method is derived and the optimal training scheme with respect to this bound is also given. By exploiting the optimal training scheme, an optimal low-rank LMMSE channel estimator is introduced to reduce the computational complexity of the proposed method via singular value decomposition. Furthermore, the Chu sequence is employed as the training sequence to implement the optimal training scheme with easy realization at the source terminal and reduced computational complexity at the relay terminals. The performance of the proposed low-complexity channel estimation method and the superiority of the derived optimal training scheme are verified through simulation results. [ABSTRACT FROM AUTHOR]

The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM) and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks. [ABSTRACT FROM AUTHOR]

We consider the effect of imperfect carrier offset compensation on the performance of space-time block codes. The symbol error rate (SER) for orthogonal space-time block code (OSTBC) is derived here by taking into account the carrier offset and the resulting imperfect channel state information (CSI) in Rayleigh flat fading MIMO wireless channels with offsets. [ABSTRACT FROM AUTHOR]

Novel channel equalizer algorithms are introduced for wireless communication systems to combat channel distortions resulting from multipath propagation. The novel algorithms are based on newly derived bounds on the probability of error (PE) and guarantee better performance than the traditional zero forcing (ZF) or minimum mean square error (MMSE) algorithms. The new equalization methods require channel state information which is obtained by a fast adaptive channel identification algorithm. As a result, the combined convergence time needed for channel identification and PE minimization still remains smaller than the convergence time of traditional adaptive algorithms, yielding real-time equalization. The performance of the new algorithms is tested by extensive simulations on standard mobile channels. [ABSTRACT FROM AUTHOR]

We analyze the exact average symbol error probability (SEP) of binary and M-ary signals with spatial diversity in Nakagami-q (Hoyt) fading channels. The maximal-ratio combining and orthogonal space-time block coding are considered as diversity techniques for single-input multiple-output and multiple-input multiple-output systems, respectively. We obtain the average SEP in terms of the Lauricella multivariate hypergeometric function FD(n). The analysis is verified by comparing with Monte Carlo simulations and we further show that our general SEP expressions particularize to the previously known results for Rayleigh (q = 1) and single-input single-output (SISO) Nakagami-q cases. [ABSTRACT FROM AUTHOR]

Existing channel aware signal processing design for decentralized detection in wireless sensor networks typically assumes the clairvoyant case, that is, global channel state information (CSI) is known at the design stage. In this paper, we consider the distributed detection problem where only the channel fading statistics, instead of the instantaneous CSI, are available to the designer. We investigate the design of local decision rules for the following two cases: (1) fusion center has access to the instantaneous CSI; (2) fusion center does not have access to the instantaneous CSI. As expected, in both cases, the optimal local decision rules that minimize the error probability at the fusion center amount to a likelihood ratio test (LRT). Numerical analysis reveals that the detection performance appears to be more sensitive to the knowledge of CSI at the fusion center. The proposed design framework that utilizes only partial channel knowledge will enable distributed design of a decentralized detection wireless sensor system. [ABSTRACT FROM AUTHOR]

We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies. [ABSTRACT FROM AUTHOR]

M-ary on-off frequency-shift keying (OOFSK) is a digital modulation format in which M-ary FSK signaling is overlaid on on/off keying. This paper investigates the potential of this modulation format in the context of wideband fading channels. First, it is assumed that the receiver uses energy detection for the reception of OOFSK signals. Capacity expressions are obtained for the cases in which the receiver has perfect and imperfect fading side information. Power efficiency is investigated when the transmitter is subject to a peak-to-average power ratio (PAR) limitation or a peak power limitation. It is shown that under a PAR limitation, it is extremely power inefficient to operate in the very-low-SNR regime. On the other hand, if there is only a peak power limitation, it is demonstrated that power efficiency improves as one operates with smaller SNR and vanishing duty factor. Also studied are the capacity improvements that accrue when the receiver can track phase shifts in the channel or if the received signal has a specular component. To take advantage of those features, the phase of the modulation is also allowed to carry information. [ABSTRACT FROM AUTHOR]

A differential detection scheme for space-time spreading with two transmit antennas is proposed. The scheme does not require channel state information at either the transmitter or the receiver. With segmentation and preamble symbols padded at the transmitter, the receiver recovers the information using differential detection. Both phase-shift keying (PSK) and quadrature amplitude modulation (QAM) signals are considered. The proposed scheme achieves two-level transmit diversity gain with low complexity and saves the use of channel estimation, while having about 3 dB performance loss as compared to the coherent detection scheme. When multiple receive antennas exist, additional receive diversity gain can be achieved along with the transmit diversity gain. The scheme works fine under block-fading channel as well as slow Rayleigh fading channel, which is a popular scenario for high-rate data communications. The system performance for different segment sizes, channel fading speeds, modulation methods, and numbers of receive antennas is studied through simulations. [ABSTRACT FROM AUTHOR]

This paper investigates the impact of diversity reception techniques on the performance of Bluetooth (BT) packet transmission in wireless channels with fast fading and shadowing to improve the coverage extension. We firstly derive a tight parametric exponential approximation for the instantaneous bit error probability (BEP) in additive white Gaussian noise with parameters dependent on GFSK modulation format according to the BT standard. Then, from this expression, we derive the mean block error probability (BLEP) for DH packets transmission in Rayleigh fading channel by adopting different diversity reception techniques, such as selection diversity (SD) and maximal ratio combining (MRC). In particular, the joint impact of the diversity order, the combining techniques and the block length on the BLEP, is shown. For both MRC and SD schemes, we also obtain a tight and invertible bound on the BLEP, that enables us to analytically evaluate the quality of service expressed in terms of outage probability in channel affected by fading and shadowing and, as a consequence, the impact of multiple antennas on the system coverage. [ABSTRACT FROM AUTHOR]

A serious disadvantage of orthogonal frequency-division multiplexing (OFDM) is its sensitivity to carrier frequency offset (CFO) and timing offset (TO). For many low-complexity algorithms, the estimation ambiguity exists when the CFO is greater than one or two subcarrier spacing, and the estimated TO is also prone to exceeding the ISI-free interval within the cyclic prefix (CP). This paper presents a method for joint CFO ambiguity resolution and accurate TO estimation in multipath fading. Maximum-likelihood (ML) principle is employed and only one pilot symbol is needed. Frequency ambiguity is resolved and accurate TO can be obtained simultaneously by using the fast Fourier transform (FFT) and one-dimensional (1D) search. Both known and unknown channel order cases are considered. Computer simulations show that the proposed algorithm outperforms some others in the multipath fading channels. [ABSTRACT FROM AUTHOR]

A blind nonlinear interference cancellation receiver for code-division multiple-access- (CDMA-) based communication systems operating over Rayleigh flat-fading channels is proposed. The receiver which assumes knowledge of the signature waveforms of all the users is implemented in an asynchronous CDMA environment. Unlike the conventional MMSE receiver, the proposed blind ICA multiuser detector is shown to be robust without training sequences and with only knowledge of the signature waveforms. It has achieved nearly the same performance of the conventional training-based MMSE receiver. Several comparisons and experiments are performed based on examining BER performance in AWGN and Rayleigh fading in order to verify the validity of the proposed blind ICA multiuser detector. [ABSTRACT FROM AUTHOR]

Correlated sources passing through broadcast channels is considered in this paper. Each receiver has access to correlated source side information and each source at the sender is kept secret from the unintended receiver. This communication model can be seen as generalizations of Tuncel's source over broadcast channel and Villard et al.'s source over wiretap channel. An outer bound for secure transmission region of arbitrarily correlated sources with the equivocation-rate levels is derived with ultra-low latency and used to prove capacity results for several classes of sources and channels. [ABSTRACT FROM AUTHOR]

This paper analyzes the outage probability (OP) and the average symbol error rate (SER) of decode-and-forward (DF) relaying. The paper derives closed-form expressions for the OP and the average SER with optimum combining (OC) considering fast-fading multiple correlated CCIs, the correlated source-relay, and thermal noise. It is shown that the performance of the large distance between the source and the relay is better than that of the small distance, regardless of interference fading speed at the destination. We also show that given the source-relay distance, the performance of slow-fading interference is basically better than that of fast fading, except in the low signal-to-noise-ratio (SNR) regime for the distance being small. In result, the source-relay distance is generally a more dominating factor for the performance than fading CCIs. [ABSTRACT FROM AUTHOR]

In this paper, estimators of the Nakagami-lognormal (NL) distribution based on the method of log-moments have been derived and thoroughly analyzed. Unlike maximum likelihood (ML) estimators, the log-moment estimators of the NL distribution are obtained using straightforward equations with a unique solution. Also, their performance has been evaluated using the sample mean, confidence regions and normalized mean square error (NMSE). The NL distribution has been extensively used to model composite small-scale fading and shadowing in wireless communication channels. This distribution is of interest in scenarios where the small-scale fading and the shadowing processes cannot be easily separated such as the vehicular environment. [ABSTRACT FROM AUTHOR]

This paper investigates the outage probability and rate performance of multi-hop full duplex (FD) and half duplex (HD) decode-and-forward (DF)-based relay networks. First of all, we derive new closed form equation for the end-to-end outage probability of multi-hop FDR system taking into account the inter-relay interference (IRI), i.e., interference caused by simultaneous transmissions by the nodes in non-orthogonal frequency bands, and the residual self-interference (RSI) present at the full duplex relay (FDR) nodes, in independent non-identical Nakagami-m fading channels. We also derive an approximate expression for the outage probability which is found to be highly accurate. Further, we provide an asymptotic expression as well, for Rayleigh fading channels. Furthermore, we derive exact and approximate expression for the outage probability of multi-hop spectral efficient HDR network that employ two-phase relaying. We then consider optimal power allocation (OPA) for multi-hop FDR and HDR networks that maximizes the end-to-end transmission rate with individual peak power constraint at the nodes. Since the optimization problem is non-convex, we develop an efficient, low-complex and fast-converging iterative algorithm for power allocation based on sequential convex programming. Secondly, we consider OPA for multi-hop FDR and HDR networks that minimizes the end-to-end outage probability with individual peak power constraints at the nodes. We devise geometric programming (GP) to obtain the OPA vector. The results demonstrate that OPA can significantly improve the outage and end-to-end rate performance of both FDR and HDR networks as compared to uniform power allocation policy. The results from the analytical model are validated by extensive Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

A comprehensive framework for design of hexagonal cellular network system in terms of spatial spectral and energy efficiencies is presented. The communication environment in the system is assumed to be Nakagami-m fading coupled with simplified path loss model and co-channel interference. Three base station antenna configurations namely, omni, 120° and 60° are considered. Closed-form expressions for spatial spectral and energy efficiencies and coverage probability are derived and illustrated as a function of signal-to-noise ratio, cell radius, reuse distance, path loss exponent factor, and fading figure. A discussion of trade-offs among spatial spectral efficiency, spatial energy efficiency, and coverage probability as a function of parameters of cellular system and propagation environment is also provided. Numerical results show that the use of sectorized antenna system in the cellular network provides significant improvements even under severe propagation and interference conditions. For example, it is observed that the 120° base station antenna configuration system provides nearly double the spatial energy efficiency relative to the omni configuration system. [ABSTRACT FROM AUTHOR]

In the original publication [1] were several parts incorrect. The corrected versions can be found below. The original article has been updated to rectify these errors. [ABSTRACT FROM AUTHOR]