The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a novel hybrid downlinkuplink cooperative NOMA (HDU-CNOMA) scheme to achieve a better tradeoff between spectral efficiency and signal reception reliability than the conventional cooperative NOMA schemes. In particular, the proposed scheme enables the strong user to perform a cooperative transmission and an interference-free uplink transmission simultaneously during the cooperative...
In this paper, we compare the resource allocation fairness of uplink communications between non-orthogonal multiple access (NOMA) schemes and orthogonal multiple access (OMA) schemes. Through characterizing the contribution of the individual user data rate to the system sum rate, we analyze the fundamental reasons that NOMA offers a more fair resource allocation than that of OMA in asymmetric channels...
We propose and design the lattice codes with finite lattice constellations based on multi-dimensional (more than two dimensions) lattice partitions. The codes are constructed from non-binary irregular repeat-accumulate (IRA) codes. Most notably, we propose a novel encoding structure to ensure that the decoder's messages exhibit permutation-invariance and symmetry properties. With these two properties,...
In this paper, we develop a low-complexity channel estimation for hybrid millimeter wave (mmWave) systems, where the number of radio frequency (RF) chains is much less than the number of antennas equipped at each transceiver. The proposed channel estimation algorithm aims to estimate the strongest angle-of-arrivals (AoAs) at both the base station (BS) and the users. Then all the users transmit orthogonal...
In this paper, we study the power-efficient resource allocation for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The resource allocation algorithm design is formulated as a non-convex optimization problem which takes into account the statistical channel state information at transmitter and quality of service (QoS) constraints. To strike a balance between system performance and computational...
We propose a method of constructing quantum LDPC codes from multiplicative groups of order $p-1$, where is a prime for some positive integer $n$. The proposed quantum LDPC codes of non-CSS structure are constructed from a pair of classical regular quasi-cyclic (QC) LDPC codes. We show that these classical regular QC-LDPC codes without cycles of length are orthogonal with respect to the symplectic...
We propose a novel location-aware pilot assignment scheme to mitigate pilot contamination in massive multiple-input multiple-output (MIMO) networks, where the channels are subjected to Rician fading. Our proposed scheme utilizes the location information of users as the input to conduct pilot assignment in the network. Based on the location information, we first determine the line of sight (LOS) interference...
We propose and design a lattice coded physical- layer network coding (PNC) over a finite complex number field Z[ω]/ξZ[ω] in a two-way relay channel (TWRC). In our design, we construct the lattice codes from an irregular repeat- accumulate (IRA) code over GF(q). A randomly generated coset is employed to our scheme to ensure that the codes exhibit permutation invariance and...
We propose a new low-density parity-check (LDPC) coded binary physical-layer network coding (PNC) scheme for Gaussian two-way relay channels. In this scheme, we introduce a bit mapper between the LDPC encoder and the modulator, which considers the unequal error protections brought by the high order PSK modulations. We add a new bipartite sub-channel graph consisting of sub-channels and variable nodes...
We propose a new linear physical-layer network coding and information combining scheme for the K-user fading multiple-access relay network (MARN), which consists of K users, one relay and one destination. The relay and the destination are connected via a rate-constraint backhaul link. In the proposed scheme, the K users transmit signals simultaneously. The relay and the destination receive the superimposed...
In this paper, we propose a new linear physical- layer network coding (NC) scheme for the fading Y- channel, assuming that the channel state information (CSI) is not available at transmitters. In this scheme, each user transmits one message to a relay and intends to obtain both other two users' messages. Based on the receiver- side CSI, the relay determines two NC generator vectors for linear network...
In this work, the importance of the channel mismatch effect in degrading the performance of deployed quantum LDPC codes has been pointed out. We help remedy this situation by proposing new quantum LDPC decoding strategies that can significantly reduce performance degradation by as much as 50%. Our new strategies for the quantum LDPC decoder are based on previous insights from classical LDPC decoders...
We investigate the construction of weakly-secure index codes for a sender to send messages to multiple receivers with side information in the presence of an eavesdropper. We derive a sufficient and necessary condition for the existence of index codes that are secure against an eavesdropper with access to any subset of messages of cardinality t, for any fixed t. In contrast to the benefits of using...
In this paper, we consider the design of the bit mapping in low-density parity-check (LDPC) coded bit-interleaved coded modulation (BICM) schemes. We introduce a two-layer bipartite graph to represent the LDPC coded BICM scheme where a new bit mapping graph linking sub-channels to variable nodes (VNs) is added to the conventional Tanner graph. We propose a progressive edge growth (PEG) algorithm to...
In this paper, we model and analyze the downlink (DL) wireless power transfer and uplink (UL) information transmission of K-tier heterogeneous cellular networks (HCNs). Due to the densely located BSs and universal frequency reuse between all tiers in HCNs, the typical mobile terminal (MT) is allowed to harvest energy from the serving BS by direct beamforming, as well as from the other interfering...
In this paper, we investigate uplink channel estimation and multiuser downlink transmission of a massive MIMO time-division duplex system in the presence of pilot contamination, where the base station (BS) with M antennas communicates with N single-antenna users in a cell. We assume that all channels are affected by Rician fading. We also assume that angles of arrival from users to the BS are different...
In this paper, we propose a novel detection algorithm for random multiple access, which combines slot based decoding and frame based decoding to recover users' messages. For the slot based decoding, we exploit a linear physical-layer network coding (LPNC) algorithm to decode the linear combinations of collided packets at each slot. By designing the coefficient matrix of linear combinations, we have...
In this paper we investigate the coded slotted ALOHA (CSA) schemes with repetition codes and maximum distance separable (MDS) codes over erasure channels. We derive the extrinsic information transfer (EXIT) functions of the CSA schemes over erasure channels, which allow an asymptotic analysis of the packet recovering process. Moreover, we define a traffic load threshold provided that the recovered...
We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and- forward relay in the presence of spatially random- distributed eavesdroppers. We assume that the source is equipped with multiple antennas, whereas the relay, the destination, and the eavesdroppers are equipped with a single antenna each. In the proposed scheme, in...
For the future machine-to-machine communications (M2M), efficient random multiple access protocols are required to accommodate a massive number of uncoordinated transmissions. It is known that packet contention is a critical issue for increasing the throughput in the uncoordinated transmissions. Thus, how to deal with packet contentions is the key for novel efficient multiple access schemes of future...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.