Diversity-Rate Trade-off for Fading Channels with Power Control

We consider a complex, additive, white Gaussian noise channel with flat fading. We study its diversity order vs transmission rate for some known power allocation schemes. The capacity region is divided into three regions. For one power allocation scheme, the diversity order is exponential throughout the capacity region. For selective channel inversion (SCI) scheme, the diversity order is exponential in low and high rate region but polynomial in mid rate region. For fast fading case we also provide a new upper bound on block error probability and a power allocation scheme that minimizes it. The diversity order behaviour of this scheme is same as for SCI but provides lower BER than the other policies.

Accurate performance analysis of single and opportunistic AF relay cooperation with imperfect cascaded channel estimates

Given the significant gains that relay-based cooperation promises, the practical problems of acquisition of channel state information (CSI) and the characterization and optimization of performance with imperfect CSI are receiving increasing attention. We develop novel and accurate expressions for the symbol error probability (SEP) for fixed-gain amplify-and-forward relaying when the destination acquires CSI using the time-efficient cascaded channel estimation (CCE) protocol. The CCE protocol saves time by making the destination directly estimate the product of the source-relay and relay-destination channel gains. For a single relay system, we first develop a novel SEP expression and a tight SEP upper bound. We then similarly analyze an opportunistic multi-relay system, in which both selection and coherent demodulation use imperfect estimates. A distinctive aspect of our approach is the use of as few simplifying approximations as possible, which results in new results that are accurate at signal-to-noise-ratios as low as 1 dB for single and multi-relay systems. Using insights gleaned from an asymptotic analysis, we also present a simple, closed-form, nearly-optimal solution for allocation of energy between pilot and data symbols at the source and relay(s).

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Power-Controlled Reverse Channel Training in a Multiuser TDD-MIMO Spatial Multiplexing System With CSIR

This paper considers the design of a power-controlled reverse channel training (RCT) scheme for spatial multiplexing (SM)-based data transmission along the dominant modes of the channel in a time-division duplex (TDD) multiple-input and multiple-output (MIMO) system, when channel knowledge is available at the receiver. A channel-dependent power-controlled RCT scheme is proposed, using which the transmitter estimates the beamforming (BF) vectors required for the forward-link SM data transmission. Tight approximate expressions for 1) the mean square error (MSE) in the estimate of the BF vectors, and 2) a capacity lower bound (CLB) for an SM system, are derived and used to optimize the parameters of the training sequence. Moreover, an extension of the channel-dependent training scheme and the data rate analysis to a multiuser scenario with M user terminals is presented. For the single-mode BF system, a closed-form expression for an upper bound on the average sum data rate is derived, which is shown to scale as ((L-c - L-B,L- tau)/L-c) log logM asymptotically in M, where L-c and L-B,L- tau are the channel coherence time and training duration, respectively. The significant performance gain offered by the proposed training sequence over the conventional constant-power orthogonal RCT sequence is demonstrated using Monte Carlo simulations.

Optimal Joint Antenna Selection and Power Adaptation in Underlay Cognitive Radios

Transmit antenna selection (AS) is a popular, low hardware complexity technique that improves the performance of an underlay cognitive radio system, in which a secondary transmitter can transmit when the primary is on but under tight constraints on the interference it causes to the primary. The underlay interference constraint fundamentally changes the criterion used to select the antenna because the channel gains to the secondary and primary receivers must be both taken into account. We develop a novel and optimal joint AS and transmit power adaptation policy that minimizes a Chernoff upper bound on the symbol error probability (SEP) at the secondary receiver subject to an average transmit power constraint and an average primary interference constraint. Explicit expressions for the optimal antenna and power are provided in terms of the channel gains to the primary and secondary receivers. The SEP of the optimal policy is at least an order of magnitude lower than that achieved by several ad hoc selection rules proposed in the literature and even the optimal antenna selection rule for the case where the transmit power is either zero or a fixed value.

