No description available.

Chen, Hok. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 69-71). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Review of benchmarking methods --- p.8 / Chapter 2.1 --- Regression method --- p.9 / Chapter 2.2 --- Signal extraction method with known autocovariance of signal --- p.11 / Chapter 2.3 --- Signal extraction method with unknown autocovariance of signal --- p.16 / Chapter 3 --- Survey error modelling for MA(1) model --- p.21 / Chapter 3.1 --- A method proposed by Chow and Lin --- p.21 / Chapter 3.2 --- An alternate method proposed by Chen and Wu --- p.28 / Chapter 3.2.1 --- Original sketch for estimating 0 using annual benchmarks --- p.28 / Chapter 3.2.2 --- Nonstationary assumption for η(t) --- p.30 / Chapter 3.2.3 --- Estimating ve*ε(k) from data --- p.34 / Chapter 3.2.4 --- Simulation results --- p.36 / Chapter 4 --- Simulation Studies on Benchmarking --- p.42 / Chapter 4.1 --- Simulation procedure --- p.42 / Chapter 4.2 --- Simulation results --- p.46 / Chapter 5 --- Conclusion --- p.66 / References --- p.68

There are a large number of investors and companies reliant upon analyst earnings forecasts. Missing analyst forecasts can have a massive impact on share price and investors often look to these values to make decisions regarding future investment decisions. However, there has been a great deal of speculation about these forecasts and especially the error associated with them. With the threat of an impending recession, it is important to know the reliability of forecasts during times leading up to recessions. More specifically, this study aims to see how the level of error associated with analyst earnings forecasts change leading up to recessions and whether or not they should be relied upon as heavily during these times.

This document has could not be found.

In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis, first, the capacity of the asymmetric channel is derived. The capacity of the binary symmetric channel (BSC) and the Z-channel can be derived from this expression as special cases. Second, the error detecting capability of Bose-Lin codes beyond the maximum designed error detection capability are described. Third, a new class of a systematic t-unidirectional error detecting codes over Z [subscript m], m≥2 is designed. These codes can detect 2 errors using r=2 check bits and up to m[superscript (r-2)] + r-2 errors using r>2 check bits. Some upper bound on the maximum number of detectable errors when using r check bits are given. Finally, some analysis on the data throughput when using the following protocols over the m-ary Z-Channel, m≥2 are derived: (1) ARQ protocols using t-Asymmetric Error Detecting (t-AED) codes. (2) ARQ protocols using All Asymmetric Error Detecting (AAED) codes. (3) Type-I Hybrid ARQ protocols using t-Asymmetric Error Correcting and All Asymmetric Error Detecting (t-EC/AAED) codes. (4) ARQ Protocols with diversity combining using t-Asymmetric Error Correcting and All Asymmetric Error Detecting (t-EC/AAED) codes. Finally, some open research problems are described. / Graduation date: 2005

In Shannon’s seminal paper, “A Mathematical Theory of Communication”, he defined ”Channel Capacity” which predicted the ultimate performance that transmission systems can achieve and suggested that capacity is achievable by error-correcting (channel) coding. The main idea of error-correcting codes is to add redundancy to the information to be transmitted so that the receiver can explore the correlation between transmitted information and redundancy and correct or detect errors caused by channels afterward. The discovery of turbo codes and rediscovery of Low Density Parity Check codes (LDPC) have revived the research in channel coding with novel ideas and techniques on code concatenation, iterative decoding, graph-based construction and design based on density evolution. This dissertation focuses on the design aspect of graph-based channel codes such as LDPC and Irregular Repeat Accumulate (IRA) codes via density evolution, and use the technique (density evolution) to design IRA codes for scalable image/video communication and LDPC codes for distributed source coding, which can be considered as a channel coding problem. The first part of the dissertation includes design and analysis of rate-compatible IRA codes for scalable image transmission systems. This part presents the analysis with density evolution the effect of puncturing applied to IRA codes and the asymptotic analysis of the performance of the systems. In the second part of the dissertation, we consider designing source-optimized IRA codes. The idea is to take advantage of the capability of Unequal Error Protection (UEP) of IRA codes against errors because of their irregularities. In video and image transmission systems, the performance is measured by Peak Signal to Noise Ratio (PSNR). We propose an approach to design IRA codes optimized for such a criterion. In the third part of the dissertation, we investigate Slepian-Wolf coding problem using LDPC codes. The problems to be addressed include coding problem involving multiple sources and non-binary sources, and coding using multi-level codes and nonbinary codes.

With shrinking feature size and growing integration density in the Deep Sub- Micron (DSM) technologies, the global buses are fast becoming the "weakest-links" in VLSI design. They have large delays and are error-prone. Especially, in system-onchip (SoC) designs, where parallel interconnects run over large distances, they pose difficult research and design problems. This work presents an approach for evaluating the data carrying capacity of such wires. The method treats the delay and reliability in interconnects from an information theoretic perspective. The results point to an optimal frequency of operation for a given bus dimension for maximum data transfer rate. Moreover, this optimal frequency is higher than that achieved by present day designs which accommodate the worst case delays. This work also proposes several novel ways to approach this optimal data transfer rate in practical designs.From the analysis of signal propagation delay in long wires, it is seen that the signal delay distribution has a long tail, meaning that most signals arrive at the output much faster than the worst case delay. Using communication theory, these "good" signals arriving early can be used to predict/correct the "few" signals that arrive late. In addition to this correction based on prediction, the approaches use coding techniques to eliminate high delay cases to generate a higher transmission rate. The work also extends communication theoretic approaches to other areas of VLSI design. Parity groups are generated based on low output delay correlation to add redundancy in combinatorial circuits. This redundancy is used to increase the frequency of operation and/or reduce the energy consumption while improving the overall reliability of the circuit.

Thesis (M.S.)--West Virginia University, 2002. / Title from document title page. Document formatted into pages; contains xvii, 121, [13] p. : ill. (some col.). Vita. Includes abstract. Includes bibliographical references (p. 109-113).

Thesis (Ph. D.)--Oregon State University, 2010. / Printout. Includes bibliographical references (leaves 47-48). Also available on the World Wide Web.

Not available