Low-Complexity Near-MAP Decoding of Large Non-Orthogonal STBCs Using PDA

Non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) 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 hundreds of dimensions has been a challenge. In this paper, we present a probabilistic data association (PDA) based algorithm for decoding non-orthogonal STBCs with large dimensions. Our simulation results show that the proposed PDA-based algorithm achieves near SISO AWGN uncoded BER as well as near-capacity coded BER (within 5 dB of the theoretical capacity) for large non-orthogonal STBCs from CDA. We study the effect of spatial correlation on the BER, and show that the performance loss due to spatial correlation can be alleviated by providing more receive spatial dimensions. We report good BER performance when a training-based iterative decoding/channel estimation is used (instead of assuming perfect channel knowledge) in channels with large coherence times. A comparison of the performances of the PDA algorithm and the likelihood ascent search (LAS) algorithm (reported in our recent work) is also presented.

STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC

In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical STBCs and the destination performs sphere decoding for the symbols of the two users. First, we identify the positions of the zeros in the R matrix arising out of the Q-R decomposition of the lattice generator such that (i) the worst case SDC (WSDC) and (ii) the average SDC (ASDC) are reduced. Then, a set of necessary and sufficient conditions on the lattice generator is provided such that the R matrix has zeros at the identified positions. Subsequently, explicit constructions of STBCs which results in the reduced ASDC are presented. The rate (in complex symbols per channel use) of the proposed designs is at most 2/N-t where N-t denotes the number of transmit antennas for each user. We also show that the class of STBCs from complex orthogonal designs (other than the Alamouti design) reduce the WSDC but not the ASDC.

A Low ML-Decoding Complexity, High Coding Gain, Full-Rate, Full-Diversity STBC for 4 x 2 MIMO System

This paper proposes a full-rate, full-diversity space-time block code(STBC) with low maximum likelihood (ML) decoding complexity and high coding gain for the 4 transmit antenna, 2 receive antenna (4 x 2) multiple-input multiple-output (MIMO) system that employs 4/16-QAM. For such a system, the best code known is the DjABBA code and recently, Biglieri, Hong and Viterbo have proposed another STBC (BHV code) for 4-QAM which has lower ML-decoding complexity than the DjABBA code but does not have full-diversity like the DjABBA code. The code proposed in this paper has the same ML-decoding complexity as the BHV code for any square M-QAM but has full-diversity for 4- and 16-QAM. Compared with the DjABBA code, the proposed code has lower ML-decoding complexity for square M-QAM constellation, higher coding gain for 4- and 16-QAM, and hence a better codeword error rate (CER) performance. Simulation results confirming this are presented.

From Bathymetry to Bioshields: A Review of Post-Tsunami Ecological Research in India and its Implications for Policy

More than half a decade has passed since the December 26th 2004 tsunami hit the Indian coast leaving a trail of ecological, economic and human destruction in its wake. We reviewed the coastal ecological research carried out in India in the light of the tsunami. In addition, we also briefly reviewed the ecological research in other tsunami affected countries in Asia namely Sri Lanka, Indonesia, Thailand and Maldives in order to provide a broader perspective of ecological research after tsunami. A basic search in ISI Web of Knowledge using keywords ``tsunami'' and ``India'' resulted in 127 peer reviewed journal articles, of which 39 articles were pertaining to ecological sciences. In comparison, Sri Lanka, Indonesia, Thailand and Maldives had, respectively, eight, four, 21 and two articles pertaining to ecology. In India, bioshields received the major share of scientific interest (14 out of 39) while only one study (each) was dedicated to corals, seagrasses, seaweeds and meiofauna, pointing to the paucity of research attention dedicated to these critical ecosystems. We noted that very few interdisciplinary studies looked at linkages between pure/applied sciences and the social sciences in India. In addition, there appears to be little correlation between the limited research that was done and its influence on policy in India. This review points to gap areas in ecological research in India and highlights the lessons learnt from research in other tsunami-affected countries. It also provides guidance on the links between science and policy that are required for effective coastal zone management.

A Low-Complexity Algorithm for Intrusion Detection in a PIR-Based Wireless Sensor Network

We present a low-complexity algorithm for intrusion detection in the presence of clutter arising from wind-blown vegetation, using Passive Infra-Red (PIR) sensors in a Wireless Sensor Network (WSN). The algorithm is based on a combination of Haar Transform (HT) and Support-Vector-Machine (SVM) based training and was field tested in a network setting comprising of 15-20 sensing nodes. Also contained in this paper is a closed-form expression for the signal generated by an intruder moving at a constant velocity. It is shown how this expression can be exploited to determine the direction of motion information and the velocity of the intruder from the signals of three well-positioned sensors.

