Global ETD Search

1	Optimization of Modulation Constrained Digital Transmission Systems Han, Yu January 2018 (has links) The regular waterfilling(WF) policy maximizes the mutual information of parallel channels, when the inputs are Gaussian. However, Gaussian input is ideal, which does not exist in reality. Discrete constellations are usually used instead, such as $ M $-PAM and $ M $-QAM. As a result, the mercury/waterfilling (MWF) policy is introduced, which is a generalization of the regular WF. The MWF applies to inputs with arbitrary distributions, while the regular WF only applies to Gaussian inputs. The MWF-based optimal power allocation (OPA) is presented, for which an algorithm called the internal/external bisection method is introduced. The constellation-constrained capacity is discussed in the thesis, where explicit expressions are presented. The expression contains an integral, which does not have a closed-form solution. However, it can be evaluated via the Monte Carlo method. An approximation of the constellation-constrained capacity based on the sphere packing method is introduced, whose OPA is a convex optimization problem. The CVX was used initially, but it did not generate satisfactory results. Therefore, the bisection method is used instead. Capacities of the MWF and its sphere packing approximation are evaluated for various cases, and compared with each other. It turns out the sphere packing approximation has similar performances to the MWF, which validates the approximation. Unlike the MWF, the sphere packing approximation does not suffer from the loss of precision due to the structure of MMSE functions, which demonstrates its robustness. The mercury/waterfilling Modulation Optimal power allocation
2	Fundamental Limits of Poisson Channels in Visible Light Communications Ain-Ul-Aisha, FNU 18 April 2017 (has links) Visible Light Communications (VLC) has recently emerged as a viable solution for solving the spectrum shortage problem. The idea is to use artificial light sources as medium to communicate with portable devices. In particular, the light sources can be switched on and off with a very high-frequency corresponding to 1s and 0s of digital communication. The high-frequency on-off switching can be detected by electronic devices but not the human eyes, and hence will not affect the light sources' illumination functions. In VLC, if a receiver is equipped with photodiodes that count the number of arriving photons, the channels can be modeled as Poisson channels. Unlike Gaussian channels that are suitable for radio spectrum and have been intensively investigated, Poisson channels are more challenging and are not that well understood. The goal of this thesis is to characterize the fundamental limits of various Poisson channels that models different scenarios in VLC. We first focus on single user Poisson fading channels with time-varying background lights. Our model is motivated by indoor optical wireless communication systems, in which the noise level is affected by the strength of the background light. We study both the single-input single-output (SISO) and the multiple-input and multiple-output (MIMO) channels. For each channel, we consider scenarios with and without delay constraints. For the case without a delay constraint, we characterize the optimal power allocation scheme that maximizes the ergodic capacity. For the case with a strict delay constraint, we characterize the optimal power allocation scheme that minimizes the outage probability. We then extend the study to the multi-user Poisson channels and analyze the sum-rate capacity of two-user Poisson multiple access channels (MAC). We first characterize the sum-rate capacity of the non-symmetric Poisson MAC when each transmitter has a single antenna. We show that, for certain channel parameters, it is optimal for a single-user to transmit to achieve the sum-rate capacity. This is in sharp contrast to the Gaussian MAC, in which both users must transmit, either simultaneously or at different times, in order to achieve the sum-rate capacity. We then characterize the sum-rate capacity of the Poisson MAC with multiple antennas at each transmitter. By converting a non-convex optimization problem with a large number of variables into a non-convex optimization problem with two variables, we show that the sum-rate capacity of the Poisson MAC with multiple transmit antennas is equivalent to a properly constructed Poisson MAC with a single antenna at each transmitter. We further analyze the sum-rate capacity of two-user Poisson MIMO multiple-access channels (MAC), when both the transmitters and the receiver are equipped with multiple antennas. We first characterize the sum-rate capacity of the Poisson MAC when each transmitter has a single antenna and the receiver has multiple antennas. We show that similar to Poisson MISO-MAC channels, for certain channel parameters, it is optimal for a single user to transmit to achieve the sum-rate capacity, and for certain channel parameters, it is optimal for both users to transmit. We then characterize the sum-rate capacity of the channel where both the transmitters and the receiver are equipped with multiple antennas. We show that the sum-rate capacity of the Poisson MAC with multiple transmit antennas is equivalent to a properly constructed Poisson MAC with a single antenna at each transmitter. Poisson channels ergodic capacity outage probability multi-access channels optimal power allocation sum-rate capacity
3	Investigation on Maximal Network Lifetime Using Optimal Power Allocation and Relay Selection Scheme in Multi-hop Wireless Networks Liong, Jian-Wah 07 September 2011 (has links) In the wireless sensor network environment (WSN), the system transmits signals often need to rely on the stability and reliability of the relay node of each path of cooperation with each other to achieve balance between leisure and stability. In general, relay adopted Amplify-and-Forward (AF) and Decode-and-Forward (DF) to relaying the signal to destination. Unfortunately, in reality, the relay node itself had a problem of limited energy supplies, would make the overall performance degrade before reaching the optimal performance. Therefore, we propose two novel relay selection schemes and through the multi-hop transmission with cooperation. We also derived the optimal power allocation algorithms for all relay nodes. Finally, simulation results show that our proposed scheme obtained the better lifetime and performance where compared with the traditional schemes in a fair environment. Amplify-and-Forward Decode-and-Forward relay selection multi-hop lifetime optimal power allocation
4	On Design and Analysis of Energy Efficient Wireless Networks with QoS Vankayala, Satya Kumar January 2017 (has links) (PDF) We consider optimal power allocation policies for a single server, multiuser wireless communication system. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity. We also provide closed-form optimal power policies when there is a hard deadline delay constraint. Later on, we also extend single hop results to multihop networks. First we consider the case, when the transmission rate is a linear function of power. We provide low complexity algorithms for joint routing, scheduling and power control which ensure stability of the queues, certain minimum rates, end-to-end hard deadlines, and/or upper bounds on the end-to-end mean delays. Further we extend these results to the multihop networks where the power is a general monotonically increasing function of rate. For our algorithms, we also provide rates of convergence to the stationary distributions for the queue length process and also approximate end-to-end mean delays. Finally, we provide computationally efficient algorithms that minimize the total power when there is a end-to-end hard deadline delay constraint. Wireless Network Energy Efficient Wireless Network Network Layer Model MAC Layer Model Physical Layer Model Multiaccess Wireless Network Optimal Power Policies QoS Wireless Multihop Networks Optimal Power Allocation Policies Multihop Wireless Networks Wireless Communication Systems Electrical Communication Engineering
5	Performance evaluation and protocol design of fixed-rate and rateless coded relaying networks Nikjah, Reza 06 1900 (has links) The importance of cooperative relaying communication in substituting for, or complementing, multiantenna systems is described, and a brief literature review is presented. Amplify-and-forward (AF) and decode-and-forward (DF) relaying are investigated and compared for a dual-hop relay channel. The optimal strategy, source and relay optimal power allocation, and maximum cooperative gain are determined for the relay channel. It is shown that while DF relaying is preferable to AF relaying for strong source-relay links, AF relaying leads to more gain for strong source-destination or relay-destination links. Superimposed and selection AF relaying are investigated for multirelay, dual-hop relaying. Selection AF relaying is shown to be globally strictly outage suboptimal. A necessary condition for the selection AF outage optimality, and an upper bound on the probability of this optimality are obtained. A near-optimal power allocation scheme is derived for superimposed AF relaying. The maximum instantaneous rates, outage probabilities, and average capacities of multirelay, dual-hop relaying schemes are obtained for superimposed, selection, and orthogonal DF relaying, each with parallel channel cooperation (PCC) or repetition-based cooperation (RC). It is observed that the PCC over RC gain can be as much as 4 dB for the outage probabilities and 8.5 dB for the average capacities. Increasing the number of relays deteriorates the capacity performance of orthogonal relaying, but improves the performances of the other schemes. The application of rateless codes to DF relaying networks is studied by investigating three single-relay protocols, one of which is new, and three novel, low complexity multirelay protocols for dual-hop networks. The maximum rate and minimum energy per bit and per symbol are derived for the single-relay protocols under a peak power and an average power constraint. The long-term average rate and energy per bit, and relay-to-source usage ratio (RSUR), a new performance measure, are evaluated for the single-relay and multirelay protocols. The new single-relay protocol is the most energy efficient single-relay scheme in most cases. All the multirelay protocols exhibit near-optimal rate performances, but are vastly different in the RSUR. Several future research directions for fixed-rate and rateless coded cooperative systems, and frameworks for comparing these systems, are suggested. / Communications acknowledgment signals amplify-and-forward relaying average capacity average power constraint bit error rate cooperative gain cooperative communication decode-and-forward relaying degree of freedom direct transmission distributed space-time coding dual-hop relaying energy efficiency energy per bit energy per symbol feedback communication fixed-rate coded relaying fixed-rate codes fixed-rate coding large SNR approximation maximal ratio combining maximum achievable rates maximum likelihood multiple access channels mutual information nonconcave fractional programming numerical optimization optimal power allocation orthogonal relaying outage optimality outage probability parallel channel coding peak power constraint power allocation schemes power fairness protocol design rateless coded relaying rateless codes rate efficiency rateless coding Rayleigh fading relay-to-source usage ratio relaying networks repetition coding selection relaying single-hop communication superimposed relaying symbol error rate
6	Performance evaluation and protocol design of fixed-rate and rateless coded relaying networks Nikjah, Reza Unknown Date No description available. acknowledgment signals amplify-and-forward relaying average capacity average power constraint bit error rate cooperative gain cooperative communication decode-and-forward relaying degree of freedom direct transmission distributed space-time coding dual-hop relaying energy efficiency energy per bit energy per symbol feedback communication fixed-rate coded relaying fixed-rate codes fixed-rate coding large SNR approximation maximal ratio combining maximum achievable rates maximum likelihood multiple access channels mutual information nonconcave fractional programming numerical optimization optimal power allocation orthogonal relaying outage optimality outage probability parallel channel coding peak power constraint power allocation schemes power fairness protocol design rateless coded relaying rateless codes rate efficiency rateless coding Rayleigh fading relay-to-source usage ratio relaying networks repetition coding selection relaying single-hop communication superimposed relaying symbol error rate

1

Page generated in 0.1219 seconds