<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>etd@IISc Collection:</title>
  <link rel="alternate" href="http://hdl.handle.net/2005/19" />
  <subtitle />
  <id>http://hdl.handle.net/2005/19</id>
  <updated>2013-05-01T20:44:04Z</updated>
  <dc:date>2013-05-01T20:44:04Z</dc:date>
  <entry>
    <title>Energy And Channel-Aware Power And Discrete Rate Adaptation And Access In Energy Harvesting Wireless Networks</title>
    <link rel="alternate" href="http://hdl.handle.net/2005/1876" />
    <author>
      <name>Khairnar, Parag S</name>
    </author>
    <id>http://hdl.handle.net/2005/1876</id>
    <updated>2013-01-08T10:03:17Z</updated>
    <published>2013-01-07T18:30:00Z</published>
    <summary type="text">Title: Energy And Channel-Aware Power And Discrete Rate Adaptation And Access In Energy Harvesting Wireless Networks
Authors: Khairnar, Parag S
Abstract: Energy harvesting (EH) nodes, which harvest energy from the environment in order to communicate over a wireless link, promise perpetual operation of wireless networks. The primary focus of the communication system design shifts from being as energy conservative as possible to judiciously handling the randomness in the energy harvesting process in order to enhance the system performance. This engenders a significant redesign of the physical and multiple access layers of communication. &#xD;
In this thesis, we address the problem of maximizing the throughput of a system that consists of rate-adaptive EH nodes that transmit data to a common sink node. We consider the practical case of discrete rate adaptation in which a node selects its transmission power from a set of finitely many rates and adjusts its transmit power to meet a bit error rate (BER) constraint. When there is only one EH node in the network, the problem involves determining the rate and power at which the node should transmit as a function of its channel gain and battery state. For the system with multiple EH nodes, which node should be selected also needs to be determined. &#xD;
We first prove that the energy neutrality constraint, which governs the operation of an EH node, is tighter than the average power constraint. We then propose a simple rate and power adaptation scheme for a system with a single EH node and prove that its throughput approaches the optimal throughput arbitrarily closely. We then arrive at the optimal selection and rate adaptation rules for a multi-EH node system that opportunistically selects at most one node to transmit at any time. The optimal scheme is shown to significantly outperform other ad hoc selection and transmission schemes. The effect of energy overheads, such as battery storage inefficiencies and the energy required for sensing and processing, on the transmission scheme and its overall throughput is also analytically characterized. &#xD;
Further, we show how the time and energy overheads incurred by the opportunistic selection process itself affect the adaptation and selection rules and the overall system throughput. Insights into the scaling behavior of the average system throughput in the asymptotic regime, in which the number of nodes tend to infinity, are also obtained. We also optimize the maximum time allotted for selection, so as to maximize the overall system throughput. &#xD;
For systems with EH nodes or non-EH nodes, which are subject to an average power constraint, the optimal rate and power adaptation depends on a power control parameter, which hitherto has been calculated numerically. We derive novel asymptotically tight bounds and approximations for the same, when the average rate of energy harvesting is large. These new expressions are analytically insightful, computationally useful, and are also quite accurate even in the non-asymptotic regime when average rate of energy harvesting is relatively small. &#xD;
In summary, this work develops several useful insights into the design of selection and transmission schemes for a wireless network with rate-adaptive EH nodes.</summary>
    <dc:date>2013-01-07T18:30:00Z</dc:date>
  </entry>
  <entry>
    <title>MDCT Domain Enhancements For Audio Processing</title>
    <link rel="alternate" href="http://hdl.handle.net/2005/1184" />
    <author>
      <name>Suresh, K</name>
    </author>
    <id>http://hdl.handle.net/2005/1184</id>
    <updated>2011-05-10T09:22:58Z</updated>
    <published>2011-05-09T18:30:00Z</published>
    <summary type="text">Title: MDCT Domain Enhancements For Audio Processing