Language universals and linguistic complexity : Three case studies in core argument marking

In this dissertation I study language complexity from a typological perspective. Since the structuralist era, it has been assumed that local complexity differences in languages are balanced out in cross-linguistic comparisons and that complexity is not affected by the geopolitical or sociocultural aspects of the speech community. However, these assumptions have seldom been studied systematically from a typological point of view. My objective is to define complexity so that it is possible to compare it across languages and to approach its variation with the methods of quantitative typology. My main empirical research questions are: i) does language complexity vary in any systematic way in local domains, and ii) can language complexity be affected by the geographical or social environment? These questions are studied in three articles, whose findings are summarized in the introduction to the dissertation. In order to enable cross-language comparison, I measure complexity as the description length of the regularities in an entity; I separate it from difficulty, focus on local instead of global complexity, and break it up into different types. This approach helps avoid the problems that plagued earlier metrics of language complexity. My approach to grammar is functional-typological in nature, and the theoretical framework is basic linguistic theory. I delimit the empirical research functionally to the marking of core arguments (the basic participants in the sentence). I assess the distributions of complexity in this domain with multifactorial statistical methods and use different sampling strategies, implementing, for instance, the Greenbergian view of universals as diachronic laws of type preference. My data come from large and balanced samples (up to approximately 850 languages), drawn mainly from reference grammars. The results suggest that various significant trends occur in the marking of core arguments in regard to complexity and that complexity in this domain correlates with population size. These results provide evidence that linguistic patterns interact among themselves in terms of complexity, that language structure adapts to the social environment, and that there may be cognitive mechanisms that limit complexity locally. My approach to complexity and language universals can therefore be successfully applied to empirical data and may serve as a model for further research in these areas.

Application of an ecological simulation model to Lake Päijänne

Tiivistelmä: Simulointimallin soveltaminen Pohjois-Päijänteellä

Sedimentary zooplankton remains as indicators of lake ecological quality and trophic structure

To protect and restore lake ecosystems under threats posed by the increasing human population, information on their ecological quality is needed. Lake sediments provide a data rich archive that allows identification of various biological components present prior to anthropogenic alterations as well as a constant record of changes. By providing a longer dimension of time than any ongoing monitoring programme, palaeolimnological methods can help in understanding natural variability and long-term ecological changes in lakes. As zooplankton have a central role in the lake food web, their remains can potentially provide versatile information on past trophic structure. However, various taphonomic processes operating in the lakes still raise questions concerning how subfossil assemblages reflect living communities. This thesis work aimed at improving the use of sedimentary zooplankton remains in the reconstruction of past zooplankton communities and the trophic structure in lakes. To quantify interspecific differences in the accumulation of remains, the subfossils of nine pelagic zooplankton taxa in annually laminated sediments were compared with monitoring results for live zooplankton in Lake Vesijärvi. This lake has a known history of eutrophication and recovery, which resulted from reduced external loading and effective fishing of plankti-benthivorous fish. The response of zooplankton assemblages to these known changes was resolved using annually laminated sediments. The generality of the responses observed in Lake Vesijärvi were further tested with a set of 31 lakes in Southern Finland, relating subfossils in surface sediments to contemporary water quality and fish density, as well as to lake morphometry. The results demonstrated differential preservation and retention of cladoceran species in the sediment. Daphnia, Diaphanosoma and Ceriodaphnia were clearly underrepresented in the sediment samples in comparison to well-preserved Bosmina species, Chydorus, Limnosida and Leptodora. For well-preserved species, the annual net accumulation rate was similar to or above the expected values, reflecting effective sediment focusing and accumulation in the deepest part of the lake. The decreased fish density and improved water quality led to subtle changes in zooplankton community composition. The abundance of Diaphanosoma and Limnosida increased after the reduction in fish density, while Ceriodaphnia and rotifers decreased. The most sensitive indicator of fish density was the mean size of Daphnia ephippia and Bosmina (E.) crassicornis ephippia and carapaces. The concentration of plant-associated species increased, reflecting expanding littoral vegetation along with increasing transparency. Several of the patterns observed in Lake Vesijärvi could also be found within the set of 31 lakes. According to this thesis work, the most useful cladoceran-based indices for nutrient status and planktivorous fish density in Finnish lakes were the relative abundances of certain pelagic taxa, and the mean size of Bosmina spp. carapaces, especially those of Bosmina (E.) cf. coregoni. The abundance of plant-associated species reflected the potential area for aquatic plants. Lake morphometry and sediment organic content, however, explained a relatively high proportion of the variance in the species data, and more studies are needed to quantify lake-specific differences in the accumulation and preservation of remains. Commonly occurring multicollinearity between environmental variables obstructs the cladoceran-based reconstruction of single environmental variables. As taphonomic factors and several direct and indirect structuring forces in lake ecosystems simultaneously affect zooplankton, the subfossil assemblages should be studied in a holistic way before making final conclusions about the trophic structure and the change in lake ecological quality.

