Matching Items (169)
Filtering by
- Genre: Academic theses
- Creators: Rogers, Rodney
- Creators: Tepedelenlioğlu, Cihan
- Member of: Theses and Dissertations
- Status: Published
Description
Knowing that disorder is related to crime, it has become essential for criminologists to understand how and why certain individuals perceive disorder. Using data from the Perceptions of Neighborhood Disorder and Interpersonal Conflict Project, this study uses a fixed photograph of a neighborhood, to assess whether individuals "see" disorder cues. A final sample size of n=815 respondents were asked to indicate if they saw particular disorder cues in the photograph. The results show that certain personal characteristics do predict whether an individual sees disorder. Because of the experimental design, results are a product of the individual's personal characteristics, not of the respondent's neighborhood. These findings suggest that the perception of disorder is not as clear cut as once thought. Future research should explore what about these personal characteristics foster the perception of disorder when it is not present, as well as, how to fight disorder in neighborhoods when perception plays such a substantial role.
ContributorsScott, Christopher (Author) / Wallace, Danielle (Thesis advisor) / Katz, Charles (Committee member) / Ready, Justin (Committee member) / Arizona State University (Publisher)
Created2013
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. 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, 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
Description
Global Positioning System (GPS) is a navigation system widely used in civilian and military application, but its accuracy is highly impacted with consequential fading, and possible loss of communication due to multipath propagation and high power interferences. This dissertation proposes alternatives to improve the performance of the GPS receivers to obtain a system that can be reliable in critical situations. The basic performance of the GPS receiver consists of receiving the signal with an antenna array, delaying the signal at each antenna element, weighting the delayed replicas, and finally, combining the weighted replicas to estimate the desired signal. Based on these, three modifications are proposed to improve the performance of the system. The first proposed modification is the use of the Least Mean Squares (LMS) algorithm with two variations to decrease the convergence time of the classic LMS while achieving good system stability. The results obtained by the proposed LMS demonstrate that the algorithm can achieve the same stability as the classic LMS using a small step size, and its convergence rate is better than the classic LMS using a large step size. The second proposed modification is to replace the uniform distribution of the time delays (or taps) by an exponential distribution that decreases the bit-error rate (BER) of the system without impacting the computational efficiency of the uniform taps. The results show that, for a BER of 0.001, the system can operate with a 1 to 2 dB lower signal-to-noise ratio (SNR) when an exponential distribution is used rather than a uniform distribution. Finally, the third modification is implemented in the design of the antenna array. In this case, the gain of each microstrip element is enhanced by embedding ferrite rings in the substrate, creating a hybrid substrate. The ferrite rings generates constructive interference between the incident and reflected fields; consequently, the gain of a single microstrip element is enhanced by up to 4 dB. When hybrid substrates are used in microstrip element arrays, a significant enhancement in angle range is achieved for a given reflection coefficient compared to using a conventional substrate.
ContributorsRivera-Albino, Alix (Author) / Balanis, Constantine A (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Kiaei, Sayfe (Committee member) / Aberle, James T (Committee member) / Arizona State University (Publisher)
Created2013
Description
The processing power and storage capacity of portable devices have improved considerably over the past decade. This has motivated the implementation of sophisticated audio and other signal processing algorithms on such mobile devices. Of particular interest in this thesis is audio/speech processing based on perceptual criteria. Specifically, estimation of parameters from human auditory models, such as auditory patterns and loudness, involves computationally intensive operations which can strain device resources. Hence, strategies for implementing computationally efficient human auditory models for loudness estimation have been studied in this thesis. Existing algorithms for reducing computations in auditory pattern and loudness estimation have been examined and improved algorithms have been proposed to overcome limitations of these methods. In addition, real-time applications such as perceptual loudness estimation and loudness equalization using auditory models have also been implemented. A software implementation of loudness estimation on iOS devices is also reported in this thesis. In addition to the loudness estimation algorithms and software, in this thesis project we also created new illustrations of speech and audio processing concepts for research and education. As a result, a new suite of speech/audio DSP functions was developed and integrated as part of the award-winning educational iOS App 'iJDSP." These functions are described in detail in this thesis. Several enhancements in the architecture of the application have also been introduced for providing the supporting framework for speech/audio processing. Frame-by-frame processing and visualization functionalities have been developed to facilitate speech/audio processing. In addition, facilities for easy sound recording, processing and audio rendering have also been developed to provide students, practitioners and researchers with an enriched DSP simulation tool. Simulations and assessments have been also developed for use in classes and training of practitioners and students.
ContributorsKalyanasundaram, Girish (Author) / Spanias, Andreas S (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Berisha, Visar (Committee member) / Arizona State University (Publisher)
Created2013
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, 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
Description
Autonomous vehicle control systems utilize real-time kinematic Global Navigation Satellite Systems (GNSS) receivers to provide a position within two-centimeter of truth. GNSS receivers utilize the satellite signal time of arrival estimates to solve for position; and multipath corrupts the time of arrival estimates with a time-varying bias. Time of arrival estimates are based upon accurate direct sequence spread spectrum (DSSS) code and carrier phase tracking. Current multipath mitigating GNSS solutions include fixed radiation pattern antennas and windowed delay-lock loop code phase discriminators. A new multipath mitigating code tracking algorithm is introduced that utilizes a non-symmetric correlation kernel to reject multipath. Independent parameters provide a means to trade-off code tracking discriminant gain against multipath mitigation performance. The algorithm performance is characterized in terms of multipath phase error bias, phase error estimation variance, tracking range, tracking ambiguity and implementation complexity. The algorithm is suitable for modernized GNSS signals including Binary Phase Shift Keyed (BPSK) and a variety of Binary Offset Keyed (BOC) signals. The algorithm compensates for unbalanced code sequences to ensure a code tracking bias does not result from the use of asymmetric correlation kernels. The algorithm does not require explicit knowledge of the propagation channel model. Design recommendations for selecting the algorithm parameters to mitigate precorrelation filter distortion are also provided.
ContributorsMiller, Steven (Author) / Spanias, Andreas (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Tsakalis, Konstantinos (Committee member) / Zhang, Junshan (Committee member) / Arizona State University (Publisher)
Created2013
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 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
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. 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
Description
The field of education has been immensely benefited by major breakthroughs in technology. The arrival of computers and the internet made student-teacher interaction from different parts of the world viable, increasing the reach of the educator to hitherto remote corners of the world. The arrival of mobile phones in the recent past has the potential to provide the next paradigm shift in the way education is conducted. It combines the universal reach and powerful visualization capabilities of the computer with intimacy and portability. Engineering education is a field which can exploit the benefits of mobile devices to enhance learning and spread essential technical know-how to different parts of the world. In this thesis, I present AJDSP, an Android application evolved from JDSP, providing an intuitive and a easy to use environment for signal processing education. AJDSP is a graphical programming laboratory for digital signal processing developed for the Android platform. It is designed to provide utility; both as a supplement to traditional classroom learning and as a tool for self-learning. The architecture of AJDSP is based on the Model-View-Controller paradigm optimized for the Android platform. The extensive set of function modules cover a wide range of basic signal processing areas such as convolution, fast Fourier transform, z transform and filter design. The simple and intuitive user interface inspired from iJDSP is designed to facilitate ease of navigation and to provide the user with an intimate learning environment. Rich visualizations necessary to understand mathematically intensive signal processing algorithms have been incorporated into the software. Interactive demonstrations boosting student understanding of concepts like convolution and the relation between different signal domains have also been developed. A set of detailed assessments to evaluate the application has been conducted for graduate and senior-level undergraduate students.
ContributorsRanganath, Suhas (Author) / Spanias, Andreas (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Tsakalis, Konstantinos (Committee member) / Arizona State University (Publisher)
Created2013