Implementation Aspects of a Transmitted-Reference UWB Receiver

In this paper, we discuss the design issues of an ultra wide band (UWB) receiver targeting a single-chip CMOS implementation for low data-rate applications like ad hoc wireless sensor networks. A non-coherent transmitted reference (TR) receiver is chosen because of its small complexity compared to other architectures. After a brief recapitulation of the UWB fundamentals and a short discussion on the major differences between coherent and non-coherent receivers, we discuss issues, challenges and possible design solutions. Several simulation results obtained by means of a behavioral model are presented, together with an analysis of the trade-off between performance and complexity in an integrated circuit implementation

Descriptional complexity of cellular automata and decidability questions

We study the descriptional complexity of cellular automata (CA), a parallel model of computation. We show that between one of the simplest cellular models, the realtime-OCA. and "classical" models like deterministic finite automata (DFA) or pushdown automata (PDA), there will be savings concerning the size of description not bounded by any recursive function, a so-called nonrecursive trade-off. Furthermore, nonrecursive trade-offs are shown between some restricted classes of cellular automata. The set of valid computations of a Turing machine can be recognized by a realtime-OCA. This implies that many decidability questions are not even semi decidable for cellular automata. There is no pumping lemma and no minimization algorithm for cellular automata

Technology for an intelligent, free-flying robot for crew and equipment retrieval in space

Crew rescue and equipment retrieval is a Space Station Freedom requirement. During Freedom's lifetime, there is a high probability that a number of objects will accidently become separated. Members of the crew, replacement units, and key tools are examples. Retrieval of these objects within a short time is essential. Systems engineering studies were conducted to identify system requirements and candidate approaches. One such approach, based on a voice-supervised, intelligent, free-flying robot was selected for further analysis. A ground-based technology demonstration, now in its second phase, was designed to provide an integrated robotic hardware and software testbed supporting design of a space-borne system. The ground system, known as the EVA Retriever, is examining the problem of autonomously planning and executing a target rendezvous, grapple, and return to base while avoiding stationary and moving obstacles. The current prototype is an anthropomorphic manipulator unit with dexterous arms and hands attached to a robot body and latched in a manned maneuvering unit. A precision air-bearing floor is used to simulate space. Sensor data include two vision systems and force/proximity/tactile sensors on the hands and arms. Planning for a shuttle file experiment is underway. A set of scenarios and strawman requirements were defined to support conceptual development. Initial design activities are expected to begin in late 1989 with the flight occurring in 1994. The flight hardware and software will be based on lessons learned from both the ground prototype and computer simulations

Avionics test bed development plan

A development plan for a proposed avionics test bed facility for the early investigation and evaluation of new concepts for the control of large space structures, orbiter attached flex body experiments, and orbiter enhancements is presented. A distributed data processing facility that utilizes the current laboratory resources for the test bed development is outlined. Future studies required for implementation, the management system for project control, and the baseline system configuration are defined. A background analysis of the specific hardware system for the preliminary baseline avionics test bed system is included

On the descriptional complexity of iterative arrays

The descriptional complexity of iterative arrays (lAs) is studied. Iterative arrays are a parallel computational model with a sequential processing of the input. It is shown that lAs when compared to deterministic finite automata or pushdown automata may provide savings in size which are not bounded by any recursive function, so-called non-recursive trade-offs. Additional non-recursive trade-offs are proven to exist between lAs working in linear time and lAs working in real time. Furthermore, the descriptional complexity of lAs is compared with cellular automata (CAs) and non-recursive trade-offs are proven between two restricted classes. Finally, it is shown that many decidability questions for lAs are undecidable and not semidecidable

A Survey of Prediction and Classification Techniques in Multicore Processor Systems

In multicore processor systems, being able to accurately predict the future provides new optimization opportunities, which otherwise could not be exploited. For example, an oracle able to predict a certain application\u27s behavior running on a smart phone could direct the power manager to switch to appropriate dynamic voltage and frequency scaling modes that would guarantee minimum levels of desired performance while saving energy consumption and thereby prolonging battery life. Using predictions enables systems to become proactive rather than continue to operate in a reactive manner. This prediction-based proactive approach has become increasingly popular in the design and optimization of integrated circuits and of multicore processor systems. Prediction transforms from simple forecasting to sophisticated machine learning based prediction and classification that learns from existing data, employs data mining, and predicts future behavior. This can be exploited by novel optimization techniques that can span across all layers of the computing stack. In this survey paper, we present a discussion of the most popular techniques on prediction and classification in the general context of computing systems with emphasis on multicore processors. The paper is far from comprehensive, but, it will help the reader interested in employing prediction in optimization of multicore processor systems

