This thesis deals with two aspects of wireless communications. The first aspect is about efficient point-to-point data transmission. To achieve high spectral efficiency, coded modulation, which is a concatenation of higher order modulation with error-correcting coding, is used. Bit-interleaved coded modulation (BICM) is a pragmatic approach to coded modulation, where soft information on encoded...

factor  is introduced for direct head loss calculation and sizing in dual-diameter laterals of sprinkler and trickle irrigation systems when the hazen-williams equation is to be applied. application of this factor prevents trial and error and uses fewer head-loss equations in calculating the total friction loss and designing dual-diameter laterals. the proposed factor is a function of total num...

von Davier, Holland and Thayer (2004) laid out a five-step framework of test equating which can be applied to various data collection designs and equating methods. In the continuization step, they present an adjusted Gaussian kernel method which preserves the first two moments. This paper proposes an alternative continuization method which directly uses the log-linear function from the smoothin...

The 1999 NIST Speaker Recognition Evaluation encompassed three tasks: one-speaker detection, two-speaker detection, and speaker tracking. All tasks were performed in the context of conversational telephone speech. The one-speaker task used single channel mu-law data; the other tasks used summed twochannel data. Twelve sites from the United States, Europe, and India participated in the evaluatio...

Abstract: The U, V method of estimation provides unbiased estimators or predictors of random quantities. The method was introduced by Robbins [3] and subsequently studied in a series of papers by Robbins and Zhang. (See Zhang [5].) Practical applications of the method are featured in these papers. We demonstrate that for one U function (one for which there is an important application) the V est...

Using differentiability assumptions on the loss function and a concentration inequality for bounded second order differences it is shown that the generalization error for classification with L2 regularisation obeys a Bernstein-type inequality.

The communication complexity of a two-variable function f (x , y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether 1) the worst case or average number of bits is considered, 2) computation errors are allowed or not, and 3) randomiza...

We consider the learning task consisting in predicting as well as the best function in a finite reference set G up to the smallest possible additive term. If R(g) denotes the generalization error of a prediction function g, under reasonable assumptions on the loss function (typically satisfied by the least square loss when the output is bounded), it is known that the progressive mixture rule ĝ ...