Vertical uplift resistance of two closely spaced horizontal strip anchors embedded in cohesive-frictional weightless medium

The vertical uplift resistance of two closely spaced horizontal strip plate anchors has been investigated by using lower and upper bound theorems of the limit analysis in combination with finite elements and linear optimization. The interference effect on uplift resistance of the two anchors is evaluated in terms of a nondimensional efficiency factor (eta(c)). The variation of eta(c) with changes in the clear spacing (S) between the two anchors has been established for different combinations of embedment ratio (H/B) and angle of internal friction of the soil (phi). An interference of the anchors leads to a continuous reduction in uplift resistance with a decrease in spacing between the anchors. The uplift resistance becomes a minimum when the two anchors are placed next to each other without any gap. The critical spacing (S-cr) between the two anchors required to eliminate the interference effect increases with an increase in the values of both H/B and phi. The value of S-cr was found to lie approximately in the range 0.65B-1.5B with H/B = 1 and 11B-14B with H/B = 7 for phi varying from 0 degrees to 30 degrees.

Vertical uplift resistance of two horizontal strip anchors with common vertical axis

With an application of the upper bound finite element limit analysis, the vertical pullout capacity of a group of two horizontal strip plate anchors, with the common vertical axis and placed in a cohesive-frictional soil, has been computed. The variation of the uplift factors Fc, Fq and Fy, due to the contributions of soil cohesion, surcharge pressure and unit weight, respectively, has been evaluated for different combinations of S/B and H/B. As compared to single isolated anchor, the group of two anchors generates significantly greater magnitude of Fc for Φ ≤ 20° especially with greater values of H/B and under fully bonded anchor-soil interface condition. The factor Fc attains almost the maximum value when the upper anchor plate is placed midway between ground surface and the lower anchor plate. The factors Fq and Fy, on the other hand, for a group of two anchors are found to remain almost equal to that of a single isolated anchor as long as the levels of the lower plate in the group and the single isolated anchor are kept the same.

Antenna Selection with Power Adaptation in Interference-Constrained Cognitive Radios

The performance of an underlay cognitive radio (CR) system, which can transmit when the primary is on, is curtailed by tight constraints on the interference it can cause to the primary receiver. Transmit antenna selection (AS) improves the performance of underlay CR by exploiting spatial diversity but with less hardware. However, the selected antenna and its transmit power now both depend on the channel gains to the secondary and primary receivers. We develop a novel Chernoffbound based optimal AS and power adaptation (CBBOASPA) policy that minimizes an upper bound on the symbol error probability (SEP) at the secondary receiver, subject to constraints on the average transmit power and the average interference to the primary. The optimal antenna and its power are presented in an insightful closed form in terms of the channel gains. We then analyze the SEP of CBBOASPA. Extensive benchmarking shows that the SEP of CBBOASPA for both MPSK and MQAM is one to two orders of magnitude lower than several ad hoc AS policies and even optimal AS with on-off power control.

An Eigen Approach to Transmit Beamforming in Wireless Networks With Single Antenna Receivers

In this paper, we propose an eigen framework for transmit beamforming for single-hop and dual-hop network models with single antenna receivers. In cases where number of receivers is not more than three, the proposed Eigen approach is vastly superior in terms of ease of implementation and computational complexity compared with the existing convex-relaxation-based approaches. The essential premise is that the precoding problems can be posed as equivalent optimization problems of searching for an optimal vector in the joint numerical range of Hermitian matrices. We show that the latter problem has two convex approximations: the first one is a semi-definite program that yields a lower bound on the solution, and the second one is a linear matrix inequality that yields an upper bound on the solution. We study the performance of the proposed and existing techniques using numerical simulations.

Bearing Capacity Factors for Ring Foundations

