Frequency domain turbo equalization for MIMO-CPSC systems with large delay spreads

In this paper, we consider low-complexity turbo equalization for multiple-input multiple-output (MIMO) cyclic prefixed single carrier (CPSC) systems in MIMO inter-symbol interference (ISI) channels characterized by large delay spreads. A low-complexity graph based equalization is carried out in the frequency domain. Because of the reduction in correlation among the noise samples that happens for large frame sizes and delay spreads in frequency domain processing, improved performance compared to time domain processing is shown to be achieved. This improved performance is attractive for equalization in severely delay spread ISI channels like ultrawideband channels and underwater acoustic channels.

Delay optimized zero-forcing channel shortening algorithm for wireless communication

In Orthogonal Frequency Division Multiplexing and Discrete Multitone transceivers, a guard interval called Cyclic Prefix (CP) is inserted to avoid inter-symbol interference. The length of the CP is usually greater than the impulse response of the channel resulting in a loss of useful data carriers. In order to avoid long CP, a time domain equalizer is used to shorten the channel. In this paper, we propose a method to include a delay in the zero-forcing equalizer and obtain an optimal value of the delay, based on the location of zeros of the channel. The performance of the algorithms is studied using numerical simulations.

Comparative study of different nonconserving time integrators for wave propagation in hyperelastic waveguides

This paper addresses the formulation and numerical efficiency of various numerical models of different nonconserving time integrators for studying wave propagation in nonlinear hyperelastic waveguides. The study includes different nonlinear finite element formulations based on standard Galerkin finite element model, time domain spectral finite element model, Taylor-Galerkin finite element model, generalized Galerkin finite element model and frequency domain spectral finite element model. A comparative study on the computational efficiency of these different models is made using a hyperelastic rod model, and the optimal computational scheme is identified. The identified scheme is then used to study the propagation of transverse and longitudinal waves in a Timoshenko beam with Murnaghan material nonlinearity.

Time resolved terahertz spectroscopy of low frequency electronic resonances and optical pump-induced terahertz photoconductivity in reduced graphene oxide membrane

Towards ultrafast optoelectronic applications of single and a few layer reduced graphene oxide (RGO), we study time domain terahertz spectroscopy and optical pump induced changes in terahertz conductivity of self-supported RGO membrane in the spectral window of 0.5-3.5 THz. The real and imaginary parts of conductivity spectra clearly reveal low frequency resonances, attributed to the energy gaps due to the van Hove singularities in the density of states flanking the Dirac points arising due to the relative rotation of the graphene layers. Further, optical pump induced terahertz conductivity is positive, pointing to the dominance of intraband scattering processes. The relaxation dynamics of the photo-excited carriers consists of three cooling pathways: the faster (similar to 450 fs) one due to optical phonon emission followed by disorder mediated large momentum and large energy acoustic phonon emission with a time constant of a few ps (called the super-collision mechanism) and a very large time (similar to 100 ps) arising from the deep trap states. The frequency dependence of the dynamic conductivity at different delay times is analyzed in term of Drude-Smith model. (C) 2014 Published by Elsevier Ltd.

State Transition Based Embedding in Cepstrum Domain for Audio Copyright Protection

In this paper, we propose a new state transition based embedding (STBE) technique for audio watermarking with high fidelity. Furthermore, we propose a new correlation based encoding (CBE) scheme for binary logo image in order to enhance the payload capacity. The result of CBE is also compared with standard run-length encoding (RLE) compression and Huffman schemes. Most of the watermarking algorithms are based on modulating selected transform domain feature of an audio segment in order to embed given watermark bit. In the proposed STBE method instead of modulating feature of each and every segment to embed data, our aim is to retain the default value of this feature for most of the segments. Thus, a high quality of watermarked audio is maintained. Here, the difference between the mean values (Mdiff) of insignificant complex cepstrum transform (CCT) coefficients of down-sampled subsets is selected as a robust feature for embedding. Mdiff values of the frames are changed only when certain conditions are met. Hence, almost 50% of the times, segments are not changed and still STBE can convey watermark information at receiver side. STBE also exhibits a partial restoration feature by which the watermarked audio can be restored partially after extraction of the watermark at detector side. The psychoacoustic model analysis showed that the noise-masking ratio (NMR) of our system is less than -10dB. As amplitude scaling in time domain does not affect selected insignificant CCT coefficients, strong invariance towards amplitude scaling attacks is also proved theoretically. Experimental results reveal that the proposed watermarking scheme maintains high audio quality and are simultaneously robust to general attacks like MP3 compression, amplitude scaling, additive noise, re-quantization, etc.

Time-Instant Sampling Based Encoding of Time-Varying Acoustic Spectrum

