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.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Generalized distributive law for ML decoding of STBCs: further results

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In [1], we introduced a framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-graph based Sum-Product Algorithm, and showed that for two specific families of STBCs, the Toepltiz codes and the Overlapped Alamouti Codes (OACs), the GDL based ML decoders have strictly less complexity than the CML decoders. In this paper, we introduce a `traceback' step to the GDL decoding algorithm of STBCs, which enables roughly 4 times reduction in the complexity of the GDL decoders proposed in [1]. Utilizing this complexity reduction from `traceback', we then show that for any STBC (not just the Toeplitz and Overlapped Alamouti Codes), the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from Cyclic Division Algebras that is not multigroup or conditionally multigroup decodable, the GDL decoder provides approximately 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only about half as complex as the CML decoder.

Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs using Reactive Tabu Search

Non-orthogonal space-time block codes (STBC) with large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a given number of transmit antennas) as well as full transmit diversity. Decoding of non-orthogonal STBCs with large dimensions has been a challenge. In this paper, we present a reactive tabu search (RTS) based algorithm for decoding non-orthogonal STBCs from cyclic division algebras (CDA) having largedimensions. Under i.i.d fading and perfect channel state information at the receiver (CSIR), our simulation results show that RTS based decoding of 12 X 12 STBC from CDA and 4-QAM with 288 real dimensions achieves i) 10(-3) uncoded BER at an SNR of just 0.5 dB away from SISO AWGN performance, and ii) a coded BER performance close to within about 5 dB of the theoretical MIMO capacity, using rate-3/4 turbo code at a spectral efficiency of 18 bps/Hz. RTS is shown to achieve near SISO AWGN performance with less number of dimensions than with LAS algorithm (which we reported recently) at some extra complexity than LAS. We also report good BER performance of RTS when i.i.d fading and perfect CSIR assumptions are relaxed by considering a spatially correlated MIMO channel model, and by using a training based iterative RTS decoding/channel estimation scheme.

Finite data performance of MUSIC and minimum norm methods

In the direction of arrival (DOA) estimation problem, we encounter both finite data and insufficient knowledge of array characterization. It is therefore important to study how subspace-based methods perform in such conditions. We analyze the finite data performance of the multiple signal classification (MUSIC) and minimum norm (min. norm) methods in the presence of sensor gain and phase errors, and derive expressions for the mean square error (MSE) in the DOA estimates. These expressions are first derived assuming an arbitrary array and then simplified for the special case of an uniform linear array with isotropic sensors. When they are further simplified for the case of finite data only and sensor errors only, they reduce to the recent results given in [9-12]. Computer simulations are used to verify the closeness between the predicted and simulated values of the MSE.

A comparative social network analysis of wasp colonies and classrooms: Linking network structure to functioning

A major question in current network science is how to understand the relationship between structure and functioning of real networks. Here we present a comparative network analysis of 48 wasp and 36 human social networks. We have compared the centralisation and small world character of these interaction networks and have studied how these properties change over time. We compared the interaction networks of (1) two congeneric wasp species (Ropalidia marginata and Ropalidia cyathiformis), (2) the queen-right (with the queen) and queen-less (without the queen) networks of wasps, (3) the four network types obtained by combining (1) and (2) above, and (4) wasp networks with the social networks of children in 36 classrooms. We have found perfect (100%) centralisation in a queen-less wasp colony and nearly perfect centralisation in several other queen-less wasp colonies. Note that the perfectly centralised interaction network is quite unique in the literature of real-world networks. Differences between the interaction networks of the two wasp species are smaller than differences between the networks describing their different colony conditions. Also, the differences between different colony conditions are larger than the differences between wasp and children networks. For example, the structure of queen-right R. marginata colonies is more similar to children social networks than to that of their queen-less colonies. We conclude that network architecture depends more on the functioning of the particular community than on taxonomic differences (either between two wasp species or between wasps and humans).