Authors: Suresh, K
Abstract: Modified discrete cosine transform (MDCT) derived from DCT IV has emerged as the most suitable choice for transform domain audio coding applications due to its time domain alias cancellation property and de-correlation capability. In the present research work, we focus on MDCT domain analysis of audio signals for compression and other applications. We have derived algorithms for linear filtering in DCT IV and DST IV domains for symmetric and non-symmetric filter impulse responses. These results are also extended to MDCT and MDST domains which have the special property of time domain alias cancellation. We also derive filtering algorithms for the DCT II and DCT III domains. Comparison with other methods in the literature shows that, the new algorithm developed is computationally MAC efficient. These results are useful for MDCT domain audio processing such as reverb synthesis, without having to reconstruct the time domain signal and then perform the necessary filtering operations. &#xD;
In audio coding, the psychoacoustic model plays a crucial role and is used to estimate the masking thresholds for adaptive bit-allocation.  Transparent quality audio coding is possible if the quantization noise is kept below the masking threshold for each frame. In the existing methods, the masking threshold is calculated using the DFT of the signal frame separately for MDCT domain adaptive quantization. We have extended the spectral integration based psychoacoustic model proposed for sinusoidal modeling of audio signals to the MDCT domain.   This has been possible because of the detailed analysis of the relation between DFT and MDCT; we interpret the MDCT coefficients as co-sinusoids and then apply the sinusoidal masking model. The validity of the masking threshold so derived is verified through listening tests as well as objective measures. &#xD;
Parametric coding techniques are used for low bit rate encoding of multi-channel audio such as 5.1 format surround audio. In these techniques, the surround channels are synthesized at the receiver using the analysis parameters of the parametric model. We develop algorithms for MDCT domain analysis and synthesis of reverberation. Integrating these ideas, a parametric audio coder is developed in the MDCT domain. For the parameter estimation, we use a novel analysis by synthesis scheme in the MDCT domain which results in better modeling of the spatial audio. The resulting parametric stereo coder is able to synthesize   acceptable quality stereo audio from the mono audio channel and a side information of approximately 11 kbps.  Further, an experimental audio coder is developed in the MDCT domain incorporating the new psychoacoustic model and the parametric model.</summary>
    <dc:date>2011-05-09T18:30:00Z</dc:date>
  </entry>
  <entry>
    <title>Techniques For Low Power Motion Estimation In Video Encoders</title>
    <link rel="alternate" href="http://hdl.handle.net/2005/1918" />
    <author>
      <name>Gupte, Ajit D</name>
    </author>
    <id>http://hdl.handle.net/2005/1918</id>
    <updated>2013-02-12T09:46:09Z</updated>
    <published>2013-02-11T18:30:00Z</published>
    <summary type="text">Title: Techniques For Low Power Motion Estimation In Video Encoders
