Shell preservation of Limacina inflata in surface sediments of the Central and South Atlantic

Over 300 surface sediment samples from the Central and South Atlantic Ocean and the Caribbean Sea were investigated for the preservation state of the aragonitic test of Limacina inflata. Results are displayed in spatial distribution maps and are plotted against cross-sections of vertical water mass configurations, illustrating the relationship between preservation state, saturation state of the overlying waters, and overall water mass distribution. The microscopic investigation of L. inflata (adults) yielded the Limacina dissolution index (LDX), and revealed three regional dissolution patterns. In the western Atlantic Ocean, sedimentary preservation states correspond to saturation states in the overlying waters. Poor preservation is found within intermediate water masses of southern origin (i.e. Antarctic intermediate water (AAIW), upper circumpolar water (UCDW)), which are distinctly aragonite-corrosive, whereas good preservation is observed within the surface waters above and within the upper North Atlantic deep water (UNADW) beneath the AAIW. In the eastern Atlantic Ocean, in particular along the African continental margin, the LDX fails in most cases (i.e. less than 10 tests of L. inflata per sample were found). This is most probably due to extensive "metabolic" aragonite dissolution at the sediment-water interface combined with a reduced abundance of L. inflata in the surface waters. In the Caribbean Sea, a more complex preservation pattern is observed because of the interaction between different water masses, which invade the Caribbean basins through several channels, and varying input of bank-derived fine aragonite and magnesian calcite material. The solubility of aragonite increases with increasing pressure, but aragonite dissolution in the sediments does not simply increase with water depth. Worse preservation is found in intermediate water depths following an S-shaped curve. As a result, two aragonite lysoclines are observed, one above the other. In four depth transects, we show that the western Atlantic and Caribbean LDX records resemble surficial calcium carbonate data and delta13C and carbonate ion concentration profiles in the water column. Moreover, preservation of L. inflata within AAIW and UCDW improves significantly to the north, whereas carbonate corrosiveness diminishes due to increased mixing of AAIW and UNADW. The close relationship between LDX values and aragonite contents in the sediments shows much promise for the quantification of the aragonite loss under the influence of different water masses. LDX failure and uncertainties may be attributed to (1) aragonite dissolution due to bottom water corrosiveness, (2) aragonite dissolution due to additional CO2 release into the bottom water by the degradation of organic matter based on an enhanced supply of organic matter into the sediment, (3) variations in the distribution of L. inflata and hence a lack of supply into the sediment, (4) dilution of the sediments and hence a lack of tests of L. inflata, or (5) redeposition of sediment particles.

Calcium carbonate global LGM Burial rate data

Global databases of calcium carbonate concentrations and mass accumulation rates in Holocene and last glacial maximum sediments were used to estimate the deep-sea sedimentary calcium carbonate burial rate during these two time intervals. Sparse calcite mass accumulation rate data were extrapolated across regions of varying calcium carbonate concentration using a gridded map of calcium carbonate concentrations and the assumption that accumulation of noncarbonate material is uncorrelated with calcite concentration within some geographical region. Mean noncarbonate accumulation rates were estimated within each of nine regions, determined by the distribution and nature of the accumulation rate data. For core-top sediments the regions of reasonable data coverage encompass 67% of the high-calcite (>75%) sediments globally, and within these regions we estimate an accumulation rate of 55.9 ± 3.6 x 10**11 mol/yr. The same regions cover 48% of glacial high-CaCO3 sediments (the smaller fraction is due to a shift of calcite deposition to the poorly sampled South Pacific) and total 44.1 ± 6.0 x 10**11 mol/yr. Projecting both estimates to 100 % coverage yields accumulation estimates of 8.3 x 10**12 mol/yr today and 9.2 x 10**12 mol/yr during glacial time. This is little better than a guess given the incomplete data coverage, but it suggests that glacial deep sea calcite burial rate was probably not considerably faster than today in spite of a presumed decrease in shallow water burial during glacial time.

A Bias in ML Estimates of Branch Lengths in the Presence of Multiple Signals

Sequence data often have competing signals that are detected by network programs or Lento plots. Such data can be formed by generating sequences on more than one tree, and combining the results, a mixture model. We report that with such mixture models, the estimates of edge (branch) lengths from maximum likelihood (ML) methods that assume a single tree are biased. Based on the observed number of competing signals in real data, such a bias of ML is expected to occur frequently. Because network methods can recover competing signals more accurately, there is a need for ML methods allowing a network. A fundamental problem is that mixture models can have more parameters than can be recovered from the data, so that some mixtures are not, in principle, identifiable. We recommend that network programs be incorporated into best practice analysis, along with ML and Bayesian trees.

Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of all the channels and the relays have only the phase information of the source-to-relay channels. In this paper, first, a new set of necessary and sufficient conditions for a space-time block code (STBC) to be single-symbol decodable (SSD) for colocated multiple antenna communication is obtained. Then, this is extended to a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for. a PCRC. Using this, several SSD DSTBCs for PCRC are identified. It is proved that even if a SSD STBC for a co-located MIMO channel does not satisfy the additional conditions for the code to be SSD for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property for PCRC. Finally, it is shown that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from (2)/(N) when the relays do not have CSI to(1)/(2), which is independent of N.

Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 x 2 and 4 x 2 MIMO Systems

This paper deals with low maximum-likelihood (ML)-decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 x 2) and the 4 transmit antenna, 2 receive antenna (4 x 2) MIMO systems. Presently, the best known STBC for the 2 2 system is the Golden code and that for the 4 x 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 x 2 system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 x 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of for square QAM of size. In this paper, a scheme that reduces its ML-decoding complexity to M-2 root M is presented.

A Low-Complexity Near-ML Performance Achieving Algorithm for Large MIMO Detection

In this paper, we present a low-complexity, near maximum-likelihood (ML) performance achieving detector for large MIMO systems having tens of transmit and receive antennas. Such large MIMO systems are of interest because of the high spectral efficiencies possible in such systems. The proposed detection algorithm, termed as multistage likelihood-ascent search (M-LAS) algorithm, is rooted in Hopfield neural networks, and is shown to possess excellent performance as well as complexity attributes. In terms of performance, in a 64 x 64 V-BLAST system with 4-QAM, the proposed algorithm achieves an uncoded BER of 10(-3) at an SNR of just about 1 dB away from AWGN-only SISO performance given by Q(root SNR). In terms of coded BER, with a rate-3/4 turbo code at a spectral efficiency of 96 bps/Hz the algorithm performs close to within about 4.5 dB from theoretical capacity, which is remarkable in terms of both high spectral efficiency as well as nearness to theoretical capacity. Our simulation results show that the above performance is achieved with a complexity of just O(NtNt) per symbol, where N-t and N-tau denote the number of transmit and receive antennas.

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.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Single-symbol maximum likelihood (ML) decodable distributed orthogonal space-time block codes (DOST- BCs) have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of distributed space-time block codes (DSTBCs) called semi-orthogonal precoded distributed single-symbol decodable space-time block codes (Semi-SSD-PDSTBCs) wherein, the source performs preceding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of semi-SSD- PDSTBCs is proved. It is shown that the DOSTBCs are a special case of semi-SSD-PDSTBCs. A subset of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi- SSD-PDSTBCs is presented when the number of relays K ges 4 and the constructed codes are shown to have higher rates than that of DOSTBCs.