Complexes of lanthanide perchlorates with two new O,N,O ligands derived from antipyraldehyde and acetic and benzoic acid hydrazides

Antipyrine is a well known ligand for lanthanides (I). A forage through the organic literature of pyrazolones reveals that the 4-position of antipyrine is amenable to a wide variety of organic reactions. It should thus be possible to introduce suitable functional groups at this position and design new multidentate ligands for metal ions. It is also found that the coordination chemistry of lanthanides is much less well developed and far fewer ligands have been used for complexation with lanthanide ions compared to that of the d-transition metal ions. Keeping these points in view we have reported earlier, complexes of lanthanides with a bidentate ligand N,N-diethyl-antipyrine-4-carboxamide (2). In this communication we report the synthesis of two new ligands from Schiff base condensation of antipyraldehyde and the hydrazides of acetic and benzoic acids and the complexes formed by these hydrazones with lanthanide perchlorates.

Role of prolactin(prl) in regulation of the nocturnal surge of testosterone (t) in the bonnet monkey (macaca radiata)

Earlier studies from this lebordory have shown thet adult male bonnet monkeys exhibit nychthemrel rhythmicity la the secretion of serum 'T' the levele reehlng peek by 22OOhr. Of the gonedotropine cnelyeed only serum PRL showed a concommitent increme with T(Biol.of Reprod. 24,814, 1981). In the present study mMinietretion of l rgobromocryptin (EBC) either by i.v.route(2mg)or by naeel l pr~(100~)reeulted in blockade of nocturnal increase of both PRL end T(Controle T-18.6ng/ml: PRL 130=29ng/ml: EBC treated T-2.2&1.2ng/ml; PRL n.d.to 15nng/ml). Adminietretion of N oPRL could not reverse the effect of EBC. Although, increaeed serum PRL induced by injection of Chlorprommine did not result in increase in serum 'T' during the dey time, the nocturnel 'T' surge could not be obeeerved. EBC treeted monkeys, however, showed normal testosterone response to exogenous hCG. These IeSUlte a0 SwgeStive of high levels of PRL me&in6 reeponeiveneee of testes to tonic levels of serum IX. (Aided by grant8 from ICMR, Kew Delhi, WHO, Geneva eld FPF, India).

Complexes of lanthanide perchlorates with two new " O,N,O " ligands derived from antipyraldehyde and acetic and benzoic acid hydrazides

Antipyrlne is a well known llgand for lanthanldes (i). A forage through the organic literature of pyrazolones reveals that the 4-position of antipyrlne is amenable to a wide variety of organic reactions. It should thus be possible to introduce suitable functional groups at this position and design new multidentate ligands for metal ions. It is also found that the coordination chemistry of lanthanides is much less well developed and far fewer ligands have been used for complexation with lanthanide ions compared to that of the d-transition metal ions.

Algebraic distributed space-time codes with low ML decoding complexity

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Use of Abel integral equations in water wave scattering by two surface-piercing barriers

In this paper the classical problem of water wave scattering by two partially immersed plane vertical barriers submerged in deep water up to the same depth is investigated. This problem has an exact but complicated solution and an approximate solution in the literature of linearised theory of water waves. Using the Havelock expansion for the water wave potential, the problem is reduced here to solving Abel integral equations having exact solutions. Utilising these solutions,two sets of expressions for the reflection and transmission coefficients are obtained in closed forms in terms of computable integrals in contrast to the results given in the literature which,involved six complicated integrals in terms of elliptic functions. The two different expressions for each coefficient produce almost the same numerical results although it has not been possible to prove their equivalence analytically. The reflection coefficient is depicted against the wave number in a number of figures which almost coincide with the figures available in the literature wherein the problem was solved approximately by employing complementary approximations. (C) 2009 Elsevier B.V. All rights reserved.

A suprathreshold stochastic resonance based pre-processor for direction-of-arrival estimation

