Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs

Space-time block codes (STBCs) obtained from non-square complex orthogonal designs are bandwidth efficient compared to those from square real/complex orthogonal designs for colocated coherent MIMO systems and has other applications in (i) non-coherent MIMO systems with non-differential detection, (ii) Space-Time-Frequency codes for MIMO-OFDM systems and (iii) distributed space-time coding for relay channels. Liang (IEEE Trans. Inform. Theory, 2003) has constructed maximal rate non-square designs for any number of antennas, with rates given by [(a+1)/(2a)] when number of transmit antennas is 2a-1 or 2a. However, these designs have large delays. When large number of antennas are considered this rate is close to 1/2. Tarokh et al (IEEE Trans. Inform. Theory, 1999) have constructed rate 1/2 non-square CODs using the rate-1 real orthogonal designs for any number of antennas, where the decoding delay of these codes is less compared to the codes constructed by Liang for number of transmit antennas more than 5. In this paper, we construct a class of rate-1/2 codes for arbitrary number of antennas where the decoding delay is reduced by 50% when compared with the rate-1/2 codes given by Tarokh et al. It is also shown that even though scaling the variables helps to lower the delay it can not be used to increase the rate.

Memory-efficient spatial prediction image compression scheme

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

'Wet N2O oxidation' process and interface state density characterization of nanoscale nitrided SiO2 for flash memory application

In this paper we first present the 'wet N2O' furnace oxidation process to grow nitrided tunnel oxides in the thickness range 6 to 8 nm on silicon at a temperature of 800 degrees C. Electrical characteristics of MOS capacitors and MOSFETs fabricated using this oxide as gate oxide have been evaluated and the superior features of this oxide are ascertained The frequency response of the interface states, before and after subjecting the MOSFET gate oxide to constant current stress, is studied using a simple analytical model developed in this work.

Conditional Probability-Based Significance Tests for Sequential Patterns in Multineuronal Spike Trains

We consider the problem of detecting statistically significant sequential patterns in multineuronal spike trains. These patterns are characterized by ordered sequences of spikes from different neurons with specific delays between spikes. We have previously proposed a data-mining scheme to efficiently discover such patterns, which occur often enough in the data. Here we propose a method to determine the statistical significance of such repeating patterns. The novelty of our approach is that we use a compound null hypothesis that not only includes models of independent neurons but also models where neurons have weak dependencies. The strength of interaction among the neurons is represented in terms of certain pair-wise conditional probabilities. We specify our null hypothesis by putting an upper bound on all such conditional probabilities. We construct a probabilistic model that captures the counting process and use this to derive a test of significance for rejecting such a compound null hypothesis. The structure of our null hypothesis also allows us to rank-order different significant patterns. We illustrate the effectiveness of our approach using spike trains generated with a simulator.

Avian diversification patterns across the K-Pg boundary: Influence of calibrations, datasets, and model misspecification

Birds represent the most diverse extant tetrapod clade, with ca. 10,000 extant species, and the timing of the crown avian radiation remains hotly debated. The fossil record supports a primarily Cenozoic radiation of crown birds, whereas molecular divergence dating analyses generally imply that this radiation was well underway during the Cretaceous. Furthermore, substantial differences have been noted between published divergence estimates. These have been variously attributed to clock model, calibration regime, and gene type. One underappreciated phenomenon is that disparity between fossil ages and molecular dates tends to be proportionally greater for shallower nodes in the avian Tree of Life. Here, we explore potential drivers of disparity in avian divergence dates through a set of analyses applying various calibration strategies and coding methods to a mitochondrial genome dataset and an 18-gene nuclear dataset, both sampled across 72 taxa. Our analyses support the occurrence of two deep divergences (i.e., the Palaeognathae/Neognathae split and the Galloanserae/Neoaves split) well within the Cretaceous, followed by a rapid radiation of Neoaves near the K-Pg boundary. However, 95% highest posterior density intervals for most basal divergences in Neoaves cross the boundary, and we emphasize that, barring unreasonably strict prior distributions, distinguishing between a rapid Early Paleocene radiation and a Late Cretaceous radiation may be beyond the resolving power of currently favored divergence dating methods. In contrast to recent observations for placental mammals, constraining all divergences within Neoaves to occur in the Cenozoic does not result in unreasonably high inferred substitution rates. Comparisons of nuclear DNA (nDNA) versus mitochondrial DNA (mtDNA) datasets and NT- versus RY-coded mitochondrial data reveal patterns of disparity that are consistent with substitution model misspecifications that result in tree compression/tree extension artifacts, which may explain some discordance between previous divergence estimates based on different sequence types. Comparisons of fully calibrated and nominally calibrated trees support a correlation between body mass and apparent dating error. Overall, our results are consistent with (but do not require) a Paleogene radiation for most major clades of crown birds.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