Gear shift strategies for automotive transmissions

The development history of automotive engineering has shown the essential role of transmissions in road vehicles primarily powered by internal combustion engines. The engine with its physical constraints on the torque and speed requires a transmission to have its power converted to the drive power demand at the vehicle wheels. Under dynamic driving conditions, the transmission is required to shift in order to match the engine power with the changing drive power. Furthermore, a gear shift decision is expected to be consistent such that vehicle can remain in the next gear for a period of time without deteriorating the acceleration capability. Therefore, an optimal conversion of the engine power plays a key role in improving the fuel economy and driveability. Moreover, the consequences of the assumptions related to the discrete state variable-dependent losses, e.g. gear shifting, clutch slippage and engine starting, and their e¿ect on the gear shift control strategy are necessary to be analyzed to yield insights into the fuel usage. The ¿rst part of the thesis deals with the design of gear shift strategies for electronically controlled discrete ratio transmissions used in both conventional vehicles and Hybrid Electric Vehicles (HEVs). For conventional vehicles, together with the fuel economy, the driveability is systematically addressed in a Dynamic Programming (DP) based optimal gear shift strategy by three methods: i) the weighted inverse of the power re¬serve, ii) the constant power reserve, and iii) the variable power reserve. In addition, a Stochastic Dynamic Programming (SDP) algorithm is utilized to optimize the gear shift strategy, subject to a stochastic distribution of the power request, in order to minimize the expected fuel consumption over an in¿nite horizon. Hence, the SDP-based gear shift strategy intrinsically respects the driveability and is realtime implementable. By per¬forming a comparative analysis of all proposed gear shift methods, it is shown that the variable power reserve method achieves the highest fuel economy without deteriorating the driveability. Moreover, for HEVs, a novel fuel-optimal control algorithm, consist-ing of the continuous power split and discrete gear shift, engine on-o¿ problems, based on a combination of DP and Pontryagin’s Minimum Principle (PMP) is developed for the corresponding hybrid dynamical system. This so-called DP-PMP gear shift control approach benchmarks the development of an online implementable control strategy in terms of the optimal tradeo¿ between calculation accuracy and computational e¿ciency. Driven by an ultimate goal of realizing an online gear shift strategy, a gear shift map design methodology for discrete ratio transmissions is developed, which is applied for both conventional vehicles and HEVs. The design methodology uses an optimal gear shift algorithm as a basis to derive the optimal gear shift patterns. Accordingly, statis¬tical theory is applied to analyze the optimal gear shift pattern in order to extract the time-invariant shift rules. This alternative two-step design procedure makes the gear shift map: i) respect the fuel economy and driveability, ii) be consistent and robust with respect to shift busyness, and iii) be realtime implementation. The design process is ¿exible and time e¿cient such that an applicability to various powertrain systems con¿gured with discrete ratio transmissions is possible. Furthermore, the study in this thesis addresses the trend of utilizing the route information in the powertrain control system by proposing an integrated predictive gear shift strategy concept, consisting of a velocity algorithm and a predictive algorithm. The velocity algorithm improves the fuel economy in simulation considerably by proposing a fuel-optimal velocity trajectory over a certain driving horizon for the vehicle to follow. The predictive algorithm suc¬cessfully utilizes a prede¿ned velocity pro¿le over a certain horizon in order to realize a fuel economy improvement very close to that of the globally optimal algorithm (DP). In the second part of the thesis, the energetic losses, involved with the gear shift and engine start events in an automated manual transmission-based HEV, are modeled. The e¿ect of these losses on the control strategies and fuel consumption for (non-)powershift transmission technologies is investigated. Regarding the gear shift loss, the study ¿rstly ever discloses a perception of a fuel-e¿cient advantage of the powershift transmissions over the non-powershift ones applied for commercial vehicles. It is also shown that the engine start loss can not be ignored in seeking for a fair evaluation of the fuel economy. Moreover, the sensitivity study of the fuel consumption with respect to the prediction horizon reveals that a predictive energy management strategy can realize the highest achievable fuel economy with a horizon of a few seconds ahead. The last part of the thesis focuses on investigating the sensitivity of an optimal gear shift strategy to the relevant control design objectives, i.e. fuel economy, driveability and comfort. A singu¬lar value decomposition based method is introduced to analyze the possible correlations and interdependencies among the design objectives. This allows that some of the pos¬sible dependent design objective(s) can be removed from the objective function of the corresponding optimal control problem, hence thereby reducing the design complexity