A novel power-domain non-orthogonal multiple access (NOMA) scheme with high-dimensional modulation is proposed. Signals for two users, each of which selected from a high-dimensional modulation constellation matrix, ar...
详细信息
A novel power-domain non-orthogonal multiple access (NOMA) scheme with high-dimensional modulation is proposed. Signals for two users, each of which selected from a high-dimensional modulation constellation matrix, are superimposed on the same time-frequency resource for transmissions. While inter-user interference is treated as noise at the receiver of the far user, successive interference cancellation is used at the receiver of the near user. By analyzing the upper bounds of the detection errors, the power allocation factor is derived, which depends only on the relative power gain of the two users, i.e., the ratio between the squared of the two channel gains, but not on the operating signal-to-noise ratio. This nice feature allows us to perform user pairing easily for a system with more than two users. The optimal user pairing strategy that minimizes the total power consumption is analytically derived. Simulation results show that our proposed design outperforms some benchmark scheme.
We propose a new coding scheme using only one lattice that achieves the 1/2 log(1 + SNR) capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, which is provable for signal-to-noise ratio ...
详细信息
We propose a new coding scheme using only one lattice that achieves the 1/2 log(1 + SNR) capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, which is provable for signal-to-noise ratio SNR > e at present. The scheme applies a discrete Gaussian distribution over an AWGN-good lattice, but otherwise does not require a shaping lattice or dither. Thus, it significantly simplifies the default lattice coding scheme of Erez and Zamir which involves a quantization-good lattice as well as an AWGN-good lattice. Using the flatness factor, we show that the error probability of the proposed scheme under minimum mean-square error lattice decoding is almost the same as that of Erez and Zamir, for any rate up to the AWGN channel capacity. We introduce the notion of good constellations, which carry almost the same mutual information as that of continuous Gaussian inputs. We also address the implementation of Gaussian shaping for the proposed lattice Gaussian coding scheme.
The capability of exploiting Orthogonal Space-Time Block Codes (OSTBC) for increasing physical layer security of wireless systems is studied. A technique named "hidden OSTBC" is introduced, in which, a pseud...
详细信息
The capability of exploiting Orthogonal Space-Time Block Codes (OSTBC) for increasing physical layer security of wireless systems is studied. A technique named "hidden OSTBC" is introduced, in which, a pseudorandom sequence is utilized by both transmitter and legitimate receiver to provide required security. Traditionally, employing pseudorandom sequences with methods such as spread spectrum or cooperative jamming involves huge amount of bandwidth or transmission power constraints, which are major challenges for wireless systems. Without requiring additional power or bandwidth, this study is designed to address exploitation of a pseudorandom antipodal sequence as a precoder. Elements of this sequence are multiplied to each antenna's transmitting symbol, and legitimate receiver employs the same sequence upon its combining rule. Mathematical analysis and simulations prove that an eavesdropper who does not know the pseudorandom sequence suffers from a degraded equivalent channel. Security enhancement is studied by investigating eavesdropper's higher error rate compared with that of legitimate receiver. Also, by employing lattice-based codebooks, a lower-bound is drawn for secrecy capacity, implying the achievability of nearly perfect secrecy regarding information theoretic analysis.
We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual i...
详细信息
We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which serves as a conservative strategy for general cases. Using the flatness factor for MIMO channels, we propose lattice codes universally achieving the secrecy capacity of compound MIMO wiretap channels up to a constant gap (measured in nats) that is equal to the number of transmit antennas. The proposed approach improves upon existing works on secrecy coding for MIMO wiretap channels from an error probability perspective, and establishes information theoretic security (in fact semantic security). We also give an algebraic construction to reduce the code design complexity, as well as the decoding complexity of the legitimate receiver. Thanks to the algebraic structures of number fields and division algebras, our code construction for compound MIMO wiretap channels can be reduced to that for Gaussian wiretap channels, up to some additional gap to secrecy capacity.
Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding, and cryptography. In this paper, the classic Metropolis-Hastings (MH) algorithm in Markov chain Monte Carlo meth...
详细信息
Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding, and cryptography. In this paper, the classic Metropolis-Hastings (MH) algorithm in Markov chain Monte Carlo methods is adopted for lattice Gaussian sampling. Two MH-based algorithms are proposed, which overcome the limitation of Klein's algorithm. The first one, referred to as the independent Metropolis-Hastings-Klein (MHK) algorithm, establishes a Markov chain via an independent proposal distribution. We show that the Markov chain arising from this independent MHK algorithm is uniformly ergodic, namely, it converges to the stationary distribution exponentially fast regardless of the initial state. Moreover, the rate of convergence is analyzed in terms of the theta series, leading to predictable mixing time. A symmetric Metropolis-Klein algorithm is also proposed, which is proven to be geometrically ergodic.
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem...
详细信息
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper's channel. We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance/minimum determinant of the lattice and its dual should be maximized simultaneously. Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case. The proposed lattice codes achieve strong secrecy and semantic security for all rates R < C-b - C-e - kappa, where C-b and C-e are Bob and Eve's channel capacities, respectively, and kappa is an explicit constant gap. Furthermore, these codes are almost universal in the sense that a fixed code is good for secrecy for a wide range of fading models. Finally, we consider a compound wiretap model with a more restricted uncertainty set, and show that rates R < (C) over bar (b) - (C) over bar (e) - kappa are achievable, where (C) over bar (b) is a lower bound for Bob's capacity and (C) over bar (e) is an upper bound for Eve's capacity for all the channels in the set.
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem...
详细信息
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper's channel. We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance/minimum determinant of the lattice and its dual should be maximized simultaneously. Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case. The proposed lattice codes achieve strong secrecy and semantic security for all rates R < C-b - C-e - kappa, where C-b and C-e are Bob and Eve's channel capacities, respectively, and kappa is an explicit constant gap. Furthermore, these codes are almost universal in the sense that a fixed code is good for secrecy for a wide range of fading models. Finally, we consider a compound wiretap model with a more restricted uncertainty set, and show that rates R < (C) over bar (b) - (C) over bar (e) - kappa are achievable, where (C) over bar (b) is a lower bound for Bob's capacity and (C) over bar (e) is an upper bound for Eve's capacity for all the channels in the set.
This paper considers lossy source coding of n-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion d no great...
详细信息
This paper considers lossy source coding of n-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion d no greater than epsilon, which is simpler than known dispersion-based approximations. Our approach takes inspiration in the celebrated classical result stating that the Shannon lower bound to rate-distortion function becomes tight in the limit d -> 0. We formulate an abstract version of the Shannon lower bound that recovers both the classical Shannon lower bound and the rate-distortion function itself as special cases. Likewise, we show that a nonasymptotic version of the abstract Shannon lower bound recovers all previously known nonasymptotic converses. A necessary and sufficient condition for the Shannon lower bound to be attained exactly is presented. It is demonstrated that whenever that condition is met, the rate-dispersion function is given simply by the varentropy of the source. Remarkably, all finite alphabet sources with balanced distortion measures satisfy that condition in the range of low distortions. Most continuous sources violate that condition. Still, we show that lattice quantizers closely approach the nonasymptotic Shannon lower bound, provided that the source density is smooth enough and the distortion is low. This implies that fine multidimensional lattice coverings are nearly optimal in the rate-distortion sense even at finite n. The achievability proof technique is based on a new bound on the output entropy of lattice quantizers in terms of the differential entropy of the source, the lattice cell size, and a smoothness parameter of the source density. The technique avoids both the usual random coding argument and the simplifying assumption of the presence of a dither signal.
We propose the novel concept of expanded constellation mapping (ECM) for maximising the received signal power, while cancelling the far-end-cross-talk in copper-based wireline communications. The goal of ECM is to ben...
详细信息
We propose the novel concept of expanded constellation mapping (ECM) for maximising the received signal power, while cancelling the far-end-cross-talk in copper-based wireline communications. The goal of ECM is to beneficially map the transmitted symbol vector to its expanded constellation set by carefully exploiting the copper channels' specific characteristics. To elaborate, ECM is comprised of the control entity and of the match entity, where the former determines how the ECM would be applied, while the latter searches for the best mapping of the transmitted symbol vector to the expanded constellation set. Our numerical results demonstrate that with the aid of the ECM, more than 25-dB power efficiency gain may be achieved over linear vectoring. Similarly, about 20-dB gain may be achieved over non-linear vectoring. From an implementation point of view, the ECM imposes minimal structural changes on ***, whilst exhibiting beneficial reconfigurability and compatibility.
This paper studies the extension of the multiway relay channel (introduced by Gunduz et al.) by adding intra-cluster links. In this model, multiple clusters of users communicate with the help of one relay and the user...
详细信息
This paper studies the extension of the multiway relay channel (introduced by Gunduz et al.) by adding intra-cluster links. In this model, multiple clusters of users communicate with the help of one relay and the users within a cluster wish to exchange messages among themselves. Restricted encoders are considered;thus, the encoded messages of each user depend only on its own message, not on previously decoded ones. Cut-set bounds and achievable rates are given for the Gaussian case with and without time-sharing between clusters. Depending on the protocol considered, schemes based on random coding or nested lattice coding are proposed. The schemes are compared in terms of exchange capacity, that is the equal rate point in the capacity region of a symmetric multiway relay channel. It is shown that the gap between the cut-set bound and Compress-and-Forward, as well as Amplify-and-Forward, is independent of the transmit power constraints when time-sharing is used.
暂无评论