The inner ear has been shown to characterize an acoustic stimuli by transducing fluid motion in the inner ear to mechanical bending of stereocilia on the inner hair cells (IHCs). The excitation motion/energy transferred to an IHC is dependent on the frequency spectrum of the acoustic stimuli, and the spatial location of the IHC along the length of the basilar membrane (BM). Subsequently, the afferent auditory nerve fiber (ANF) bundle samples the encoded waveform in the IHCs by synapsing with them. In this work we focus on sampling of information by afferent ANFs from the IHCs, and show computationally that sampling at specific time instants is sufficient for decoding of time-varying acoustic spectrum embedded in the acoustic stimuli. The approach is based on sampling the signal at its zero-crossings and higher-order derivative zero-crossings. We show results of the approach on time-varying acoustic spectrum estimation from cricket call signal recording. The framework gives a time-domain and non-spatial processing perspective to auditory signal processing. The approach works on the full band signal, and is devoid of modeling any bandpass filtering mimicking the BM action. Instead, we motivate the approach from the perspective of event-triggered sampling by afferent ANFs on the stimuli encoded in the IHCs. Though the approach gives acoustic spectrum estimation but it is shallow on its complete understanding for plausible bio-mechanical replication with current mammalian auditory mechanics insights.

Design, specification, and synthesis of aircraft electric power systems control logic

Cyber-physical systems integrate computation, networking, and physical processes. Substantial research challenges exist in the design and verification of such large-scale, distributed sensing, ac- tuation, and control systems. Rapidly improving technology and recent advances in control theory, networked systems, and computer science give us the opportunity to drastically improve our approach to integrated flow of information and cooperative behavior. Current systems rely on text-based spec- ifications and manual design. Using new technology advances, we can create easier, more efficient, and cheaper ways of developing these control systems. This thesis will focus on design considera- tions for system topologies, ways to formally and automatically specify requirements, and methods to synthesize reactive control protocols, all within the context of an aircraft electric power system as a representative application area.

This thesis consists of three complementary parts: synthesis, specification, and design. The first section focuses on the synthesis of central and distributed reactive controllers for an aircraft elec- tric power system. This approach incorporates methodologies from computer science and control. The resulting controllers are correct by construction with respect to system requirements, which are formulated using the specification language of linear temporal logic (LTL). The second section addresses how to formally specify requirements and introduces a domain-specific language for electric power systems. A software tool automatically converts high-level requirements into LTL and synthesizes a controller.

The final sections focus on design space exploration. A design methodology is proposed that uses mixed-integer linear programming to obtain candidate topologies, which are then used to synthesize controllers. The discrete-time control logic is then verified in real-time by two methods: hardware and simulation. Finally, the problem of partial observability and dynamic state estimation is ex- plored. Given a set placement of sensors on an electric power system, measurements from these sensors can be used in conjunction with control logic to infer the state of the system.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Decentralised minimal-time dynamic consensus

This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises a minimal number of local observations of a randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

A coupled hydro-mechanical analysis for prediction of hydraulic fracture propagation in saturated porous media using EFG mesh-less method

The details of the Element Free Galerkin (EFG) method are presented with the method being applied to a study on hydraulic fracturing initiation and propagation process in a saturated porous medium using coupled hydro-mechanical numerical modelling. In this EFG method, interpolation (approximation) is based on nodes without using elements and hence an arbitrary discrete fracture path can be modelled.The numerical approach is based upon solving two governing partial differential equations of equilibrium and continuity of pore water simultaneously. Displacement increment and pore water pressure increment are discretized using the same EFG shape functions. An incremental constrained Galerkin weak form is used to create the discrete system of equations and a fully implicit scheme is used for discretization in the time domain. Implementation of essential boundary conditions is based on the penalty method. In order to model discrete fractures, the so-called diffraction method is used.Examples are presented and the results are compared to some closed-form solutions and FEM approximations in order to demonstrate the validity of the developed model and its capabilities. The model is able to take the anisotropy and inhomogeneity of the material into account. The applicability of the model is examined by simulating hydraulic fracture initiation and propagation process from a borehole by injection of fluid. The maximum tensile strength criterion and Mohr-Coulomb shear criterion are used for modelling tensile and shear fracture, respectively. The model successfully simulates the leak-off of fluid from the fracture into the surrounding material. The results indicate the importance of pore fluid pressure in the initiation and propagation pattern of fracture in saturated soils. © 2013 Elsevier Ltd.

Fourier有限差分法深度偏移与正演模拟