In this paper we propose a nonlinear preprocessor for enhancing the performance of processors used for direction-of-arrival (DOA) estimation in heavy-tailed non-Gaussian noise. The preprocessor based on the phenomenon of suprathreshold stochastic resonance (SSR), provides SNR gain. The preprocessed data is used for DOA estimation by the MUSIC algorithm. Simulation results are presented to show that the SSR preprocessor provides a significant improvement in the performance of MUSIC in heavy-tailed noise at low SNR.

Language independent automated segmentation of speech using Bach scale filter-banks

This correspondence describes a method for automated segmentation of speech. The method proposed in this paper uses a specially designed filter-bank called Bach filter-bank which makes use of 'music' related perception criteria. The speech signal is treated as continuously time varying signal as against a short time stationary model. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. The Bach filters are seen to marginally outperform the other filters.

Geoarchaeological Evidence of a Chola-Period Tsunami from an Ancient Port at Kaveripattinam on the Southeastern Coast of India

Literature of the ancient Chola Dynasty (A.D. 9th-11th centuries) of South India and recent archaeological excavations allude to a sea flood that crippled the ancient port at Kaveripattinam, a trading hub for Southeast Asia, and probably affected the entire South Indian coast, analogous to the 2004 Indian Ocean tsunami impact. We present sedimentary evidence from an archaeological site to validate the textual references to this early medieval event. A sandy layer showing bed forms representing high-energy conditions, possibly generated by a seaborne wave, was identified at the Kaveripattinam coast of Tamil Nadu, South India. Its sedimentary characteristics include hummocky cross-stratification, convolute lamination with heavy minerals, rip-up clasts, an erosional contact with the underlying mud bed, and a landward thinning geometry. Admixed with 1000-year-old Chola period artifacts, it provided an optically stimulated luminescence age of 1091 perpendicular to 66 yr and a thermoluminescence age of 993 perpendicular to 73 yr for the embedded pottery sherds. The dates of these proxies converge around 1000 yr B. P., correlative of an ancient tsunami reported from elsewhere along the Indian Ocean coasts. (C) 2011 Wiley Periodicals, Inc.

Role of Spectral Studies in Detection of Antibacterial Phytoelements and Phytochemicals of Moringa oleifera

This paper reports, the Laser Induced Breakdown Spectroscopy (LIBS) studies and structure elucidation of compounds isolated from the fruit extract of Moringa oleifera and also deals with their possible effects on some bacterial strains viz. Staphylococcus aureus, Klebsiella pneumonia, Escherichia coli and Pseudomonas aeruginosa. The extract was found to be active against all four microorganisms used. Extent of inhibitory effect of extract was assessed at different concentrations of 25, 50, 75 mg/ml by measuring diameter of inhibition zone (DIZ). Our results clearly showed that the 75 mg/ml concentration of the extract had 14, 12 and 18 mm of the DIZ against Staphylococcus aureus, Klebsiella pneumonia and Pseudomonas aeruginosa and 14 mm with 50 mg/ml concentration against Escherichia coli. The results were compared with the standard antibiotic `ampicillin' of 1 mg/ml concentration. LIBS was recorded with high power pulsed laser beam from Nd: YAG Laser (Continuum Surelite III-10), focused on the surface of the material, which was in liquid form, to generate plasma on the surface of the sample. LIBS data clearly demonstrate the presence of trace elements, magnesium and iron, in high concentration in the extract. Whereas, from the phytochemical profile reveals the presence of two new compounds, S-ethyl-N-{4-[(alpha-L-rhamnosyloxy) benzyl]} thiocarbamate and 2-acetoxy {4-[(2',3',4'-tri-O-acetyl-alpha-L-rhamnosyloxy) benzyl]} acetonitrile as the major constituents. This study is the first report on synergetic effect of the phytoconstituents and certain set of elements present in their defined role in bacterial management against different bacterial strains.