3D Finite Volume Scheme for Czochralski Single Crystal Growth

Czochralski (Cz) technique, which is used for growing single crystals, has dominated the production of single crystals for electronic applications. The Cz growth process involves multiple phases, moving interface and three-dimensional behavior. Much has been done to study these phenomena by means of numerical methods as well as experimental observations. A three-dimensional curvilinear finite volume based algorithm has been developed to model the Cz process. A body-fitted transformation based approach is adopted in conjunction with a multizone adaptive grid generation (MAGG) technique to accurately handle the three-dimensional problems of phase-change in irregular geometries with free and moving surfaces. The multizone adaptive model is used to perform a three-dimensional simulation of the Cz growth of silicon single crystals.Since the phase change interface are irregular in shape and they move in response to the solution, accurate treatment of these interfaces is important from numerical accuracy point of view. The multizone adaptive grid generation (MAGG) is the appropriate scheme for this purpose. Another challenge encountered is the moving and periodic boundary conditions, which is essential to the numerical solution of the governing equations. Special treatments are implemented to impose the periodic boundary condition in a particular direction and to determine the internal boundary position and shape varying with the combination of ambient physicochemical transport process and interfacial dynamics. As indicated above that the applications and processes characterized by multi-phase, moving interfaces and irregular shape render the associated physical phenomena three-dimensional and unsteady. Therefore a generalized 3D model rather than a 2D simulation, in which the governing equations are solved in a general non-orthogonal coordinate system, is constructed to describe and capture the features of the growth process. All this has been implemented and validated by using it to model the low pressure Cz growth of silicon. Accuracy of this scheme is demonstrated by agreement of simulation data with available experimental data. Using the quasi-steady state approximation, it is shown that the flow and temperature fields in the melt under certain operating conditions become asymmetric and unsteady even in the absence of extrinsic sources of asymmetry. Asymmetry in the flow and temperature fields, caused by high shear initiated phenomena, affects the interface shape in the azimuthal direction thus results in the thermal stress distribution in the vicinity, which has serious implications from crystal quality point of view.

Numerical simulation of viscous three-dimensional flow over aerospace vehicles using Euler/boundary-layer zonal approach

This paper presents a viscous three-dimensional simulations coupling Euler and boundary layer codes for calculating flows over arbitrary surfaces. The governing equations are written in a general non orthogonal coordinate system. The Levy-Lees transformation generalized to three-dimensional flows is utilized. The inviscid properties are obtained from the Euler equations using the Beam and Warming implicit approximate factorization scheme. The resulting equations are discretized and approximated by a two-point fmitedifference numerical scheme. The code developed is validated and applied to the simulation of the flowfield over aerospace vehicle configurations. The results present good correlation with the available data.

Non-parametric nonlinear system identification: A data-driven orthogonal basis function approach

In this paper, a data driven orthogonal basis function approach is proposed for non-parametric FIR nonlinear system identification. The basis functions are not fixed a priori and match the structure of the unknown system automatically. This eliminates the problem of blindly choosing the basis functions without a priori structural information. Further, based on the proposed basis functions, approaches are proposed for model order determination and regressor selection along with their theoretical justifications. © 2008 IEEE.

Belief Propagation Based Decoding of Large Non-Orthogonal STBCs

In this paper,we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions. The proposed approachinvolves message passing on Markov random field (MRF) representation of the STBC MIMO system. Adoption of BP approach to decode non-orthogonal STBCs of large dimensions has not been reported so far. Our simulation results show that the proposed BP-based decoding achieves increasingly closer to SISO AWGN performance for increased number of dimensions. In addition, it also achieves near-capacity turbo coded BER performance; for e.g., with BP decoding of 24 x 24 STBC from CDA using BPSK (i.e.,n576 real dimensions) and rate-1/2 turbo code (i.e., 12 bps/Hz spectral efficiency), coded BER performance close to within just about 2.5 dB from the theoretical MIMO capacity is achieved.

Space-time block coding for four transmit antennas over time-selective fading channels: orthogonal or non-orthogonal design?

The paper deals with an issue in space time block coding (STBC) design. It considers whether, over a time-selective channel, orthogonal STBC (O-STBC) or non-orthogonal STBC (NO-STBC) performs better. It is shown that, under time-selectiveness, once vehicle speed has risen above a certain value, NO-STBC always outperforms O-STBC across the whole SNR range. Also, considering that all existing NO-STBC schemes have been investigated under quasi-static channels only, a new simple receiver is derived for the NO-STBC system under time-selective channels.

On the design and measurement of a novel non-orthogonal multi-beam network for triangular arrays of three radiating elements

An innovative dissipative multi-beam network for triangular arrays of three radiating elements is proposed. This novel network provides three orthogonal beams in θ0 elevation angle and a fourth one in the broadside steering direction. The network is composed of 90º hybrid couplers and fixed phase shifters. In this paper, a relation between network components, radiating element distance and beam steering directions will be shown. Application of the proposed dissipative network to the triangular cells of three radiating elements that integrate the intelligent antenna GEODA will be exhibited. This system works at 1.7 GHz, it has a 60º single radiating element beamwidth and a distance between array elements of 0.57 λ. Both beam patterns, theoretical and simulated, obtained with the network will be depicted. Moreover, the whole system, dissipative network built with GEODA cell array, has been measured in the anechoic chamber of the Radiation Group of Technical University of Madrid, demonstrating expected performance.

Random vibration of a second order non-linear elastic system

A method is presented for obtaining, approximately, the response covariance and probability distribution of a non-linear oscillator under a Gaussian excitation. The method has similarities with the hierarchy closure and the equivalent linearization approaches, but is different. A Gaussianization technique is used to arrive at the output autocorrelation and the input-output cross-correlation. This along with an energy equivalence criterion is used to estimate the response distribution function. The method is applicable in both the transient and steady state response analysis under either stationary or non-stationary excitations. Good comparison has been observed between the predicted and the exact steady state probability distribution of a Duffing oscillator under a white noise input.

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.

Undamped Cooper pairs in a non-degenerate electron system

Following the reaction matrix technique and the Kanamori approximation. a condition is obtained for the occurence of undamped Cooper pairs in a non-degenerate electron system. Its relevance to induced superconductivity in systems with artificially populated (optically pumped) bands is pointed out.

A non-orthogonal distributed space-time coded protocol - Part 1:Signal model and design criteria

In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.

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.

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.