With the development of seismic exploration, the target becomes more and more complex, which leads to a higher demand for the accuracy and efficiency in 3D exploration. Fourier finite-difference (FFD) method is one of the most valuable methods in complex structure exploration, which keeps the ability of finite-differenc method in dealing with laterally varing media and inherits the predominance of the phase-screen method in stablility and efficiency. In this thesis, the accuracy of the FFD operator is highly improved by using simulated annealing algorithm. This method takes the extrapolation step and band width into account, which is more suitable to various band width and discrete scale than the commonely-used optimized method based on velocity contrast alone. In this thesis, the FFD method is extended to viscoacoustic modeling. Based on one-way wave equation, the presented method is implemented in frequency domain; thus, it is more efficient than two-way methods, and is more convenient than time domain methods in handling attenuation and dispersion effects. The proposed method can handle large velocity contrast and has a high efficiency, which is helpful to further research on earth absorption and seismic resolution. Starting from the frequency dispersion of the acoustic VTI wave equation, this thesis extends the FFD migration method to the acoustic VTI media. Compared with the convetional FFD method, the presented method has a similar computational efficiency, and keeps the abilities of dealing with large velocity contrasts and steep dips. The numerical experiments based on the SEG salt model show that the presented method is a practical migration method for complex acoustical VTI media, because it can handle both large velocity contrasts and large anisotropy variations, and its accuracy is relatively high even in strong anisotropic media. In 3D case, the two-way splitting technique of FFD operator causes artificial azimuthal anisotropy. These artifacts become apparent with increasing dip angles and velocity contrasts, which prevent the application of the FFD method in 3D complex media. The current methods proposed to reduce the azimuthal anisotropy significantly increase the computational cost. In this thesis, the alternating-direction-implicit plus interpolation scheme is incorporated into the 3D FFD method to reduce the azimuthal anisotropy. By subtly utilizing the Fourier based scheme of the FFD method, the improved fast algorithm takes approximately no extra computation time. The resulting operator keeps both the accuracy and the efficiency of the FFD method, which is helpful to the inhancements of both the accuracy and the efficiency for prestack depth migration. The general comparison is presented between the FFD operator and the generalized-screen operator, which is valuable to choose the suitable method in practice. The percentage relative error curves and migration impulse responses show that the generalized-screen operator is much sensiutive to the velocity contrasts than the FFD operator. The FFD operator can handle various velocity contrasts, while the generalized-screen operator can only handle some range of the velocity contrasts. Both in large and weak velocity contrasts, the higher order term of the generalized-screen operator has little effect on improving accuracy. The FFD operator is more suitable to large velocity contrasts, while the generalized-screen operator is more suitable to middle velocity contrasts. Both the one-way implicit finite-difference migration and the two-way explicit finite-differenc modeling have been implemented, and then they are compared with the corresponding FFD methods respectively. This work gives a reference to the choosen of proper method. The FFD migration is illustrated to be more attractive in accuracy, efficiency and frequency dispertion than the widely-used implicit finite-difference migration. The FFD modeling can handle relatively coarse grids than the commonly-used explicit finite-differenc modeling, thus it is much faster in 3D modeling, especially for large-scale complex media.

基于匹配追踪方法的地震信号时频分析研究

