A structural principle for a class of adaptive systems

A feature common to many adaptive systems for identification and control is the adjustment.of gain parameters in a manner ensuring the stability of the overall system. This paper puts forward a principle which assures such a result for arbitrary systems which are linear and time invariant except for the adjustable parameters. The principle only demands that a transfer function be positive real. This transfer function dependent on the structure of the system with respect to the parameters. Several examples from adaptive identification, control and observer schemes are given as illustrations of the conceptual simplification provided by the structural principle.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

Lacunary Fourier series and a qualitative uncertainty principle for compact Lie groups

We define lacunary Fourier series on a compact connected semisimple Lie group G. If f is an element of L-1 (G) has lacunary Fourier series and f vanishes on a non empty open subset of G, then we prove that f vanishes identically. This result can be viewed as a qualitative uncertainty principle.

The principle of microscopic reversibility in organic chemistry - a critique

The principle of microscopic reversibility is one of the few generalising principles used in organic chemistry which have their roots in the fundamental laws of thermodynamics. It has, therefore, been highly popular. However, although the principle has some important uses, its general application is not without pitfalls. The principle is easy to misunderstand and to misapply: indeed, some of its formulations are semantically dubious. The principle is most dangerous when used as a charm, for it is more subtle than some of its formulations suggest. But above all, the principle may not be used for deducing or disproving the mechanism of a reaction, except when the mechanism in the reverse direction is known independently. For, such use is, perhaps, the deadliest misapplication.

First-principle description of magnonic PdnFem multilayers

Ab-initio calculations are used to determine the parameters that determine magnonic band structure of PdnFem multilayers (n = 2, m <= 8). We obtain the layer-resolved magnetization, the exchange coupling, and the magnetic anisotropy of the Pd-Fe structures. The Fe moment is 3.0 mu(B) close to the Pd layers and 2.2 mu(B) in the middle of the Fe layers. An intriguing but not usually considered aspect is that the elemental Pd is nonmagnetic, similar to Cu spacer layers in other multilayer systems. This leads to a pre-asymptotic ferromagnetic coupling through the Pd (about 40 mJ/m(2)). Furthermore, the Pd acquires a small moment due to spin polarization by neighboring Fe atoms, which translates into magnetic anisotropy. The anisotropies are large, in the range typical for L1(0) structures, which is beneficial for high-frequency applications. (C) 2011 American Institute of Physics. doi:10.1063/1.3556763]

A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding

Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.

A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder

Precoding for multiple-input multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For two transmit antennas and QAM constellations, a real-valued precoder which is approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) among real-valued precoders based on the singular value decomposition (SVD) of the channel is proposed. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for two transmit antennas which is in existence for 4-QAM alone and is extremely hard to obtain for larger QAM constellations. The proposed precoding scheme is extended to higher number of transmit antennas on the lines of the E - d(min) precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. The proposed precoder's ML-decoding complexity as a function of the constellation size M is only O(root M)while that of the E - d(min) precoder is O(M root M)(M = 4). Compared to the recently proposed X- and Y-precoders, the error performance of the proposed precoder is significantly better while being only marginally worse than that of the E - d(min) precoder for 4-QAM. It is argued that the proposed precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2 x 2, 4 x 4 and 8 x 8 systems.

Ultrafast Raman loss spectroscopy (URLS): instrumentation and principle

In this paper, we report on the concept and the design principle of ultrafast Raman loss spectroscopy (URLS) as a structure-elucidating tool. URLS is an analogue of stimulated Raman scattering (SRS) but more sensitive than SRS with better signal-to-noise ratio. It involves the interaction of two laser sources, namely, a picosecond (ps) Raman pump pulse and a white-light (WL) continuum, with a sample, leading to the generation of loss signals on the higher energy (blue) side with respect to the wavelength of the Raman pump unlike the gain signal observed on the lower energy (red) side in SRS. These loss signals are at least 1.5 times more intense than the SRS signals. An experimental study providing an insight into the origin of this extra intensity in URLS as compared to SRS is reported. Furthermore, the very requirement of the experimental protocol for the signal detection to be on the higher energy side by design eliminates the interference from fluorescence, which appears on the red side. Unlike CARS, URLS signals are not precluded by the non-resonant background and, being a self-phase-matched process, URLS is experimentally easier. Copyright (C) 2011 John Wiley & Sons, Ltd.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion

Low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, were given by Guo and Xia along with sufficient conditions for a Space-Time Block Code (STBC) to achieve full diversity with PIC/PIC-SIC decoding for point-to-point MIMO channels. In Part-I of this two part series of papers, we give new conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. We then show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks and give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders. In Part-II, we construct new low complexity full-diversity PIC/PIC-SIC decodable STBCs and DSTBCs that achieve higher rates than the known full-diversity low complexity ML decodable STBCs and DSTBCs.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.

Generalized distributive law for ML decoding of STBCs

The Generalized Distributive Law (GDL) is a message passing algorithm which can efficiently solve a certain class of computational problems, and includes as special cases the Viterbi's algorithm, the BCJR algorithm, the Fast-Fourier Transform, Turbo and LDPC decoding algorithms. In this paper GDL based maximum-likelihood (ML) decoding of Space-Time Block Codes (STBCs) is introduced and a sufficient condition for an STBC to admit low GDL decoding complexity is given. Fast-decoding and multigroup decoding are the two algorithms used in the literature to ML decode STBCs with low complexity. An algorithm which exploits the advantages of both these two is called Conditional ML (CML) decoding. It is shown in this paper that the GDL decoding complexity of any STBC is upper bounded by its CML decoding complexity, and that there exist codes for which the GDL complexity is strictly less than the CML complexity. Explicit examples of two such families of STBCs is given in this paper. Thus the CML is in general suboptimal in reducing the ML decoding complexity of a code, and one should design codes with low GDL complexity rather than low CML complexity.

Totally selective convolutional decoding

A modification of the Viterbi decoding algorithm is suggested for faster convergence.