Analytical Elastic Stiffness Model for 3D Woven Orthogonal Interlock Composites

This research presents the development of an analytical model to predict the elastic stiffness performance of orthogonal interlock bound 3D woven composites as a consequence of altering the weaving parameters and constituent material types. The present approach formulates expressions at the micro level with the aim of calculating more representative volume fractions of a group of elements to the layer. The rationale in representing the volume fractions within the unit cell more accurately was to improve the elastic stiffness predictions compared to existing analytical modelling approaches. The models developed in this work show good agreement between experimental data and improvement on existing predicted values by models published in literature.

Algorithmic computation of knot polynomials of secondary structure elements of proteins

The classification of protein structures is an important and still outstanding problem. The purpose of this paper is threefold. First, we utilize a relation between the Tutte and homfly polynomial to show that the Alexander-Conway polynomial can be algorithmically computed for a given planar graph. Second, as special cases of planar graphs, we use polymer graphs of protein structures. More precisely, we use three building blocks of the three-dimensional protein structure-alpha-helix, antiparallel beta-sheet, and parallel beta-sheet-and calculate, for their corresponding polymer graphs, the Tutte polynomials analytically by providing recurrence equations for all three secondary structure elements. Third, we present numerical results comparing the results from our analytical calculations with the numerical results of our algorithm-not only to test consistency, but also to demonstrate that all assigned polynomials are unique labels of the secondary structure elements. This paves the way for an automatic classification of protein structures.

Non-parametric nonlinear system identification: A data-driven orthogonal basis function approach

In this paper, a data driven orthogonal basis function approach is proposed for non-parametric FIR nonlinear system identification. The basis functions are not fixed a priori and match the structure of the unknown system automatically. This eliminates the problem of blindly choosing the basis functions without a priori structural information. Further, based on the proposed basis functions, approaches are proposed for model order determination and regressor selection along with their theoretical justifications. © 2008 IEEE.

Model categories for orthogonal calculus

We restate the notion of orthogonal calculus in terms of model categories. This provides a cleaner set of results and makes the role of O(n)-equivariance clearer. Thus we develop model structures for the category of n-polynomial and n-homogeneous functors, along with Quillen pairs relating them. We then classify n-homogeneous functors, via a zig-zag of Quillen equivalences, in terms of spectra with an O(n)-action. This improves upon the classification theorem of Weiss. As an application, we develop a variant of orthogonal calculus by replacing topological spaces with orthogonal spectra.

Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay

A wireless relay network with one source, one relay and one destination is considered, where nodes communicate via N orthogonal channels. We develop optimal power allocation strategies at both the source and relay for maximizing the overall source-destination capacity under individual power constraints at the source and relay. Some properties of the optimal solution are studied. © 2012 IEEE.

Comparison of adaptive beamforming and orthogonal STBC with outdated feedback

We compare the achievable performance of adaptive beamforming (A-BF) and adaptive orthogonal space time block coding (A-OSTBC) with outdated channel feedback. We extend our single user setup to multiuser diversity systems employing adaptive modulation, and illustrate the impact of feedback delay on the multiuser diversity gain with either A-OSTBC or A-BF. Using closed-form expressions for spectral efficiency and average BER of a multiuser diversity system derived in this paper, we prove that the A-BF scheme outperforms the A-OSTBC scheme with no feedback delay. However, when the feedback delay is large, the A-OSTBC scheme achieves better performance due to the reduced diversity advantage of A-BF. We observe that more transmit antennas bring higher spectral efficiency for BF. With small feedback delay, this becomes inverted using OSTBC, due to the effect of channel-hardening. Interestingly, however, we show that A-OSTBC with multiple users enjoys improved spectral efficiency when the number of transmit antennas is increased and the feedback delay is significant

Orthogonal space-time block coded rate-adaptive modulation with outdated feedbasck

Abstract-Channel state information (CSI) at the transmitter can be used to adapt transmission rate or antenna gains in multi-antenna systems. We propose a rate-adaptive M-QAM scheme equipped with orthogonal space-time block coding with simple outdated, finite-rate feedback over independent flat fading channels. We obtain closed-form expressions for the average BER and throughput for our scheme, and analyze the effects of possibly delayed feedback on the performance gains. We derive optimal switching thresholds maximizing the average throughput under average and outage BER constraints with outdated feedback. Our numerical results illustrate the immunity of our optimal thresholds to delayed feedback.

Power allocation strategies across N orthogonal channels for single-relay networks at both source and relay

We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed over N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity. Depending on the availability of the channel state information at both the source and relay or only at the relay, power allocation is performed at both the source and relay or only at the relay. Considering different setups for the problem, various optimization problems are formulated and solved. Some properties of the optimal solution are also proved.