BER analysis of space-time block codes from generalized complex orthogonal designs for M-PSK

In this paper, we present an analysis for the bit error rate (BER) performance of space-time block codes (STBC) from generalized complex orthogonal designs for M-PSK modulation. In STBCs from complex orthogonal designs (COD), the norms of the column vectors are the same (e.g., Alamouti code). However, in generalized COD (GCOD), the norms of the column vectors may not necessarily be the same (e.g., the rate-3/5 and rate-7/11 codes by Su and Xia in [1]). STBCs from GCOD are of interest because of the high rates that they can achieve (in [2], it has been shown that the maximum achievable rate for STBCs from GCOD is bounded by 4/5). While the BER performance of STBCs: from COD (e.g., Alamouti code) can be simply obtained from existing analytical expressions for receive diversity with the same diversity order by appropriately scaling the SNR, this can not be done for STBCs from GCOD (because of the unequal norms of the column vectors). Our contribution in this paper is that we derive analytical expressions for the BER performance of any STBC from GCOD. Our BER analysis for the GCOD captures the performance of STBCs from COD as special cases. We validate our results with two STBCs from GCOD reported by Su and Xia in [1], for 5 and 6 transmit antennas (G(5) and G(6) in [1]) with rates 7/11 and 3/5, respectively.

Memory Meanders : Place, Home and Commemoration in an Ex-Rhodesian Diaspora Community

Memory Meanders is an ethnographic analysis of a postcolonial migrant community, white former Rhodesians, who have emigrated from Zimbabwe to South Africa after Zimbabwe s independence in 1980. An estimated 100 000 whites left the country during the first years of independence. Majority of these emigrants settled in South Africa. In recent years President Mugabe s land redistribution program has inflicted forced expulsions and violence against white farmers and black farm workers, and instigated a new wave of emigration. Concerning the study of Southern Africa, my research is therefore very topical. In recent years there has been a growing concern to study postcolonialism as it unfolds in the lived realities of actual postcolonies. A rising interest has also been cast on colonial cultures and white colonials within complex power relationships. My research offers insight to these discussions by investigating the ways in which the colonial past affects and effects in the present activities and ideas of former colonials. The study also takes part in discussing fundamental questions concerning how diaspora communities socially construct their place in the world in relation to the place left behind, to their current places of dwelling and to the community in dispersal. In spite of Rhodesia s incontestable ending, it is held close by social practices; by thoughts and talks, by material displays, and by webs of meaningful relationships. Such social memory practices, I suggest, are fundamental to how the community understands itself. The vantage points from which I examine how the ex-Rhodesians reminisce about Rhodesia concern ideas and practices related to place, home and commemoration. I first focus on the processes of symbolic investment that go into understanding place and landscape in Rhodesia and ask how the once dwelled-in places, iconic landscapes and experiences within places are reminisced about in diaspora. Secondly, I examine how home both as a mundanely organized sphere of everyday lives and as an idea of belonging is culturally configured, and analyze how and if homes travel in diaspora. In the final ethnographic section I focus on commemorative practices. I first analyze how food and culturally specific festive occasions of commensality are connected to social and sensual memory, considering the unique ways in which food acts as a mnemonic trigger in a diaspora community. The second example concerns the celebration of a centenary of Rhodesia in 1990. Through this case I describe how the mnemonic power of commemoration rests on the fact that culturally meaningful experiences are bodily re-enacted. I show how habitual memory connected to performance is one example of how memory gets passed-on in non-textual ways.

Drug cultures in Estonia : contexts, meanings and patterns of illicit drug use.

