This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.

Displaying 1 - 10 of 138
Filtering by

Clear all filters

151690-Thumbnail Image.png
Description
Practical communication systems are subject to errors due to imperfect time alignment among the communicating nodes. Timing errors can occur in different forms depending on the underlying communication scenario. This doctoral study considers two different classes of asynchronous systems; point-to-point (P2P) communication systems with synchronization errors, and asynchronous cooperative systems.

Practical communication systems are subject to errors due to imperfect time alignment among the communicating nodes. Timing errors can occur in different forms depending on the underlying communication scenario. This doctoral study considers two different classes of asynchronous systems; point-to-point (P2P) communication systems with synchronization errors, and asynchronous cooperative systems. In particular, the focus is on an information theoretic analysis for P2P systems with synchronization errors and developing new signaling solutions for several asynchronous cooperative communication systems. The first part of the dissertation presents several bounds on the capacity of the P2P systems with synchronization errors. First, binary insertion and deletion channels are considered where lower bounds on the mutual information between the input and output sequences are computed for independent uniformly distributed (i.u.d.) inputs. Then, a channel suffering from both synchronization errors and additive noise is considered as a serial concatenation of a synchronization error-only channel and an additive noise channel. It is proved that the capacity of the original channel is lower bounded in terms of the synchronization error-only channel capacity and the parameters of both channels. On a different front, to better characterize the deletion channel capacity, the capacity of three independent deletion channels with different deletion probabilities are related through an inequality resulting in the tightest upper bound on the deletion channel capacity for deletion probabilities larger than 0.65. Furthermore, the first non-trivial upper bound on the 2K-ary input deletion channel capacity is provided by relating the 2K-ary input deletion channel capacity with the binary deletion channel capacity through an inequality. The second part of the dissertation develops two new relaying schemes to alleviate asynchronism issues in cooperative communications. The first one is a single carrier (SC)-based scheme providing a spectrally efficient Alamouti code structure at the receiver under flat fading channel conditions by reducing the overhead needed to overcome the asynchronism and obtain spatial diversity. The second one is an orthogonal frequency division multiplexing (OFDM)-based approach useful for asynchronous cooperative systems experiencing excessive relative delays among the relays under frequency-selective channel conditions to achieve a delay diversity structure at the receiver and extract spatial diversity.
ContributorsRahmati, Mojtaba (Author) / Duman, Tolga M. (Thesis advisor) / Zhang, Junshan (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Reisslein, Martin (Committee member) / Arizona State University (Publisher)
Created2013
Description
Several contemporary clarinet works use Chinese folk music elements from different regions in new compositions to entice listener's and performer's appreciation of Chinese culture. However, to date, limited academic research on this topic exists. This research paper introduces six contemporary clarinet works by six Chinese composers: Qigang Chen's Morning Song,

Several contemporary clarinet works use Chinese folk music elements from different regions in new compositions to entice listener's and performer's appreciation of Chinese culture. However, to date, limited academic research on this topic exists. This research paper introduces six contemporary clarinet works by six Chinese composers: Qigang Chen's Morning Song, Yan Wang's Mu ma zhi ge (The Song of Grazing Horses), An-lun Huang's Capriccio for Clarinet and Strings Op. 41, Bijing Hu's The Sound of Pamir Clarinet Concerto, Mei-Mi Lan's Concerto for Clarinet and String Orchestra with Harp and Percussion, and Yu-Hui Chang's Three Fantasias for Solo Clarinet in B-flat. They are examined from different perspectives, including general structure, style, and rejuvenated folk music use. The focus of this research paper is to investigate the use of Chinese folk music in several works in collaboration with the composers. The author found that although contemporary composers use Chinese folk music differently in their works (i.e., some use melodies, others use harmony, while others use modes), each work celebrates the music and culture of the folk music on which the pieces are based. It is the author's hope to stimulate people's interest in music using Chinese folk music elements, and bring these lesser known works into the common clarinet repertoire.
ContributorsFeng, Chiao-Ting (Author) / Spring, Robert (Thesis advisor) / Gardner, Joshua (Committee member) / Micklich, Albie (Committee member) / Rogers, Rodney (Committee member) / Schuring, Martin (Committee member) / Arizona State University (Publisher)
Created2013
152134-Thumbnail Image.png
Description
Bright Summer, a one-movement piece for orchestra, was composed in Arizona, and completed in February 2013. The piece is approximately twelve minutes long. The motivation for writing this piece was the death of my mother the year before, in 2012. The prevailing mood of this work is bright and pleasant,

Bright Summer, a one-movement piece for orchestra, was composed in Arizona, and completed in February 2013. The piece is approximately twelve minutes long. The motivation for writing this piece was the death of my mother the year before, in 2012. The prevailing mood of this work is bright and pleasant, expressing my mother's cheerful personality when she was alive. It also portrays bright summer days which resemble my mother's spirit. Thus, soundscape plays an important role in this work. It depicts summer breeze, rustling sounds of leaves, and, to translate a Korean saying, "high blue skies." This soundscape opens the piece as well as closes it. In the middle section, the fast upbeat themes represent my mother's witty and optimistic personality. The piece also contains the presence of a hymn tune, The Love of God is Greater Far, which informs the motivic content and also functions as the climax of the piece. It was my mother's favorite hymn and we used to sing it together following her conversion to Christianity. The piece contains three main sections, which are held together by transitional material based on the soundscape and metric modulations. Unlike my earlier works, Bright Summer is tonal, with upper tertian harmonies prevailing throughout the piece. However, the opening and closing soundscapes do not have functional harmonies. For example, tertian chords appear and vanish silently, leaving behind some resonant sounds without any harmonic progression. Overall, the whole piece is reminiscent of my mother who lived a beautiful life.
ContributorsKim, JeeYeon (Composer) / DeMars, James (Thesis advisor) / Hackbarth, Glenn (Committee member) / Rogers, Rodney (Committee member) / Levy, Benjamin (Committee member) / Rockmaker, Jody (Committee member) / Arizona State University (Publisher)
Created2013
151953-Thumbnail Image.png
Description
Distributed inference has applications in a wide range of fields such as source localization, target detection, environment monitoring, and healthcare. In this dissertation, distributed inference schemes which use bounded transmit power are considered. The performance of the proposed schemes are studied for a variety of inference problems. In the first

Distributed inference has applications in a wide range of fields such as source localization, target detection, environment monitoring, and healthcare. In this dissertation, distributed inference schemes which use bounded transmit power are considered. The performance of the proposed schemes are studied for a variety of inference problems. In the first part of the dissertation, a distributed detection scheme where the sensors transmit with constant modulus signals over a Gaussian multiple access channel is considered. The deflection coefficient of the proposed scheme is shown to depend on the characteristic function of the sensing noise, and the error exponent for the system is derived using large deviation theory. Optimization of the deflection coefficient and error exponent are considered with respect to a transmission phase parameter for a variety of sensing noise distributions including impulsive ones. The proposed scheme is also favorably compared with existing amplify-and-forward (AF) and detect-and-forward (DF) schemes. The effect of fading is shown to be detrimental to the detection performance and simulations are provided to corroborate the analytical results. The second part of the dissertation studies a distributed inference scheme which uses bounded transmission functions over a Gaussian multiple access channel. The conditions on the transmission functions under which consistent estimation and reliable detection are possible is characterized. For the distributed estimation problem, an estimation scheme that uses bounded transmission functions is proved to be strongly consistent provided that the variance of the noise samples are bounded and that the transmission function is one-to-one. The proposed estimation scheme is compared with the amplify and forward technique and its robustness to impulsive sensing noise distributions is highlighted. It is also shown that bounded transmissions suffer from inconsistent estimates if the sensing noise variance goes to infinity. For the distributed detection problem, similar results are obtained by studying the deflection coefficient. Simulations corroborate our analytical results. In the third part of this dissertation, the problem of estimating the average of samples distributed at the nodes of a sensor network is considered. A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable whose expectation is the desired sample average of the initial observations with a variance that depends on the step size of the algorithm and the variance of the communication noise. The asymptotic performance is characterized by deriving the asymptotic covariance matrix using results from stochastic approximation theory. It is shown that using bounded transmissions results in slower convergence compared to the linear consensus algorithm based on the Laplacian heuristic. Simulations corroborate our analytical findings. Finally, a robust distributed average consensus algorithm in which every sensor performs a nonlinear processing at the receiver is proposed. It is shown that non-linearity at the receiver nodes makes the algorithm robust to a wide range of channel noise distributions including the impulsive ones. It is shown that the nodes reach consensus asymptotically and similar results are obtained as in the case of transmit non-linearity. Simulations corroborate our analytical findings and highlight the robustness of the proposed algorithm.
ContributorsDasarathan, Sivaraman (Author) / Tepedelenlioğlu, Cihan (Thesis advisor) / Papandreou-Suppappola, Antonia (Committee member) / Reisslein, Martin (Committee member) / Goryll, Michael (Committee member) / Arizona State University (Publisher)
Created2013
151775-Thumbnail Image.png
Description
ABSTRACT Musicians endure injuries at an alarming rate, largely due to the misuse of their bodies. Musicians move their bodies for a living and therefore should understand how to move them in a healthy way. This paper presents Body Mapping as an injury prevention technique specifically directed toward collaborative pianists.

ABSTRACT Musicians endure injuries at an alarming rate, largely due to the misuse of their bodies. Musicians move their bodies for a living and therefore should understand how to move them in a healthy way. This paper presents Body Mapping as an injury prevention technique specifically directed toward collaborative pianists. A body map is the self-representation in one's brain that includes information on the structure, function, and size of one's body; Body Mapping is the process of refining one's body map to produce coordinated movement. In addition to preventing injury, Body Mapping provides a means to achieve greater musical artistry through the training of movement, attention, and the senses. With the main function of collaborating with one or more musical partners, a collaborative pianist will have the opportunity to share the knowledge of Body Mapping with many fellow musicians. This study demonstrates the author's credentials as a Body Mapping instructor, the current status of the field of collaborative piano, and the recommendation for increased body awareness. Information on the nature and abundance of injuries and Body Mapping concepts are also analyzed. The study culminates in a course syllabus entitled An Introduction to Collaborative Piano and Body Mapping with the objective of imparting fundamental collaborative piano skills integrated with proper body use. The author hopes to inform educators of the benefits of prioritizing health among their students and to provide a Body Mapping foundation upon which their students can build technique.
ContributorsBindel, Jennifer (Author) / Campbell, Andrew (Thesis advisor) / Doan, Jerry (Committee member) / Rogers, Rodney (Committee member) / Ryan, Russell (Committee member) / Schuring, Martin (Committee member) / Arizona State University (Publisher)
Created2013
151825-Thumbnail Image.png
Description
There are a significant number of musical compositions for violin by composers who used folk songs and dances of various cultures in their music, including works by George Enescu, Béla Bartók and György Ligeti. Less known are pieces that draw on the plethora of melodies and rhythms from Turkey. The

There are a significant number of musical compositions for violin by composers who used folk songs and dances of various cultures in their music, including works by George Enescu, Béla Bartók and György Ligeti. Less known are pieces that draw on the plethora of melodies and rhythms from Turkey. The purpose of this paper is to help performers become more familiar with two such compositions: Fazil Say's Sonata for Violin and Piano and Cleopatra for Solo Violin. Fazil Say (b. 1970) is considered to be a significant, contemporary Turkish composer. Both of the works discussed in this document simulate traditional "Eastern" instruments, such as the kemenҫe, the baðlama, the kanun and the ud. Additionally, both pieces use themes from folk melodies of Turkey, Turkish dance rhythms and Arabian scales, all framed within traditional structural techniques, such as ostinato bass and the fughetta. Both the Sonata for Violin and Piano and Cleopatra are enormously expressive and musically interesting works, demanding virtuosity and a wide technical range. Although this document does not purport to be a full theoretical analysis, by providing biographical information, analytical descriptions, notes regarding interpretation, and suggestions to assist performers in overcoming technical obstacles, the writer hopes to inspire other violinists to consider learning and performing these works.
ContributorsKalantzi, Panagiota (Author) / Jiang, Danwen (Thesis advisor) / Hill, Gary (Committee member) / Rogers, Rodney (Committee member) / Rotaru, Catalin (Committee member) / Arizona State University (Publisher)
Created2013
151646-Thumbnail Image.png
Description
The purpose of this project is twofold: to contribute to the literature of chamber ensembles comprising mixed wind, string, and percussion instruments by producing arrangements of three piano rags by William Bolcom; and to highlight Bolcom's pivotal role in the ragtime revival of the 1960's and 1970's. Through his influence

The purpose of this project is twofold: to contribute to the literature of chamber ensembles comprising mixed wind, string, and percussion instruments by producing arrangements of three piano rags by William Bolcom; and to highlight Bolcom's pivotal role in the ragtime revival of the 1960's and 1970's. Through his influence as a scholar, composer, and performer, Bolcom (b. 1938), one of the most prominent American composers of his generation, helped garner respect for ragtime as art music and as one of America's great popular music genres. Bolcom's 3 Ghost Rags were written in the tradition of classic piano rags, but with a compositional sensibility that is influenced by the fifty years that separate them from the close of the original ragtime era. The basis for the present orchestrations of 3 Ghost Rags is the collection of instrumental arrangements of piano rags published by Stark Publishing Co., entitled Standard High-Class Rags. More familiarly known as the "Red Back Book," this publication was representative of the exchange of repertoire between piano and ensembles and served as a repertory for the various ragtime revivals that occurred later in the twentieth century. In creating these orchestrations of Bolcom's piano rags, the author strove to provide another medium in which Bolcom's music could be performed, while orchestrating the music for an historically appropriate ensemble.
ContributorsMelley, Eric Charles (Author) / Hill, Gary W. (Thesis advisor) / Bailey, Wayne (Committee member) / Norton, Kay (Committee member) / Rogers, Rodney (Committee member) / Russell, Timothy (Committee member) / Arizona State University (Publisher)
Created2013
151530-Thumbnail Image.png
Description
Wireless technologies for health monitoring systems have seen considerable interest in recent years owing to it's potential to achieve vision of pervasive healthcare, that is healthcare to anyone, anywhere and anytime. Development of wearable wireless medical devices which have the capability to sense, compute, and send physiological information to a

Wireless technologies for health monitoring systems have seen considerable interest in recent years owing to it's potential to achieve vision of pervasive healthcare, that is healthcare to anyone, anywhere and anytime. Development of wearable wireless medical devices which have the capability to sense, compute, and send physiological information to a mobile gateway, forming a Body Sensor Network (BSN) is considered as a step towards achieving the vision of pervasive health monitoring systems (PHMS). PHMS consisting of wearable body sensors encourages unsupervised long-term monitoring, reducing frequent visit to hospital and nursing cost. Therefore, it is of utmost importance that operation of PHMS must be reliable, safe and have longer lifetime. A model-based automatic code generation provides a state-of-art code generation of sensor and smart phone code from high-level specification of a PHMS. Code generator intakes meta-model of PHMS specification, uses codebase containing code templates and algorithms, and generates platform specific code. Health-Dev, a framework for model-based development of PHMS, uses code generation to implement PHMS in sensor and smart phone. As a part of this thesis, model-based automatic code generation was evaluated and experimentally validated. The generated code was found to be safe in terms of ensuring no race condition, array, or pointer related errors in the generated code and more optimized as compared to hand-written BSN benchmark code in terms of lesser unreachable code.
ContributorsVerma, Sunit (Author) / Gupta, Sandeep (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Reisslein, Martin (Committee member) / Arizona State University (Publisher)
Created2013
151542-Thumbnail Image.png
Description
Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios (SNRs) are provided for several adaptive transmission schemes over fading channels with general distributions, including optimal power and rate adaptation, rate adaptation only, channel inversion and its variants. Analysis of the high-SNR pre-log constants of the ergodic capacity

Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios (SNRs) are provided for several adaptive transmission schemes over fading channels with general distributions, including optimal power and rate adaptation, rate adaptation only, channel inversion and its variants. Analysis of the high-SNR pre-log constants of the ergodic capacity reveals the existence of constant capacity difference gaps among the schemes with a pre-log constant of 1. Closed-form expressions for these high-SNR capacity difference gaps are derived, which are proportional to the SNR loss between these schemes in dB scale. The largest one of these gaps is found to be between the optimal power and rate adaptation scheme and the channel inversion scheme. Based on these expressions it is shown that the presence of space diversity or multi-user diversity makes channel inversion arbitrarily close to achieving optimal capacity at high SNR with sufficiently large number of antennas or users. A low-SNR analysis also reveals that the presence of fading provably always improves capacity at sufficiently low SNR, compared to the additive white Gaussian noise (AWGN) case. Numerical results are shown to corroborate our analytical results. This dissertation derives high-SNR asymptotic average error rates over fading channels by relating them to the outage probability, under mild assumptions. The analysis is based on the Tauberian theorem for Laplace-Stieltjes transforms which is grounded on the notion of regular variation, and applies to a wider range of channel distributions than existing approaches. The theory of regular variation is argued to be the proper mathematical framework for finding sufficient and necessary conditions for outage events to dominate high-SNR error rate performance. It is proved that the diversity order being d and the cumulative distribution function (CDF) of the channel power gain having variation exponent d at 0 imply each other, provided that the instantaneous error rate is upper-bounded by an exponential function of the instantaneous SNR. High-SNR asymptotic average error rates are derived for specific instantaneous error rates. Compared to existing approaches in the literature, the asymptotic expressions are related to the channel distribution in a much simpler manner herein, and related with outage more intuitively. The high-SNR asymptotic error rate is also characterized under diversity combining schemes with the channel power gain of each branch having a regularly varying CDF. Numerical results are shown to corroborate our theoretical analysis. This dissertation studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the better one is revealed when channel inclusion holds between two DMCs. For the exploitation of this sparsity, an effective iterative algorithm is established based on modifying the orthogonal matching pursuit algorithm. The extension of channel inclusion to continuous channels and its application in ordering phase noises are briefly addressed.
ContributorsZhang, Yuan (Author) / Tepedelenlioğlu, Cihan (Thesis advisor) / Zhang, Junshan (Committee member) / Reisslein, Martin (Committee member) / Spanias, Andreas (Committee member) / Arizona State University (Publisher)
Created2013
152589-Thumbnail Image.png
Description
The upstream transmission of bulk data files in Ethernet passive optical networks (EPONs) arises from a number of applications, such as data back-up and multimedia file upload. Existing upstream transmission approaches lead to severe delays for conventional packet traffic when best-effort file and packet traffic are mixed. I propose and

The upstream transmission of bulk data files in Ethernet passive optical networks (EPONs) arises from a number of applications, such as data back-up and multimedia file upload. Existing upstream transmission approaches lead to severe delays for conventional packet traffic when best-effort file and packet traffic are mixed. I propose and evaluate an exclusive interval for bulk transfer (EIBT) transmission strategy that reserves an EIBT for file traffic in an EPON polling cycle. I optimize the duration of the EIBT to minimize a weighted sum of packet and file delays. Through mathematical delay analysis and verifying simulation, it is demonstrated that the EIBT approach preserves small delays for packet traffic while efficiently serving bulk data file transfers. Dynamic circuits are well suited for applications that require predictable service with a constant bit rate for a prescribed period of time, such as demanding e-science applications. Past research on upstream transmission in passive optical networks (PONs) has mainly considered packet-switched traffic and has focused on optimizing packet-level performance metrics, such as reducing mean delay. This study proposes and evaluates a dynamic circuit and packet PON (DyCaPPON) that provides dynamic circuits along with packet-switched service. DyCaPPON provides (i) flexible packet-switched service through dynamic bandwidth allocation in periodic polling cycles, and (ii) consistent circuit service by allocating each active circuit a fixed-duration upstream transmission window during each fixed-duration polling cycle. I analyze circuit-level performance metrics, including the blocking probability of dynamic circuit requests in DyCaPPON through a stochastic knapsack-based analysis. Through this analysis I also determine the bandwidth occupied by admitted circuits. The remaining bandwidth is available for packet traffic and I analyze the resulting mean delay of packet traffic. Through extensive numerical evaluations and verifying simulations, the circuit blocking and packet delay trade-offs in DyCaPPON is demonstrated. An extended version of the DyCaPPON designed for light traffic situation is introduced in this article as well.
ContributorsWei, Xing (Author) / Reisslein, Martin (Thesis advisor) / Fowler, John (Committee member) / Palais, Joseph (Committee member) / McGarry, Michael (Committee member) / Arizona State University (Publisher)
Created2014