210 resultados para k-Error linear complexity
Resumo:
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.
Resumo:
A modified linear prediction (MLP) method is proposed in which the reference sensor is optimally located on the extended line of the array. The criterion of optimality is the minimization of the prediction error power, where the prediction error is defined as the difference between the reference sensor and the weighted array outputs. It is shown that the L2-norm of the least-squares array weights attains a minimum value for the optimum spacing of the reference sensor, subject to some soft constraint on signal-to-noise ratio (SNR). How this minimum norm property can be used for finding the optimum spacing of the reference sensor is described. The performance of the MLP method is studied and compared with that of the linear prediction (LP) method using resolution, detection bias, and variance as the performance measures. The study reveals that the MLP method performs much better than the LP technique.
Resumo:
A posteriori error estimation and adaptive refinement technique for fracture analysis of 2-D/3-D crack problems is the state-of-the-art. The objective of the present paper is to propose a new a posteriori error estimator based on strain energy release rate (SERR) or stress intensity factor (SIF) at the crack tip region and to use this along with the stress based error estimator available in the literature for the region away from the crack tip. The proposed a posteriori error estimator is called the K-S error estimator. Further, an adaptive mesh refinement (h-) strategy which can be used with K-S error estimator has been proposed for fracture analysis of 2-D crack problems. The performance of the proposed a posteriori error estimator and the h-adaptive refinement strategy have been demonstrated by employing the 4-noded, 8-noded and 9-noded plane stress finite elements. The proposed error estimator together with the h-adaptive refinement strategy will facilitate automation of fracture analysis process to provide reliable solutions.
Resumo:
In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors are separated by a certain interval. We also give some bounds on the field size and the number of errors that can get corrected in a certain interval. Compared to previous network error correction schemes, using convolutional codes is seen to have advantages in field size and decoding technique. Some examples are discussed which illustrate the several possible situations that arise in this context.
Resumo:
In this paper, we propose a training-based channel estimation scheme for large non-orthogonal space-time block coded (STBC) MIMO systems.The proposed scheme employs a block transmission strategy where an N-t x N-t pilot matrix is sent (for training purposes) followed by several N-t x N-t square data STBC matrices, where Nt is the number of transmit antennas. At the receiver, we iterate between channel estimation (using an MMSE estimator) and detection (using a low-complexity likelihood ascent search (LAS) detector) till convergence or for a fixed number of iterations. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed scheme at low complexities. The fact that we could show such good results for large STBCs (e.g., 16 x 16 STBC from cyclic division algebras) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot-based channel estimation and turbo coding) establishes the effectiveness of the proposed scheme.
Resumo:
The chemical-shift of the X-ray K-absorption edge of Co was studied in a large number of compounds, complexes (spinels) and minerals of Co in its different oxidation states having widely different crystal structures and containing different types of bonding and various types of ligands, and were reported collectively, for the first time, in a single paper. A quadratic relationship was established on the basis of least-squares regression analysis to hold between the chemical-shift and the effective charge on the absorbing atom, but the dominance of the linear term was shown. This relation was utilized in evaluating the charge on the Co-ion in a number of minerals. The effect on chemical-shift of oxidation states of the absorbing atom, of the bond length, crystal structure and higher shell atoms of the molecule, and of electronegativity, atomic number and ionic radius of the ligand was discussed.
Resumo:
Some theorems derived recently by the authors on the stability of multidimensional linear time varying systems are reported in this paper. To begin with, criteria based on Liapunov�s direct method are stated. These are followed by conditions on the asymptotic behaviour and boundedness of solutions. Finally,L 2 andL ? stabilities of these systems are discussed. In conclusion, mention is made of some of the problems in aerospace engineering to which these theorems have been applied.
Resumo:
An algorithm that uses integer arithmetic is suggested. It transforms anm ×n matrix to a diagonal form (of the structure of Smith Normal Form). Then it computes a reflexive generalized inverse of the matrix exactly and hence solves a system of linear equations error-free.
Resumo:
An alternative pulse scheme which simplifies and improves the recently proposed P.E.COSY experiment is suggested for the retention of connected or unconnected transitions in a coupled spin system. An important feature of the proposed pulse scheme is the improved phase characteristics of the diagonal peaks. A comparison of various experiments designed for this purpose, namely COSY-45, E.COSY, P.E.COSY and the present scheme (A.E.COSY), is also presented. The suppression of unconnected transitions and the measurement of scalar coupling constants and their relative signs are illustrated from A.E.COSY spectra of 2,3-dibromopropionic acid and 2-(2-thienyl)pyridine.
Resumo:
Five different shaped weirs were designed and pertinent data for their use are given. One of these weir shapes had the least “sharp edge” at the junction of the base weir and “complementary weir.” Two other types of weirs had equal slopes at the junction of the base weir and complementary weir. Another shape, for which neither the indication accuracy was constant nor the slope was equal at the junction of the base weir and complementary weir, was also tested. The results of the four weir shapes hydraulically tested give consistent values for the coefficient of discharge varying between 0.625 to 0.631. The indication accuracies of all the previously designed linear proportional weirs (includig Sutro weir) are neither constant nor unity, as is believed.
Resumo:
To understand the molecular basis of gene targeting, we have studied interactions of nucleoprotein filaments comprised of single-stranded DNA and RecA protein with chromatin templates reconstituted from linear duplex DNA and histones. We observed that for the chromatin templates with histone/DNA mass ratios of 0.8 and 1.6, the efficiency of homologous pairing was indistinguishable from that of naked duplex DNA but strand exchange was repressed. In contrast, the chromatin templates with a histone/DNA mass ratio of 9.0 supported neither homologous pairing nor strand exchange. The addition of histone H1, in stoichiometric amounts, to chromatin templates quells homologous pairing. The pairing of chromatin templates with nucleoprotein filaments of RecA protein-single-stranded DNA proceeded without the production of detectable networks of DNA, suggesting that coaggregates are unlikely to be the intermediates in homologous pairing. The application of these observations to strategies for gene targeting and their implications for models of genetic recombination are discussed.
Resumo:
Reaction of formamide with Ni(NO3)(2)center dot 6H(2)O under hydrothermal condition in a mixture of MeOH/H2O forms a two-dimensional formate bridged sheet Ni(HCOO)(2)(MeOH)(2) (1). X-ray structure analysis reveals the conversion of formamide to formate which acts as a bridging ligand in complex 1 where the axial sites of Ni(II) are occupied by methanol used as a solvent. An analogous reaction in presence of 4,4'-bipyridyl (4,4'-bipy) yielded a three-dimensional structure Ni(HCOO)(2)(4,4'-bpy) (2). DC magnetic measurements as a function of temperature and field established the presence of spontaneous magnetization with T-c (Curie temperature) = 17 and 20.8 K in 1 and 2, respectively, which can be attributed due to spin-canting. DFT calculations were performed to corroborate the magnetic results of 1 and 2. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.
Resumo:
To understand the effect of molecular weight and branching on the heats of vaporization (AH,) and their flow behavior, AH, and viscosity (7) were measured at different temperatures in the high molecular weight ester series: linear flexible di-n-alkyl sebacates and compact branched triglycerides with molecular weight ranging from 300 to 900. AHv" values (AHv corrected to 298 K) have been obtained with experimental AH, and also computed according to the group additivity method; a smaller-CH,- group value of 3.8 kJ mol-' compared to the normal value of 5.0 kJ mol-' is found to give good agreement with the experimental data (within 2-5% error). Both ester series have the same AH," irrespective of their molecular features, namely,shape, flexibility, and polarity, suggesting the coiling of the molecules during vaporization. The segmental motion of these ester series during their flow and its dependence on their molecular features unlike AH,' are demonstrated by the correlation of the enthalpy of activation for viscous flow (AH*) and the ratio AE,/AH* = n (AE, is the energy of vaporization) with molecular weight.
Resumo:
A simple and efficient algorithm for the bandwidth reduction of sparse symmetric matrices is proposed. It involves column-row permutations and is well-suited to map onto the linear array topology of the SIMD architectures. The efficiency of the algorithm is compared with the other existing algorithms. The interconnectivity and the memory requirement of the linear array are discussed and the complexity of its layout area is derived. The parallel version of the algorithm mapped onto the linear array is then introduced and is explained with the help of an example. The optimality of the parallel algorithm is proved by deriving the time complexities of the algorithm on a single processor and the linear array.