Authors: Gupte, Ajit D
Abstract: This thesis looks at hardware algorithms that help reduce dynamic power dissipation in video encoder applications. Computational complexity of motion estimation and the data traffic between external memory and the video processing engine are two main reasons for large power dissipation in video encoders. While motion estimation may consume 50% to 70% of total video encoder power, the power dissipated in external memory such as the DDR SDRAM can be of the order of 40% of the total system power. Reducing power dissipation in video encoders is important in order to improve battery life of mobile devices such as the smart phones and digital camcorders. We propose hardware algorithms which extract only the important features in the video data to reduce the complexity of computations, communications and storage, thereby reducing average power dissipation. We apply this concept to design hardware algorithms for optimizing motion estimation matching complexity, and reference frame storage and access from the external memory. In addition, we also develop techniques to reduce searching complexity of motion estimation. &#xD;
First, we explore a set of adaptive algorithms that reduce average power dissipated due to motion estimation. We propose that by taking into account the macro-block level features in the video data, the average matching complexity of motion estimation in terms of number of computations in real-time hardwired video encoders can be significantly reduced when compared against traditional hardwired implementations, that are designed to handle most demanding data sets. Current macro-block features such as pixel variance and Hadamard transform coefficients are analyzed, and are used to adapt the matching complexity. The macro-block is partitioned based on these features to obtain sub-block sums, which are used for matching operations. Thus, simple macro-blocks, without many features can be matched with much less computations compared to the macro-blocks with complex features, leading to reduction in average power dissipation. Apart from optimizing the matching operation, optimizing the search operation is a powerful way to reduce motion estimation complexity. We propose novel search optimization techniques including (1) a center-biased search order and (2) skipping unlikely search positions, both applied in the context of real time hardware &#xD;
implementation. The proposed search optimization techniques take into account and are compatible with the reference data access pattern from the memory as required by the hardware algorithm. We demonstrate that the matching and searching optimization techniques together achieve nearly 65% reduction in power dissipation due to motion estimation, without any significant degradation in motion estimation quality. &#xD;
A key to low power dissipation in video encoders is minimizing the data traffic between the external memory devices such as DDR SDRAM and the video processor. External memory power can be as high as 50% of the total power budget in a multimedia system. Other than the power dissipation in external memory, the amount of data traffic is an important parameter that has significant impact on the system cost. Large memory traffic necessitates high speed external memories, high speed on-chip interconnect, and more parallel I/Os to increase the memory throughput. This leads to higher system cost. We explore a lossy, scalar quantization based reference frame compression technique that can be used to reduce the amount of reference data traffic from external memory devices significantly. In this scheme, the quantization is adapted based on the pixel range within each block being compressed. We show that the error introduced by the scalar quantization is bounded and can be represented by smaller number of bits compared to the original pixel. The proposed reference frame compression scheme uses this property to minimize the motion compensation related traffic, thereby improving the compression scheme efficiency. The scheme maintains a fixed compression ratio, and the size of the quantization error is also kept constant. This enables easy storage and retrieval of reference data. The impact of using lossy reference on the motion estimation quality is negligible. As a result of reduction in DDR traffic, the DDR power is reduced significantly. The power dissipation due to additional hardware required for reference frame compression is very small compared to the reduction in DDR power. 24% reduction in peak DDR bandwidth and 23% net reduction in average DDR power is achieved. For video sequences with larger motion, the amount of bandwidth reduction is even higher (close to 40%) and reduction in power is close to 30%.</summary>
    <dc:date>2013-02-11T18:30:00Z</dc:date>
  </entry>
  <entry>
    <title>Nonlinear Processing Of EEG and HRV Signals For The Study Of Physiological And Pathological States</title>
    <link rel="alternate" href="http://hdl.handle.net/2005/1975" />
    <author>
      <name>Raghavendra, Bobbi S</name>
    </author>
    <id>http://hdl.handle.net/2005/1975</id>
    <updated>2013-04-26T10:11:52Z</updated>
    <published>2013-04-25T18:30:00Z</published>
    <summary type="text">Title: Nonlinear Processing Of EEG and HRV Signals For The Study Of Physiological And Pathological States
