Controlled elements for designing ciphers suitable to efficient VLSI implementation

This work considers the problem of increasing the performance of the ciphers based on Data-Dependent (DD) operations (DDO) for VLSI implementations. New minimum size primitives are proposed to design DDOs. Using advanced DDOs instead of DD permutations (DDP) in the DDP-based iterative ciphers Cobra-H64 and Cobra-H128 the number of rounds has been significantly reduced yielding enhancement of the “performance per cost” value and retaining security at the level of indistinguishability from a random transformation. To obtain further enhancement of this parameter a new crypto-scheme based on the advanced DDOs is proposed. The FPGA implementation of the proposed crypto-scheme achieves higher throughput value and minimizes the allocated resources than the conventional designs. Design of the DDO boxes of different orders is considered and their ASIC implementation is estimated.     

Sequential testing of sorted and transformed data as an efficient way to implement long GLRTs

It is often required to detect a long weak signal in Gaussian noise, and frequently, the exact form of that signal is parameterized but not known. A bank of matched filters provides an appropriate detector. However, in some practical applications, there are very many matched filters, and most are quite long. The consequent computational needs may render the classical bank-of-filters approach infeasibly expensive. One example, and our original motivation, is the detection of chirp gravitational waves by an Earth-based interferometer. In this paper, we provide a computational approach to this problem via sequential testing. Since the sequential tests to be used are not for constant signals, we develop the theory in terms of average sample number (ASN) for this case. Specifically, we propose two easily calculable expressions for the ASN: one a bound and the other an approximation. The sequential approach does yield moderate computational savings, but we find that by preprocessing the data using short/medium fast Fourier transforms (FFTs) and an appropriate sorting of these FFT outputs such that the most informative samples are entered to a sequential test first, quite high numerical efficiency can be realized. The idea is simple but appears to be quite successful: Examples are presented in which the computational load is reduced by several orders of magnitude. The FFT is an example of an energy-agglomerating transform, but of course, there are many others. The point here is that the transform need not match the sought signal exactly in the sense that all energy becomes confined to a single sample; it is enough that the energy becomes concentrated, and the more concentrated the better.     

Finding all hops shortest paths

In this letter, we introduce and investigate a new problem referred to as the All Hops Shortest Paths (AHSP) problem. The AHSP problem involves selecting, for all hop counts, the shortest paths from a given source to any other node in a network. We derive a tight lower bound on the worst-case computational complexities of the optimal comparison-based solutions to AHSP.     

Control system design on a power-split CVT for high-power agricultural tractors

The problem considered in this paper is the design and tuning of the control system of a power-split continuously variable transmission (CVT) used in high-power tractors. Power-split CVTs are characterized by the combination of a traditional mechanical transmission and by a continuously-variable transmission. This guarantees, at the same time, smooth variations of the transmission-ratio and high efficiency of the overall transmission system. The control architecture of an hydrostatic power-split CVT is constituted by three main parts: 1) servo-controller on the current of the valve which drives the hydraulic transmission; 2) a servo-controller on the hydraulic transmission-ratio; and 3) a synchronizer which coordinates the hydraulic and the mechanical parts of the CVT. In this work, these three controllers are fully developed, including: design, implementation, and evaluation on an experimental system.     

On-demand learning for a wireless campus

The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment.     

Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

High-efficiency LEDs of 1.6–2.4 µm spectral range for medical diagnostics and environment monitoring

High efficient LED structures covering the spectral range of 1.6–2.4 μm have been developed on the basis of GaSb and its solid solutions. The electroluminescent characteristics and their temperature and current dependences have been studied. The radiative and nonradiative recombination mechanisms and their effect on the quantum efficiency have been investigated. A quantum efficiency of 40–60% has been obtained in the quasi-steady mode at room temperature. A short-pulse optical power of 170 mW was reached. __________ Translated from Fizika i Tekhnika Poluprovodnikov, Vol. 37, No. 8, 2003, pp. 996–1009. Original Russian Text Copyright ? 2003 by Stoyanov, Zhurtanov, Astakhova, Imenkov, Yakovlev.     

PNNI-based control plane for automatically switched optical networks

Much effort has been spent on the definition of control plane protocols for automatically switched optical networks (ASON). Most of the proposals brought into the standardization for an International Telecommunications Union-Telecommunication Sector, Internet Engineering Task Force, and Optical Internetworking Forum are based on Internet protocol concepts. One such proposal is the generalized multi-protocol label switching (GMPLS), an extension of the MPLS traffic engineering control plane model that includes nonpacket switched technologies (time, wavelength, and fiber switching). Recently, the potential use of private network-network interface (PNNI) in ASONs has been discussed as an alternative proposal by the standardization bodies. The goal of this paper is to appropriately adapt asynchronous transfer mode into an optical PNNI (O-PNNI) protocol that can be used as the control plane of ASONs. The paper also provides a critical viewpoint on the potential usage of either O-PNNI or GMPLS control plane and analyzes the pros and cons of each. The methodology adopted toward devising O-PNNI hinges on reviewing PNNI along with ASON recommendations in order to determine the set of PNNI features that require adaptation. Having identified these features we engineer and present appropriate solutions relating to routing, signaling and addressing aspects.     

A fuzzy logic based-method for prognostic decision making in breast and prostate cancers

Accurate and reliable decision making in oncological prognosis can help in the planning of suitable surgery and therapy, and generally, improve patient management through the different stages of the disease. In recent years, several prognostic markers have been used as indicators of disease progression in oncology. However, the rapid increase in the discovery of novel prognostic markers resulting from the development in medical technology, has dictated the need for developing reliable methods for extracting clinically significant markers where complex and nonlinear interactions between these markers naturally exist. The aim of this paper is to investigate the fuzzy k-nearest neighbor (FK-NN) classifier as a fuzzy logic method that provides a certainty degree for prognostic decision and assessment of the markers, and to compare it with: 1) logistic regression as a statistical method and 2) multilayer feedforward backpropagation neural networks an artificial neural-network tool, the latter two techniques having been widely used for oncological prognosis. In order to achieve this aim, breast and prostate cancer data sets are considered as benchmarks for this analysis. The overall results obtained indicate that the FK-NN-based method yields the highest predictive accuracy, and that it has produced a more reliable prognostic marker model than both the statistical and artificial neural-network-based methods.