Bearing capacity factors because of the components of cohesion, surcharge, and unit weight, respectively, have been computed for smooth and rough ring footings for different combinations of r(i)= r(o) and. by using lower and upper bound theorems of the limit analysis in conjunction with finite elements and linear optimization, where r(i) and r(o) refer to the inner and outer radii of the ring, respectively. It is observed that for a smooth footing with a given value of r(o), the magnitude of the collapse load decreases continuously with an increase in r(i). Conversely, for a rough base, for a given value of r(o), hardly any reduction occurs in the magnitude of the collapse load up to r(i)= r(o) approximate to 0.2, whereas for r(i)= r(o) > 0.2, the magnitude of the collapse load, similar to that of a smooth footing, decreases continuously with an increase in r(i)= r(o). The results from the analysis compare reasonably well with available theoretical and experimental data from the literature. (C) 2015 American Society of Civil Engineers.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.

Regularity of strain distribution in short-fiber/whisker reinforced composites

Based on studies on the strain distribution in short-fiber/whisker reinforced metal matrix composites, a deformation characteristic parameter, lambda is defined as a ratio of root-mean-square strain of the reinforcers identically oriented to the macro-linear strain along the same direction. Quantitative relation between lambda and microstructure parameters of composites is obtained. By using lambda, the stiffness moduli of composites with arbitrary reinforcer orientation density function and under arbitrary loading condition are derived. The upper-bound and lower-bound of the present prediction are the same as those from the equal-strain theory and equal-stress theory, respectively. The present theory provides a physical explanation and theoretical base for the present commonly-used empirical formulae. Compared with the microscopic mechanical theories, the present theory is competent for stiffness modulus prediction of practical engineering composites in accuracy and simplicity.

Fracture criterion based on the higher-order asymptotic fields

A complete development for the higher-order asymptotic solutions of the crack tip fields and finite element calculations for mode I loading of hardening materials in plane strain are performed. The results show that in the higher-order asymptotic solution (to the twentieth order), only three coefficients are independent. These coefficients are determined by matching with the finite element solutions carried out in the present paper (our attention is focused on the first five terms of the higher-order asymptotic solution). We obtain an analytic characterization of crack tip fields, which conform very well to the finite element solutions over wide range. A modified two parameter criterion based on the asymptotic solution of five terms is presented. The upper bound and lower bound fracture toughness curves predicted by modified two parameter criterion are given. These two curves agree with most of the experimental data and fully capture the proper trend.

An Instrumented Indentation Method for Young's Modulus Measurement with Accuracy Estimation

The relationships between indentation responses and Young's modulus of an indented material were investigated by employing dimensional analysis and finite element method. Three representative tip bluntness geometries were introduced to describe the shape of a real Berkovich indenter. It was demonstrated that for each of these bluntness geometries, a set of approximate indentation relationships correlating the ratio of nominal hardness/reduced Young's modulus H (n) /E (r) and the ratio of elastic work/total work W (e)/W can be derived. Consequently, a method for Young's modulus measurement combined with its accuracy estimation was established on basis of these relationships. The effectiveness of this approach was verified by performing nanoindentation tests on S45C carbon steel and 6061 aluminum alloy and microindentation tests on aluminum single crystal, GCr15 bearing steel and fused silica.

Some properties of the coefficients of cyclotomic polynomials

An explicit formula is obtained for the coefficients of the cyclotomic polynomial F_n(x), where n is the product of two distinct odd primes. A recursion formula and a lower bound and an improvement of Bang’s upper bound for the coefficients of F_n(x) are also obtained, where n is the product of three distinct primes. The cyclotomic coefficients are also studied when n is the product of four distinct odd primes. A recursion formula and upper bounds for its coefficients are obtained. The last chapter includes a different approach to the cyclotomic coefficients. A connection is obtained between a certain partition function and the cyclotomic coefficients when n is the product of an arbitrary number of distinct odd primes. Finally, an upper bound for the coefficients is derived when n is the product of an arbitrary number of distinct and odd primes.