This collection includes scholarly articles produced by EECS faculty and students. http://hdl.handle.net/1957/7303 2013-06-19T19:28:02Z 2013-06-19T19:28:02Z Erwig, Martin Walkingshaw, Eric http://hdl.handle.net/1957/39585 2013-06-19T17:16:05Z 2013-04-01T00:00:00Z

A Visual Language for Explaining Probabilistic Reasoning Erwig, Martin; Walkingshaw, Eric We present an explanation-oriented, domain-specific, visual language for explaining probabilistic reasoning. Explanation-oriented programming is a new paradigm that shifts the focus of programming from the computation of results to explanations of how those results were computed. Programs in this language therefore describe explanations of probabilistic reasoning problems. The language relies on a story-telling metaphor of explanation, where the reader is guided through a series of well-understood steps from some initial state to the final result. Programs can also be manipulated according to a set of laws to automatically generate equivalent explanations from one explanation instance. This increases the explanatory value of the language by allowing readers to cheaply derive alternative explanations if they do not understand the first. The language is comprised of two parts: a formal textual notation for specifying explanation-producing programs and the more elaborate visual notation for presenting those explanations. We formally define the abstract syntax of explanations and define the semantics of the textual notation in terms of the explanations that are produced. This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/journal-of-visual-languages-and-computing/.

2013-04-01T00:00:00Z Rajaee, Omid Moon, Un-Ku http://hdl.handle.net/1957/38188 2013-04-16T00:22:13Z 2013-02-01T00:00:00Z

Highly Linear Noise-Shaped Pipelined ADC Utilizing a Relaxed Accuracy Front-End Rajaee, Omid; Moon, Un-Ku A noise-shaped pipelined ADC is presented in this paper. A minimal complexity ΔΣ modulator in the first two sub-ADCs and residue feedback in the latter stages lead to high-order noise shaping. This also leads to reduced sensitivity to analog imperfections in the front-end stage. Implemented in 0.18μ m CMOS, the ADC achieves 12 ENOB with 64 MHz clock at 6X OSR while using only a 9-bit linear front-end multiplying-DAC (MDAC). The delta-sigma sub-ADCs dissipate 400μ W extra power (out of 13.9mW total power) while significantly enhancing the the overall ADC linearity. This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by IEEE-Institute of Electrical and Electronics Engineers and can be found at: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4. (c) 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

2013-02-01T00:00:00Z Liu, Wei Choi, Kwonhue Liu, Huaping http://hdl.handle.net/1957/38104 2013-04-10T17:58:06Z 2012-08-01T00:00:00Z

Computationally Efficient Lattice Reduction Aided Detection for MIMO-OFDM Systems under Correlated Fading Channels Liu, Wei; Choi, Kwonhue; Liu, Huaping We analyze the relationship between channel coherence bandwidth and two complexity-reduced lattice reduction aided detection (LRAD) algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in correlated fading channels. In both the adaptive LR algorithm and the fixed interval LR algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for the adjacent highly correlated subcarriers. Complexity simulations demonstrate that the adaptive LR algorithm could eliminate up to approximately 90 percent of the multiplications and 95 percent of the divisions of the brute-force LR algorithm with large coherence bandwidth. The results also show that the adaptive algorithm with both optimum and globally suboptimum initial interval settings could significantly reduce the LR complexity, compared with the brute-force LR and fixed interval LR algorithms, while maintaining the system performance. This is the publisher’s final pdf. The published article is copyrighted by Electronics and Telecommunications Research Institute and can be found at: http://etrij.etri.re.kr/.

2012-08-01T00:00:00Z Choi, Hoon Baek, Yunju Lee, Ben http://hdl.handle.net/1957/38103 2013-04-10T00:25:03Z 2013-02-01T00:00:00Z

Efficient Congestion Control Utilizing Message Eavesdropping in Asynchronous Range-Based Localization Choi, Hoon; Baek, Yunju; Lee, Ben Asynchronous ranging is one practical method to implement a locating system that provides accurate results. However, a locating system utilizing asynchronous ranging generates a large number of messages that cause transmission delays or failures and degrades the system performance. This paper proposes a novel approach for efficient congestion control in an asynchronous range-based locating system. The proposed method significantly reduces the number of messages generated during the reader discovery phase by eavesdropping on other transmissions and improves the efficiency of ranging by organizing the tags in a hierarchical fashion in the measurement phase. Our evaluation shows that the proposed method reduces the number of messages by 70% compared to the conventional method and significantly improves the success rate of ranging. This is the publisher’s final pdf. The published article is copyrighted by the Electronics and Telecommunications Research Institute and can be found at: http://etrij.etri.re.kr/.

2013-02-01T00:00:00Z