Role of elasto-plastic analysis under cyclic loading in fatigue crack growth studies

Linear Elastic Fracture Mechanics (LEFM) has been widely used in the past for fatigue crack growth studies, but this is acceptable only in situations which are within small scale yielding (SSY). In many practical structural components, conditions of SSY could be violated and one has to look for fracture criteria based on elasto-plastic analysis. Crack closure phenomenon, one of the most striking discoveries based on inelastic deformations during crack growth, has significant effect on fatigue crack growth rate. Numerical simulation of this phenomenon is computationally intensive and involved but has been successfully implemented. Stress intensity factors and strain energy release rates lose their meaning, J-integral (or its incremental) values are applicable only in specific situations, whereas alternate path independent integrals have been proposed in the literature for use with elasto-plastic fracture mechanics (EPFM) based criteria. This paper presents certain salient features of two independent finite element (numerical) studies of relevance to fatigue crack growth, where elasto-plastic analysis becomes significant. These problems can only be handled in the current day computational environment, and would have been only a dream just a few years ago.

Thermally Controlled Cyclic Insertion/Ejection of Dopant Ions and Reversible Zinc Blende/Wurtzite Phase Changes in ZnS Nanostructures

We report a reversible phase transformation of platelet-shaped ZnS nanostructures between wurtzite (WZ) and zinc blende (ZB) phases by reversible insertion/ ejection of dopant Mn(II) ions induced by a thermocyclic process. In a reaction flask loaded with WZ ZnS platelets and Mn molecular precursors, during heating Mn ions are incorporated and change the phase of the host nanostructures to ZB; during cooling Mn ions are spontaneously ejected, returning the host nanoplatelets to the original WZ phase. These reversible changes are monitored for several cycles with PL, EPR, XRD, and HRTEM. Interestingly, the (0001) WZ platelets transform to (110) ZB following a nucleation and growth process triggered by a local increase/depletion of the Mn2+ concentration in the nanocrystals.

Thermally Controlled Cyclic Insertion/Ejection of Dopant Ions and Reversible Zinc Blende/Wurtzite Phase Changes in ZnS Nanostructures

We report a reversible phase transformation of platelet-shaped ZnS nanostructures between wurtzite (WZ) and zinc blende (ZB) phases by reversible insertion/ ejection of dopant Mn(II) ions induced by a thermocyclic process. In a reaction flask loaded with WZ ZnS platelets and Mn molecular precursors, during heating Mn ions are incorporated and change the phase of the host nanostructures to ZB; during cooling Mn ions are spontaneously ejected, returning the host nanoplatelets to the original WZ phase. These reversible changes are monitored for several cycles with PL, EPR, XRD, and HRTEM. Interestingly, the (0001) WZ platelets transform to (110) ZB following a nucleation and growth process triggered by a local increase/depletion of the Mn2+ concentration in the nanocrystals.

ChemInform Abstract: Sodium Perborate/Acetic Anhydride: A Convenient Reagent for the Conversion of Cyclic Acetals to Esters

A facile oxidative cleavage of cyclic acetals to their respective esters using an inexpensive reagent system, sodium perborate/acetic anhydride is described.

Effect of Constant and Cyclic Current Stressing on the Evolution of Intermetallic Compound Layers

In this paper the effects of constant and cyclic power loads on the evolution of interfacial reaction layers in lead-free solder interconnections are presented. Firstly, the differences in the growth behavior of intermetallic compound (IMC) layers at the cathode and anode sides of the interconnections are rationalized. This is done by considering the changes in the intrinsic fluxes of elements owing to electromigration as well as taking into account the fact that the growth of Cu3Sn and Cu6Sn5 are coupled via interfacial reactions. In this way, better understanding of the effect of electron flux on the growth of each individual layer in the Cu-Sn system can be achieved. Secondly, it is shown that there is a distinct difference between steady-state current stressing (constant current, constant temperature) and power cycling with alternating on- and off-cycle periods (accompanied by a change of temperature). The reasons behind the observed differences are subsequently discussed. Finally, special care is taken to ensure that the current densities are chosen in such a way that there is no risk for even partial melting of the solder interconnections.

MIMO Precoding With X- and Y- Codes

We consider a slow fading multiple-input multiple-output (MIMO) system with channel state information at both the transmitter and receiver. A well-known precoding scheme is based upon the singular value decomposition (SVD) of the channel matrix, which transforms the MIMO channel into parallel subchannels. Despite having low maximum likelihood decoding (MLD) complexity, this SVD precoding scheme provides a diversity gain which is limited by the diversity gain of the weakest subchannel. We therefore propose X- and Y-Codes, which improve the diversity gain of the SVD precoding scheme but maintain the low MLD complexity, by jointly coding information across a pair of subchannels. In particular, subchannels with high diversity gain are paired with those having low diversity gain. A pair of subchannels is jointly encoded using a 2 2 real matrix, which is fixed a priori and does not change with each channel realization. For X-Codes, these rotation matrices are parameterized by a single angle, while for Y-Codes, these matrices are left triangular matrices. Moreover, we propose X-, Y-Precoders with the same structure as X-, Y-Codes, but with encoding matrices adapted to each channel realization. We observed that X-Codes/Precoders are good for well-conditioned channels, while Y-Codes/Precoders are good for ill-conditioned channels.

Wavelength/Time orthogonal codes with FEC offer dual advantage

To meet the growing demands of the high data rate applications, suitable asynchronous schemes such as Fiber-Optic Code Division Multiple Access (FO-CDMA) are required in the last mile. FO-CDMA scheme offers potential benefits and at the same time it faces many challenges. Wavelength/Time (W/T) 2-D codes for use in FO-CDMA, can be classified mainly into two types: 1) hybrid codes and 2) matrix codes, to reduce the 'time' like property, have been proposed. W/T single-pulse-per-row (SPR) are energy efficient codes as this family of codes have autocorrelation sidelobes of '0', which is unique to this family and the important feature of the W/T multiple-pulses-per-row (MPR) codes is that the aspect ratio can be varied by trade off between wavelength and temporal lengths. These W/T codes have improved cardinality and spectral efficiency over other W/T codes and at the same time have lowest crosscorrelation values. In this paper, we analyze the performances of the FO-CDMA networks using W/T SPR codes and W/T MPR codes, with and without forward error correction (FEC) coding and show that with FEC there is dual advantage of error correction and reduced spread sequence length.

Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Precoding with X-codes to increase capacity with discrete input alphabets

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on X-Codes in to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using Singular Value Decomposition (SVD) and X-codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and the 2 × 2 real rotation matrices for each pair (parameterized with a single angle). This precoding structure enables to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is equivalent to i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and significantly better than mercury/waterfilling strategy by Lozano et al.. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.

Cyclic Prefix Based Cooperative Sequential Spectrum Sensing Algorithms for OFDM

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.

Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Implications of the half-duplex constraint on relay-aided cooperation using rateless codes

The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.