The potential of microbial ecological indicators to guide ecosophisticated management of hydrocarbon-contaminated soils

Soil is an unrenewable natural resource under increasing anthropogenic pressure. One of the main threats to soils, compromising their ability to provide us with the goods and ecosystem services we expect, is pollution. Oil hydrocarbons are the most common soil contaminants, and they disturb not just the biota but also the physicochemical properties of soils. Indigenous soil micro-organisms respond rapidly to changes in the soil ecosystem, and are chronically in direct contact with the hydrophobic pollutants on the soil surfaces. Soil microbial variables could thus serve as an intrinsically relevant indicator of soil quality, to be used in the ecological risk assessment of contaminated and remediated soils. Two contrasting studies were designed to investigate soil microbial ecological responses to hydrocarbons, together with parallel changes in soil physicochemical and ecotoxicological properties. The aim was to identify quantitative or qualitative microbiological variables that would be practicable and broadly applicable for the assessment of the quality and restoration of oil-polluted soil. Soil bacteria commonly react on hydrocarbons as a beneficial substrate, which lead to a positive response in the classical microbiological soil quality indicators; negative impacts were accurately reflected only after severe contamination. Hydrocarbon contaminants become less bioavailable due to weathering processes, and their potentially toxic effects decrease faster than the total concentration. Indigenous hydrocarbon degrader bacteria, naturally present in any terrestrial environment, use specific mechanisms to improve access to the hydrocarbon molecules adsorbed on soil surfaces. Thus when contaminants are unavailable even to the specialised degraders, they should pose no hazard to other biota either. Change in the ratio of hydrocarbon degrader numbers to total microbes was detected to predictably indicate pollutant effects and bioavailability. Also bacterial diversity, a qualitative community characteristic, decreased as a response to hydrocarbons. Stabilisation of community evenness, and community structure that reflected clean reference soil, indicated community recovery. If long-term temporal monitoring is difficult and appropriate clean reference soil unavailable, such comparison could possibly be based on DNA-based community analysis, reflecting past+present, and RNA-based community analysis, showing exclusively present conditions. Microbial ecological indicators cannot replace chemical oil analyses, but they are theoretically relevant and operationally practicable additional tools for ecological risk assessment. As such, they can guide ecologically informed and sustainable ecosophisticated management of oil-contaminated lands.

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.

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

Low-Complexity Detection and Performance in Multi-Gigabit High Spectral Efficiency Wireless Systems

Recently, we reported a low-complexity likelihood ascent search (LAS) detection algorithm for large MIMO systems with several tens of antennas that can achieve high spectral efficiencies of the order of tens to hundreds of bps/Hz. Through simulations, we showed that this algorithm achieves increasingly near SISO AWGN performance for increasing number of antennas in Lid. Rayleigh fading. However, no bit error performance analysis of the algorithm was reported. In this paper, we extend our work on this low-complexity large MIMO detector in two directions: i) We report an asymptotic bit error probability analysis of the LAS algorithm in the large system limit, where N-t, N-r -> infinity keeping N-t = N-r, where N-t and N-r are the number of transmit and receive antennas, respectively. Specifically, we prove that the error performance of the LAS detector for V-BLAST with 4-QAM in i.i.d. Rayleigh fading converges to that of the maximum-likelihood (ML) detector as N-t, N-r -> infinity keeping N-t = N-r ii) We present simulated BER and nearness to capacity results for V-BLAST as well as high-rate non-orthogonal STBC from Division Algebras (DA), in a more realistic spatially correlated MIMO channel model. Our simulation results show that a) at an uncoded BER of 10(-3), the performance of the LAS detector in decoding 16 x 16 STBC from DA with N-t = = 16 and 16-QAM degrades in spatially correlated fading by about 7 dB compared to that in i.i.d. fading, and 19) with a rate-3/4 outer turbo code and 48 bps/Hz spectral efficiency, the performance degrades by about 6 dB at a coded BER of 10(-4). Our results further show that providing asymmetry in number of antennas such that N-r > N-t keeping the total receiver array length same as that for N-r = N-t, the detector is able to pick up the extra receive diversity thereby significantly improving the BER performance.

Rudiments of complexity theory for scientists and engineers

Complexity theory is an important and growing area in computer science that has caught the imagination of many researchers in mathematics, physics and biology. In order to reach out to a large section of scientists and engineers, the paper introduces elementary concepts in complexity theory in a informal manner, motivating the reader with many examples.