Authors: Raghavendra, Bobbi S
Abstract: Physiological signals, electroencephalogram (EEG) and heart rate variability (HRV), are generated by complex self-regulating systems. These signals are extremely inhomogeneous and nonstationary, and fluctuate in an irregular and highly complex manner. These fluctuations are due to underlying dynamics of the system. The synchronous neural activity measured as scalp EEG indicates underlying neural dynamics of the brain. Hence, quantitative EEG analysis has become a very useful tool in interpreting results from physiological experiments. The analysis of HRV provides valuable information to assess the autonomous nervous system (ANS). The HRV can be significantly affected by physiological state changes and many disease states. Hence, HRV analysis is becoming a major experimental and diagnostic tool. In this thesis, we focus on the study of EEG and HRV time series using tools from nonlinear time series analysis with special emphasis on its implications in detecting physiological state changes such as, in diseases like epileptic seizure and schizophrenia, and in altered states of consciousness as in sleep and meditation. The proposed nonlinear techniques are used in discriminating different physiological states from control states. &#xD;
Artifact processing of EEG signal &#xD;
Interferences (artifacts) from various sources unavoidably contaminate EEG recordings. In quantitative analysis, results can differ significantly by these artifacts, which may lead to wrong interpretation of the results. In this part of the thesis, we have devised methods to minimize ocular and muscle artifacts in EEG. The artifact correction methods are based on blind source separation (BSS) techniques such as singular value decomposition (SVD), algorithm for multiple signal extraction (AMUSE), canonical correlation analysis (CCA), information maximization (INFOMAX) independent component analysis (ICA) and joint approximate diagonalization of eigen-matrices (JADE) ICA. We have proposed a method to simulate clean and artifact corrupted EEG data based on the BSS methods. In order to enhance the performance of BSS methods, a technique called wavelet-filtered component inclusion method has been introduced. In addition, second-order statistics (SOS) and higher-order statistics (HOS) based BSS methods have been studied considering less number of EEG channels; and performance comparison of these methods has also been made. We have also addressed the problem of simultaneous correction of ocular and muscle artifacts in EEG recordings using the BSS methods. &#xD;
Irrespective of the BSS methods, the component elimination method has introduced high spectral error in all the bands after reconstruction of clean EEG. However, the wavelet filtered component inclusion method has retained almost all spectral powers of EEG channels in theta, alpha, and beta bands after ocular artifact minimization. When the number of EEG channels is very less, the enhanced CCA (SOS BSS) has given superior artifact minimization results than HOS BSS methods, especially in delta band. The component elimination method is used in muscle artifact minimization, and hence the SVD method cannot be used for this purpose since it leads to large spectral distortion of reconstructed EEG. The AMUSE and CCA methods have given comparable performance in muscle artifact minimization. In addition, the JADE method has introduced less mean spectral error compared to other methods. The CCA method has shown superior performance in simultaneous minimization of ocular and muscle artifacts, and AMUSE and JADE methods have given comparable results. Furthermore, the less computation time of wavelet enhanced SOS BSS methods make them very useful in real clinical environments. &#xD;
Fractal characterization of time series &#xD;
In biomedical signal analysis, fractal dimension (FD) is used as a quantitative measure to estimate complexity of physiological signals. Such analysis helps to study physiological processes of underlying systems. The FD can also be used to study dynamics of transitions between different states of systems like brain and ANS, in various physiological and pathological states. In this part, we have proposed a method to estimate FD of time series, called multiresolution box-counting (MRBC) method. A modification of this method resulted in multiresolution length (MRL) method. The estimation performance of the proposed methods is compared with that of Katz, Sevcik, and Higuchi methods, by simulating mathematically defined fractal signals, and also the computation time is compared between the methods. The MRBC and MRL methods have given comparable performance to that of Higuchi method, in estimating FD of waveforms, with the advantage of less computational time. In addition, various properties of the FD are studied and discussed in connection with classical signal processing concepts such as amplitude, frequency, sampling frequency, effect of noise, band width, correlation, etc. The FD value of signals has increased with number of harmonics, noise variance, band-width, and mid-band frequency, and decreased with degree of correlation in AR signal. An analogy between Katz FD and smoothed Teager energy operator has also been made. &#xD;
Application of fractal analysis to EEG and HRV time series &#xD;
The fluctuation of EEG potentials normally depends upon degree of alertness, and varies in amplitude and frequency. Hence, the EEG is an important clinical tool for studying sleep and sleep related disorders, epileptic seizures, schizophrenia, and meditation. In this part of the thesis, we have used FD which gives signal complexity, and detrended fluctuation analysis (DFA) which gives multiscale exponent of time series to quantify EEG. We have extended the concept of FD to multiscale FD to compute complexity of time series at multiple scales. The main applications of the proposed method are epileptic seizure detection, sleep stage detection, schizophrenia EEG analysis, and analysis of heart rate variability during meditation. For seizure detection, we have used intracranial EEG recordings with seizure-free and seizure intervals. In sleep EEG analysis, whole-night sleep EEG is used and results are compared with the manually scored hypnogram. The schizophrenia symptom is further categorized into positive and negative symptoms and complexity is estimated using FD and DFA. We have also analyzed HRV data of Chi and Kundalini meditation using FD and DFA techniques. In all the applications considered, we have tested for statistical significance of the computed parameters, between the case of interest and corresponding control cases, to discriminate between the physiological states. &#xD;
The ocular artifact has reduced FD while muscle artifact increased FD of EEG. The FD of seizure EEG has shown high value compared to that of seizure-free EEG. In addition, the seizure-free EEG has more DFA exponent-1 than seizure EEG. The value of FD of EEG is decreased with deepening of sleep, wake state having high FD value. The FD of REM state sleep EEG showed value between that of wake and state-1. The DFA exponent-1 has increased with deepening of sleep state, having small value for wake state. The REM state has given exponent-1 value between wake and state-1. The schizophrenia subjects have shown lower FD value than healthy controls in all the EEG channels except the bilateral temporal and occipital regions. The positive symptom sub-group has shown comparatively high FD values than healthy controls as well as overall schizophrenia sample in the bilateral tempero-parietal-occipital region. In addition, the positive symptom sub-group has shown significantly higher regional FD values than negative symptom sub-group especially in right temporal region. The overall schizophrenia samples as well as the positive and negative subgroup have shown least FD values in the bilateral frontal region. &#xD;
The values of DFA exponent-2 have shown significant high value in schizophrenia samples. In addition, the schizophrenia group has shown less DFA exponent-1 in bilateral temporal region than healthy control. The FD, multiscale FD, DFA exponents have shown significant performance in discriminating different physiological states from control states. The FD value of HRV time series during meditation is less compared to pre-meditation state in both Chi and Kundalini meditation. Irrespective of the type of meditation, meditation state has shown significantly high DFA exponent-1 than pre-meditation state, and significantly high DFA exponent-2 in pre-meditation state compared to meditation state. &#xD;
Functional connectivity analysis of brain during meditation &#xD;
In functionally related regions of the brain, even in those regions separated by substantial distances, the EEG fluctuations are synchronous, which is termed as functional connectivity. In this part, a novel application of functional connectivity analysis of brain using graph theoretic approach has been made on the EEG recorded from meditation practitioners. We have used 16 channel EEG data from subjects while performing Raja Yoga meditation. The pre-meditation condition is used as control state, against which meditation state is compared. For finding connectivity between EEG of various channels, we have computed pair-wise linear correlation and mutual information between the EEG channels, to form a connection matrix of size 16x16. Then, various graph parameters, such as average connection density, degree of nodes, characteristic path length, and cluster index, are computed from the connection matrix. The computed parameters are projected on to the scalp to get topographic head maps that give spatial variation of the parameter, and results are compared between meditation and pre-meditation states. &#xD;
The meditation state has shown low average connection density, less characteristic path length, and high average degree in fronto-central and central regions. Furthermore, high cluster index is shown in frontal and central regions than pre-meditation state. The parameters such as complexity, characteristic path length and average connection density are used as features in quadratic discriminant classifier to classify meditation and pre-meditation state, and have given good accuracy performance. Connectivity analysis using mutual information has given high average connection density in meditation state in theta, alpha and beta bands compared to pre-meditation state. The characteristic path length is high in delta, alpha and beta bands in meditation state. In addition, the meditation state has shown high degree and cluster index in theta and beta bands compared to pre-meditation state. &#xD;
Nonlinear dynamical characterization of HRV during meditation &#xD;
The cardiovascular system is influenced by internal dynamics as well as from various external factors, which makes the system more dynamic and nonlinear. In this part of the thesis, a novel application of using HRV data for studying Chi and Kundalini meditation has been made. The HRV time series are embedded into higher dimensional phase-space using Takens’ embedding theorem to reconstruct the attractor. After estimating the minimum embedding dimension to unfold the attractor dynamics, the complexity of the attractor is computed using correlation dimension, Lyapunov exponent, and nonlinearity scores. In all the analyses, the pre-meditation state is used as control state against which meditation state is compared. The statistical significance of the parameters estimated is tested to discriminate meditation state from control state. &#xD;
The HRV time series of both pre-meditation and meditation have shown similar minimum embedding dimensions in both Chi and Kundalini meditation. Irrespective of the type of meditation, the meditation state has shown high correlation dimension, largest Lyapunov exponent, and low nonlinearity score compared to pre-meditation state. &#xD;
Recurrent quantification analysis of HRV during meditation &#xD;
In this part, a novel application of recurrent quantification analysis (RQA) to HRV during meditation is studied. Here, the time series is embedded into a higher dimensional phase-space and Euclidean distance between the embedded vectors is calculated to form a distance matrix. The matrix is converted into binary matrix by applying a suitable threshold, and plotted as image to get recurrence plot. Various parameters are extracted from the recurrence plot such as percent recurrence rate, diagonal parameters (determinism, divergence, entropy, ratio), and vertical or horizontal parameters (laminarity, trapping time, maximal vertical line length). The procedure is applied to HRV data during meditation and pre-meditation (control) to discriminate between the states. &#xD;
The HRV of meditation state has shown more diagonal line structure whereas more black patches are observed in pre-meditation state. In addition, at low embedding dimensions, the meditation state has shown low recurrence rate, high determinism, low divergence, low entropy, high ratio, high laminarity, high trapping time, and less maximal vertical line length compared to pre-meditation state. These RQA parameters have shown superior performance in discriminating meditation state from control state.</summary>
    <dc:date>2013-04-25T18:30:00Z</dc:date>
  </entry>
</feed>