Seismic signal is a typical non-stationary signal, whose frequency is continuously changing with time and is determined by the bandwidth of seismic source and the absorption characteristic of the media underground. The most interesting target of seismic signal’s processing and explaining is to know about the local frequency’s abrupt changing with the time, since this kind of abrupt changing is indicating the changing of the physical attributes of the media underground. As to the seismic signal’s instantaneous attributes taken from time-frequency domain, the key target is to search a effective, non-negative and fast algorithm time-frequency distribution, and transform the seismic signal into this time-frequency domain to get its instantaneous power spectrum density, and then use the process of weighted adding and average etc. to get the instantaneous attributes of seismic signal. Time-frequency analysis as a powerful tool to deal with time variant non-stationary signal is becoming a hot researching spot of modern signal processing, and also is an important method to make seismic signal’s attributes analysis. This kind of method provides joint distribution message about time domain and frequency domain, and it clearly plots the correlation of signal’s frequency changing with the time. The spectrum decomposition technique makes seismic signal’s resolving rate reach its theoretical level, and by the method of all frequency scanning and imaging the three dimensional seismic data in frequency domain, it improves and promotes the resolving abilities of seismic signal vs. geological abnormal objects. Matching pursuits method is an important way to realize signal’s self-adaptive decomposition. Its main thought is that any signal can be expressed by a series of time-frequency atoms’ linear composition. By decomposition the signal within an over completed library, the time-frequency atoms which stand for the signal itself are selected neatly and self-adaptively according to the signal’s characteristics. This method has excellent sparse decomposition characteristics, and is widely used in signal de-noising, signal coding and pattern recognizing processing and is also adaptive to seismic signal’s decomposition and attributes analysis. This paper takes matching pursuits method as the key research object. As introducing the principle and implementation techniques of matching pursuits method systematically, it researches deeply the pivotal problems of atom type’s selection, the atom dictionary’s discrete, and the most matching atom’s searching algorithm, and at the same time, applying this matching pursuits method into seismic signal’s processing by picking-up correlative instantaneous messages from time-frequency analysis and spectrum decomposition to the seismic signal. Based on the research of the theory and its correlative model examination of the adaptively signal decomposition with matching pursuit method, this paper proposes a fast optimal matching time-frequency atom’s searching algorithm aimed at seismic signal’s decomposition by frequency-dominated pursuit method and this makes the MP method pertinence to seismic signal’s processing. Upon the research of optimal Gabor atom’s fast searching and matching algorithm, this paper proposes global optimal searching method using Simulated Annealing Algorithm, Genetic Algorithm and composed Simulated Annealing and Genetic Algorithm, so as to provide another way to implement fast matching pursuit method. At the same time, aimed at the characteristics of seismic signal, this paper proposes a fast matching atom’s searching algorithm by means of designating the max energy points of complex seismic signal, searching for the most optimal atom in the neighbor area of these points according to its instantaneous frequency and instantaneous phase, and this promotes the calculating efficiency of seismic signal’s matching pursuit algorithm. According to these methods proposed above, this paper implements them by programmed calculation, compares them with some open algorithm and proves this paper’s conclusions. It also testifies the active results of various methods by the processing of actual signals. The problems need to be solved further and the aftertime researching targets are as follows: continuously seeking for more efficient fast matching pursuit algorithm and expanding its application range, and also study the actual usage of matching pursuit method.

Nonlinear Acoustics in Underwater and Biomedical Applications: Array Performance Degradation and Time Reversal Invariance

This dissertation describes a model for acoustic propagation in inhomogeneous flu- ids, and explores the focusing by arrays onto targets under various conditions. The work explores the use of arrays, in particular the time reversal array, for underwater and biomedical applications. Aspects of propagation and phasing which can lead to reduced focusing effectiveness are described. An acoustic wave equation was derived for the propagation of finite-amplitude waves in lossy time-varying inhomogeneous fluid media. The equation was solved numerically in both Cartesian and cylindrical geometries using the finite-difference time-domain (FDTD) method. It was found that time reversal arrays are sensitive to several debilitating factors. Focusing ability was determined to be adequate in the presence of temporal jitter in the time reversed signal only up to about one-sixth of a period. Thermoviscous absorption also had a debilitating effect on focal pressure for both linear and nonlinear propagation. It was also found that nonlinearity leads to degradation of focal pressure through amplification of the received signal at the array, and enhanced absorption in the shocked waveforms. This dissertation also examined the heating effects of focused ultrasound in a tissue-like medium. The application considered is therapeutic heating for hyperther- mia. The acoustic model and a thermal model for tissue were coupled to solve for transient and steady temperature profiles in tissue-like media. The Pennes bioheat equation was solved using the FDTD method to calculate the temperature fields in tissue-like media from focused acoustic sources. It was found that the temperature-dependence of the medium's background prop- erties can play an important role in the temperature predictions. Finite-amplitude effects contributed excess heat when source conditions were provided for nonlinear ef- fects to manifest themselves. The effect of medium heterogeneity was also found to be important in redistributing the acoustic and temperature fields, creating regions with hotter and colder temperatures than the mean by local scattering and lensing action. These temperature excursions from the mean were found to increase monotonically with increasing contrast in the medium's properties.

Skin Color-Based Video Segmentation under Time-Varying Illumination

A novel approach for real-time skin segmentation in video sequences is described. The approach enables reliable skin segmentation despite wide variation in illumination during tracking. An explicit second order Markov model is used to predict evolution of the skin-color (HSV) histogram over time. Histograms are dynamically updated based on feedback from the current segmentation and predictions of the Markov model. The evolution of the skin-color distribution at each frame is parameterized by translation, scaling and rotation in color space. Consequent changes in geometric parameterization of the distribution are propagated by warping and resampling the histogram. The parameters of the discrete-time dynamic Markov model are estimated using Maximum Likelihood Estimation, and also evolve over time. The accuracy of the new dynamic skin color segmentation algorithm is compared to that obtained via a static color model. Segmentation accuracy is evaluated using labeled ground-truth video sequences taken from staged experiments and popular movies. An overall increase in segmentation accuracy of up to 24% is observed in 17 out of 21 test sequences. In all but one case the skin-color classification rates for our system were higher, with background classification rates comparable to those of the static segmentation.