Space‐time ring‐TCM codes with CPM based on the decomposed model for transmission over Rayleigh fading channels

Space–time (ST) coding is a proved technique for achieving high data rates in 3G mobile systems that combines coding, modulation and multiple transmitters and receivers. A novel algorithm is proposed for ST ring trellis‐coded modulation (ST‐RTCM) systems with continuous‐phase modulation (CPM) when the channel coefficients are known to the receiver. This algorithm is based on the CPM decomposed model, which exploits the memory properties of this modulation method, resulting in a straightforward implementation of joint ST coding and CPM, which is particularly suitable for ring codes. This new scheme is used to investigate the performance of the delay diversity code with CPM over slow Rayleigh fading channels, in particular with MSK which is one of the most widely used modulation methods of continuous phase. Furthermore, a feedback version of delay diversity allowed by the decomposition is tested in 1REC and 1RC systems. This feedback configuration is seen to provide good results for low signal‐to‐noise ratios. Simulations results are also provided for multilevel ST‐RTCM codes that achieve a higher throughput than MSK‐coded systems. Additionally the serial concatenation of an outer Reed–Solomon code with an ST‐RTCM code is shown, this combination further reduces the error probability and achieves even more reliable communications. Copyright © 2005 John Wiley & Sons, Ltd.     

Solutions to Industrial Engineering problems using integrated software environments

The development of word processing systems and the spreadsheet environment marked the beginning of the professional computing movement. For the first time, programs were available that were both highly functional and highly usable, even by non-computer people. The next group of “hot” programs in the business market were “integrated” packages providing a combination of word processing, spreadsheet, database, graphics, and telecommunications. Unfortunately, these integrated packages have not displaced such single purpose programs as Lotus 1-2-3, dBase and WordPerfect as the dominant forces in desktop computing. Integrated packages are generally perceived as complex, cumbersome, and difficult to master. An important point to note, however, is that high proficiency is not necessary; successful users of commercial software seldom know or use more that 40% of a programs functionality.

This paper addresses the use of integrated software packages to solve Industrial Engineering problems. More specifically, examples are presented demonstrating the use of Ashton Tate's Framework II to solve production and operations management problems. Sample applications include forecasting, after tax economic analysis, and data storage and retrieval, demonstrating the advantages of linking word processing, spreadsheets, and databases.     

Self-timed Manchester chain carry propagate adder

The authors present a self-timed adder that uses two Manchester chains to propagate carries in a two-rail code. With the inclusion of buffers in the chains, the adder met the timing conditions typical of an asynchronous design based on the `bundled-data, bounded-delay' model and is significantly faster than self-timed adders with restoring logic and similar complexity     

Performance of Reed?Solomon codes using the Guruswami?Sudan algorithm with improved interpolation efficiency

List decoding is a novel method for decoding Reed-Solomon (RS) codes that generates a list of candidate transmitted messages instead of one unique message as with conventional algebraic decoding, making it possible to correct more errors. The Guruswami-Sudan (GS) algorithm is the most efficient list decoding algorithm for RS codes. Until recently only a few papers in the literature suggested practical methods to implement the key steps (interpolation and factorisation) of the GS algorithm that make the list decoding of RS codes feasible. However, the algorithm's high decoding complexity is unsolved and a novel complexity-reduced modification to improve its efficiency is presented. A detailed explanation of the GS algorithm with the complexity-reduced modification is given with simulation results of RS codes for different list decoding parameters over the AWGN and Rayleigh fading channels. A complexity analysis is presented comparing the GS algorithm with our modified GS algorithm, showing the modification can reduce complexity significantly in low error weight situations. Simulation results using the modified GS algorithm show larger coding gains for RS codes with lower code rates, with more significant gains being achieved over the Rayleigh fading channels.     

DOCUMENT TRANSLATION RETRIEVAL BASED ON STATISTICAL MACHINE TRANSLATION TECHNIQUES

We compare different strategies to apply statistical machine translation techniques in order to retrieve documents that are a plausible translation of a given source document. Finding the translated version of a document is a relevant task; for example, when building a corpus of parallel texts that can help to create and evaluate new machine translation systems.

In contrast to the traditional settings in cross-language information retrieval tasks, in this case both the source and the target text are long and, thus, the procedure used to select which words or phrases will be included in the query has a key effect on the retrieval performance. In the statistical approach explored here, both the probability of the translation and the relevance of the terms are taken into account in order to build an effective query.     

ITSE optimal controller design and achievable performance bounds

This article proposes a methodology to design optimal controllers and to compute achievable performance bounds in the control of linear, stable discrete-time SISO plants. The performance is measured using a time-weighted cost function (ITSE) of the tracking error for a step reference or a step output disturbance, combined with a measure of the energy of the incremental control. The proposed methodology relies on the use of a function space product that, for stable systems, can be defined in both the frequency and the time-domains. The solution technique requires the expansion of stable functions in orthogonal basis. An analytical expression is found for the computation of the optimal coefficients of the expansion. Numerical examples are included to illustrate the results.     

Conditions for the equivalence between IQC and graph separation stability results

This paper provides a link between time-domain and frequency-domain stability results in the literature. Specifically, we focus on the comparison between stability results for a feedback interconnection of two nonlinear systems stated in terms of frequency-domain conditions. While the integral quadratic constrain (IQC) theorem can cope with them via a homotopy argument for the Lurye problem, graph separation results require the transformation of the frequency-domain conditions into truncated time-domain conditions. To date, much of the literature focuses on ‘hard’ factorisations of the multiplier, considering only one of the two frequency-domain conditions. Here it is shown that a symmetric, ‘doubly-hard’ factorisation is required to convert both frequency-domain conditions into truncated time-domain conditions. By using the appropriate factorisation, a novel comparison between the results obtained by IQC and separation theories is then provided. As a result, we identify under what conditions the IQC theorem may provide some advantage.