In Estonia, illicit drug use hardly existed before the social changes of the 1990s when, as a result of economic and cultural transformations, the country became part of a world order centred in the West. On the one hand, this development is due to the spread of international youth culture, which many young people have perceived as being associated with drugs; on the other hand, it results from the marginalisation of a part of the population. The empirical part of the study is based mostly on in-depth interviews with different drug users conducted during between 1998 and 2002. Complementary material includes the results of participant observations, interviews with key experts, and the results of previous quantitative studies and statistics. The young people who started experimenting with illicit drugs from the 1990s and onwards perceived them as a part of an attractive lifestyle - a Western lifestyle, a point which is worth stressing in the case of Estonia. Although the reasons for initiation into drug use were similar for the majority of young people, their drug use habits and the impact of the drug use on their lives began to differ. I argue that the potential pleasure and harm which might accompany drug use is offset by the meanings attached to drugs and the sanctions and rituals regulating drug use. In the study both recreational and problem use have been analysed from different aspects in seven articles. I have investigated different types of drug users: new bohemians, cannabis users, in whose case partying and restrictive drug use is positively connected to their lives and goals within established society; stimulant-using party people for whom drugs are a means of having fun but who do not have the same restrictive norms regulating their drug use as the former and who may get into trouble under certain conditions; and heroin users for whom the drug rapidly progressed from a means of having fun to an obligation due to addiction. The research results point at the importance not only of the drug itself and the socio-economic situation of the user, but also of the cultural and social context within which the drug is used. The latter may on occasions be a crucial factor in whether or not initial drug use eventually leads to addiction.

Structure determination and biochemical studies on Bacillus stearothermophilus E53Q serine hydroxymethyltransferase and its complexes provide insights on function and enzyme memory

Serine hydroxymethyltransferase (SHMT) belongs to the alpha-family of pyridoxal 5'-phosphate-dependent enzymes and catalyzes the reversible conversion of L-Ser and etrahydrofolate to Gly and 5,10-methylene tetrahydrofolate. 5,10-Methylene tetrahydrofolate serves as a source of one-carbon fragment in many biological processes. SHMT also catalyzes the tetrahydrofolate-independent conversion of L-allo-Thr to Gly and acetaldehyde. The crystal structure of Bacillus stearothermophilus SHMT (bsSHMT) suggested that E53 interacts with the substrate, L-Ser and etrahydrofolate. To elucidate the role of E53, it was mutated to Q and structural and biochemical studies were carried out with the mutant enzyme. The internal aldimine structure of E53QbsSHMT was similar to that of the except for significant changes at Q53, Y60 and Y61. The wild-type enzyme, carboxyl of Gly and side chain of L-Ser were in two conformations in the respective external aldimine structures. The mutant enzyme was completely inactive for tetrahydrofolate-depen dent cleavage of L-Ser, whereas there was a 1.5-fold increase in the rate of tetrahydrofolate-independent reaction with L-allo-Thr. The results obtained from these studies suggest that E53 plays an essential role in tetrahydrofolate/5-formyl tetrahydrofolate binding and in the proper positioning of C beta of L-Ser for direct attack by N5 of tetrahydrofolate. Most interestingly, the structure of the complex obtained by cocrystallization of E53QbsSHMT with Gly and 5-formyl tetrahydrofolate revealed the gem-diamine form of pyridoxal 5'-phosphate bound to Gly and active site Lys. However, density for 5-formyl tetrahydrofolate was not observed. Gly carboxylate was in a single conformation, whereas pyridoxal 5'-phosphate had two distinct conformations. The differences between the structures of this complex and Gly external aldimine suggest that the changes induced by initial binding of 5-formyl tetrahydrofolate are retained even though 5-formyl tetrahydrofolate is absent in the final structure. Spectral studies carried out with this mutant enzyme also suggest that 5-formyl tetrahydrofolate binds to the E53QbsSHMT-Gly complex forming a quinonoid intermediate and falls off within 4 h of dialysis, leaving behind the mutant enzyme in the gemdiamine form. This is the first report to provide direct evidence for enzyme memory based on the crystal structure of enzyme complexes.

Fast in-memory XPath search using compressed indexes

