Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPrecoding-Based Network Alignment For Three Unicast Sessions
101
0
0.0
(
0
)
Added by
Chun Meng
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We consider the problem of network coding across three unicast sessions over a directed acyclic graph, where each sender and the receiver is connected to the network via a single edge of unit capacity. We consider a network model in which the middle of the network only performs random linear network coding, and restrict our approaches to precoding-based linear schemes, where the senders use precoding matrices to encode source symbols. We adapt a precoding-based interference alignment technique, originally developed for the wireless interference channel, to construct a precoding-based linear scheme, which we refer to as as a {em precoding-based network alignment scheme (PBNA)}. A primary difference between this setting and the wireless interference channel is that the network topology can introduce dependencies between elements of the transfer matrix, which we refer to as coupling relations, and can potentially affect the achievable rate of PBNA. We identify all possible such coupling relations, and interpret these coupling relations in terms of network topology and present polynomial-time algorithms to check the presence of these coupling relations. Finally, we show that, depending on the coupling relations present in the network, the optimal symmetric rate achieved by precoding-based linear scheme can take only three possible values, all of which can be achieved by PBNA.
rate research
Read More
In this paper, we investigate the energy-efficient hybrid precoding design for integrated multicast-unicast millimeter wave (mmWave) system, where the simultaneous wireless information and power transform is considered at receivers. We adopt two sparse radio frequency chain antenna structures at the base station (BS), i.e., fully-connected and subarray structures, and design the codebook-based analog precoding according to the different structures. Then, we formulate a joint digital multicast, unicast precoding and power splitting ratio optimization problem to maximize the energy efficiency of the system, while the maximum transmit power at the BS and minimum harvested energy at receivers are considered. Due to its difficulty to directly solve the formulated problem, we equivalently transform the fractional objective function into a subtractive form one and propose a two-loop iterative algorithm to solve it. For the outer loop, the classic Bi-section iterative algorithm is applied. For the inner loop, we transform the formulated problem into a convex one by successive convex approximation techniques and propose an iterative algorithm to solve it. Meanwhile, to reduce the complexity of the inner loop, we develop a zero forcing (ZF) technique-based low complexity iterative algorithm. Specifically, the ZF technique is applied to cancel the inter-unicast interference and the first order Taylor approximation is used for the convexification of the non-convex constraints in the original problem. Finally, simulation results are provided to compare the performance of the proposed algorithms under different schemes.
Large-scale antenna (LSA) has gained a lot of attention recently since it can significantly improve the performance of wireless systems. Similar to multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) or MIMO-OFDM, LSA can be also combined with OFDM to deal with frequency selectivity in wireless channels. However, such combination suffers from substantially increased complexity proportional to the number of antennas in LSA systems. For the conventional implementation of LSA-OFDM, the number of inverse fast Fourier transforms (IFFTs) increases with the antenna number since each antenna requires an IFFT for OFDM modulation. Furthermore, zero-forcing (ZF) precoding is required in LSA systems to support more users, and the required matrix inversion leads to a huge computational burden. In this paper, we propose a low-complexity recursive convolutional precoding to address the issues above. The traditional ZF precoding can be implemented through the recursive convolutional precoding in the time domain so that only one IFFT is required for each user and the matrix inversion can be also avoided. Simulation results show that the proposed approach can achieve the same performance as that of ZF but with much lower complexity.
In this paper, we investigate a hybrid multicast/ unicast scheme for a multiple-input single-output cache-aided non-orthogonal multiple access (NOMA) vehicular scenario in the face of rapidly fluctuating vehicular wireless channels. Considering a more practical situation, imperfect channel state information is taking into account. In this paper, we formulate an optimization problem to maximize the unicast sum rate under the constraints of the peak power, the peak backhaul, the minimum unicast rate, and the maximum multicast outage probability. To solve the formulated non-convex problem, a lower bound relaxation method is proposed, which enables a division of the original problem into two convex sub-problems. Computer simulations show that the proposed caching-aided NOMA is superior to the orthogonal multiple access counterpart.
This paper investigates the hybrid precoding design for millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems with finite-alphabet inputs. The mmWave MIMO system employs partially-connected hybrid precoding architecture with dynamic subarrays, where each radio frequency (RF) chain is connected to a dynamic subset of antennas. We consider the design of analog and digital precoders utilizing statistical and/or mixed channel state information (CSI), which involve solving an extremely difficult problem in theory: First, designing the optimal partition of antennas over RF chains is a combinatorial optimization problem, whose optimal solution requires an exhaustive search over all antenna partitioning solutions; Second, the average mutual information under mmWave MIMO channels lacks closed-form expression and involves prohibitive computational burden; Third, the hybrid precoding problem with given partition of antennas is nonconvex with respect to the analog and digital precoders. To address these issues, this study first presents a simple criterion and the corresponding low complexity algorithm to design the optimal partition of antennas using statistical CSI. Then it derives the lower bound and its approximation for the average mutual information, in which the computational complexity is greatly reduced compared to calculating the average mutual information directly. In addition, it also shows that the lower bound with a constant shift offers a very accurate approximation to the average mutual information. This paper further proposes utilizing the lower bound approximation as a low-complexity and accurate alternative for developing a manifold-based gradient ascent algorithm to find near optimal analog and digital precoders. Several numerical results are provided to show that our proposed algorithm outperforms existing hybrid precoding algorithms.
Multiple-input multiple-output (MIMO) techniques have recently demonstrated significant potentials in visible light communications (VLC), as they can overcome the modulation bandwidth limitation and provide substantial improvement in terms of spectral efficiency and link reliability. However, MIMO systems typically suffer from inter-channel interference, which causes severe degradation to the system performance. In this context, we propose a novel optical adaptive precoding (OAP) scheme for the downlink of MIMO VLC systems, which exploits the knowledge of transmitted symbols to enhance the effective signal-to-interference-plus-noise ratio. We also derive bit-error-rate expressions for the OAP under perfect and outdated channel state information (CSI). Our results demonstrate that the proposed scheme is more robust to both CSI error and channel correlation, compared to conventional channel inversion precoding.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