A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicates can be efficiently implemented using a compressed self-index of the document's text nodes. Most queries, however, contain some parts querying the text of the document, plus some parts querying the tree structure. It is therefore a challenge to choose an appropriate evaluation order for a given query, which optimally leverages the execution speeds of the text and tree indexes. Here the SXSI system is introduced. It stores the tree structure of an XML document using a bit array of opening and closing brackets plus a sequence of labels, and stores the text nodes of the document using a global compressed self-index. On top of these indexes sits an XPath query engine that is based on tree automata. The engine uses fast counting queries of the text index in order to dynamically determine whether to evaluate top-down or bottom-up with respect to the tree structure. The resulting system has several advantages over existing systems: (1) on pure tree queries (without text search) such as the XPathMark queries, the SXSI system performs on par or better than the fastest known systems MonetDB and Qizx, (2) on queries that use text search, SXSI outperforms the existing systems by 1-3 orders of magnitude (depending on the size of the result set), and (3) with respect to memory consumption, SXSI outperforms all other systems for counting-only queries.

Observation of a power-law memory kernel for fluctuations within a single protein molecule

The fluctuation of the distance between a fluorescein-tyrosine pair within a single protein complex was directly monitored in real time by photoinduced electron transfer and found to be a stationary, time-reversible, and non-Markovian Gaussian process. Within the generalized Langevin equation formalism, we experimentally determine the memory kernel K(t), which is proportional to the autocorrelation function of the random fluctuating force. K(t) is a power-law decay, t(-0.51 +/- 0.07) in a broad range of time scales (10(-3)-10 s). Such a long-time memory effect could have implications for protein functions.

BER analysis of space-time block codes from generalized complex orthogonal designs for M-PSK

In this paper, we present an analysis for the bit error rate (BER) performance of space-time block codes (STBC) from generalized complex orthogonal designs for M-PSK modulation. In STBCs from complex orthogonal designs (COD), the norms of the column vectors are the same (e.g., Alamouti code). However, in generalized COD (GCOD), the norms of the column vectors may not necessarily be the same (e.g., the rate-3/5 and rate-7/11 codes by Su and Xia in [1]). STBCs from GCOD are of interest because of the high rates that they can achieve (in [2], it has been shown that the maximum achievable rate for STBCs from GCOD is bounded by 4/5). While the BER performance of STBCs: from COD (e.g., Alamouti code) can be simply obtained from existing analytical expressions for receive diversity with the same diversity order by appropriately scaling the SNR, this can not be done for STBCs from GCOD (because of the unequal norms of the column vectors). Our contribution in this paper is that we derive analytical expressions for the BER performance of any STBC from GCOD. Our BER analysis for the GCOD captures the performance of STBCs from COD as special cases. We validate our results with two STBCs from GCOD reported by Su and Xia in [1], for 5 and 6 transmit antennas (G(5) and G(6) in [1]) with rates 7/11 and 3/5, respectively.

BER analysis of space-time block codes from generalized complex orthogonal designs for M-PSK

In this paper, we present an analysis for the bit error rate (BER) performance of space-time block codes (STBC) from generalized complex orthogonal designs for M-PSK modulation. In STBCs from complex orthogonal designs (COD), the norms of the column vectors are the same (e.g., Alamouti code). However, in generalized COD (GCOD), the norms of the column vectors may not necessarily be the same (e.g., the rate-3/5 and rate-7/11 codes by Su and Xia in [1]). STBCs from GCOD are of interest because of the high rates that they can achieve (in [2], it has been shown that the maximum achievable rate for STBCs from GCOD is bounded by 4/5). While the BER performance of STBCs: from COD (e.g., Alamouti code) can be simply obtained from existing analytical expressions for receive diversity with the same diversity order by appropriately scaling the SNR, this can not be done for STBCs from GCOD (because of the unequal norms of the column vectors). Our contribution in this paper is that we derive analytical expressions for the BER performance of any STBC from GCOD. Our BER analysis for the GCOD captures the performance of STBCs from COD as special cases. We validate our results with two STBCs from GCOD reported by Su and Xia in [1], for 5 and 6 transmit antennas (G(5) and G(6) in [1]) with rates 7/11 and 3/5, respectively.