The idea for the thesis “Construction and implementation of a mobile prototype; The Lovebomb” originates from doctoral candidates Rebecca Hansson and Tobias Skog from PLAY Research Group at the Interactive Institute in Gothenburg. The object of the master thesis is to construct two working LoveBomb prototypes, one mother console belonging to the LoveBomb and blueprints for both. The LoveBomb (the picture to the right shows a possible design) is intended to encourage people to express themselves emotionally when situated amongst strangers in public spaces. Two buttons control the device, which contains a radio transceiver. By pushing the buttons the user can either send a happy message or a sad message. The LoveBombs in the vicinity receive the sent message and lets its user know which message that has been received by vibrating either a sad irregular pulse or a happy continuous pulse. While vibrating the LoveBomb send out a confirm message. The confirm message can only be received by a LoveBomb which has recently sent out a message. After receiving a confirm message the LoveBomb conveys this to the user by turning on a red LED (light emitting diode) and letting the LED shine for about half a minute. During this time the LoveBomb can only receive messages. If it receives a message, during these 30 seconds, the LED is turned off and the prototype starts vibrating according to the received message. Should a LoveBomb which has sent a message fail to receive a confirm message it conveys this to the user by turning on and off the LED three times. After this the prototype is ready to send another message. The picture below shows a state diagram of the LoveBomb. The mother console registers all the communication between the LoveBomb, by pushing a button the user can see how many happy respectively sad messages that has been sent. Our workstarted with the doctoral candidates communicating their thoughts and wishes concerning the prototype to us. We organized this information into a requirement specification. We started the development of the Lovebomb and the belonging mother console by selecting a suitable micro controller. We choose PIC16C84 from Microchip but changed later to its successor PIC16F84, because the latter was easier to get a hold of. The micro controller controls all the other components. When we knew how to program the micro controller, we started working with a transceiver, suggested by the doctoral candidates, DR3001 from RFM. After establishing a meaningful communication between two micro controllers connected with on transceiver each, this was the hardest and most important part, we began working with not so vital component such as diodes, vibrators and buttons. When we were finished with the implementation and construction we examined the prototype and compared it to the requirement specification. To our satisfaction the prototype did not differ a lot from the requirements and the existing differences were improvements from the original idea. During the development process both of us learned a lot about assembler programming, electrical engineering and radio communication.

This report introduces XASM, a generic and retargetable assembler that can be used as a stand-alone tool, as well as a Java library or framework providing assembler-related Java classes for application programs. It is not necessary to modify or recompile the assembler in order to adapt it to new target architectures. Retargetability is achieved by Opcode Maps, a textual description of the instruction mnemonics and encodings of the target architecture, for which to generate machine code. Opcode maps feature an inheritance model, which makes them clearer and also means less effort in describing an instruction set because only the extensions compared to its binary compatible parent instruction set(s) need to be specified.

The FermaT Transformation Engine is an industrial strength toolset for the migration of Assembler and Cobol based legacy systems to C. It uses an intermediate language and several dozen mathematical proven transformations to raise the abstraction level of a source code or to restructure and simplify it as needed. The actual program transformation process with the aid of this toolset is semi-automated which means that a maintainer has not only to apply one transformation after another but also to evaluate the transformation result. This can be a very difficult task especially if the given program is very large and if a lot of transformations have to be applied. Moreover, it cannot be assured that a transformation target will be achieved because it relies on the decisions taken by the respective maintainer which in turn are based on his personal knowledge. Even a small mistake can lead to a failure of the entire program transformation process which usually causes an extensive and time consuming backtrack. Furthermore, it is difficult to compare the results of different transformation sequences applied on the same program. To put it briefly, the manual approach is inflexible and often hard to use especially for maintainers with little knowledge about transformation theory. There already exist different approaches to solve these well known problems and to simplify the accessibility of the FermaT Transformation Engine. One recently presented approach is based on a particular prediction technique whereas another is based on various search tactics. Both intend to automatise the program transformation process. However, the approaches solve some problems but not without introducing others. On the one hand, the prediction based approach is very fast but often not able to provide a transformation sequence which achieves the defined program transformation targets. The results depend a lot on the algorithms which analyse the given program and on the knowledge which is available to make the right decisions during the program transformation process. On the other hand, the search based approach usually finds suitable results in terms of the given target but only in combination with small programs and short transformation sequences. It is simply not possible to perform an extensive search on a large-scale program in reasonable time. To solve the described problems and to extend the operating range of the FermaT Transformation Engine, this thesis proposes a constraint based program transformation system. The approach is semi-automated and provides the possibility to outline an entire program transformation process on the basis of constraints and transformation schemes. In this context, a constraint is a condition which has to be satisfied at some point during the application of a transformation sequence whereas a transformation scheme defines the search space which consists of a set of transformation sequences. After the constraints and the scheme have been defined, the system uses a unique knowledge-based prediction technique followed by a particular search tactic to reduce the number of transformation sequences within the search space and to find a transformation sequence which is applicable and which satisfies the given constraints. Moreover, it is possible to describe those transformation schemes with the aid of a formal language. The presented thesis will provide a definition and a classification of constraints for program transformations. It will discuss capabilities and effects of transformations and their value to define transformation sets. The modelling of program transformation processes with the aid of transformation schemes which in turn are based on finite automata will be presented and the inclusion of constraints into these schemes will be explained. A formal language to describe transformation schemes will be introduced and the automated construction of these schemes from the language will be shown. Furthermore, the thesis will discuss a unique prediction technique which uses the capabilities of transformations, an evaluation of the transformation sequences on the basis of transformation effects and a particular search tactic which is related to linear and tree search tactics. The practical value of the presented approach will be proven with the aid of three medium-scale case studies. The first one will show how to raise the abstraction level whereas the second one will show how to decrease the complexity of a particular program. The third one will show how to increase the execution speed of a selected program. Moreover, the work will be summarised and evaluated on the basis of the research questions. Its limitations will be disclosed and some suggestion for future work will be made.

<p>Nimo Verken AB is the leading producer in the Scandinavia of drying cabinets. The construction has, with small changes, been the same since the 70s with a thermostat and a timer as controlling system. There was a wish to develop a modern cabinet which showed remaining time on a display and with energy saving functions.</p><p>In this report we go through how it is possible to implement a digital controlling system, where remaining time is shown on a display and where it is possible to choose a preset “program”.</p><p>The report first presents the fundamental theory for a PIC, where we describe the different registers, how interrupts are handled, the internal clock function and how data is sent to control the different parts of the construction.</p><p>Next the report presents and describes the new hardware that is needed, such as the encoder, the temperature sensor and the display.</p><p>After the theory we describe how the program in the PIC may be drafted. Last in the report we have the result of the tests of the temperature variations and the accuracy of the time.</p>

Nimo Verken AB is the leading producer in the Scandinavia of drying cabinets. The construction has, with small changes, been the same since the 70s with a thermostat and a timer as controlling system. There was a wish to develop a modern cabinet which showed remaining time on a display and with energy saving functions. In this report we go through how it is possible to implement a digital controlling system, where remaining time is shown on a display and where it is possible to choose a preset “program”. The report first presents the fundamental theory for a PIC, where we describe the different registers, how interrupts are handled, the internal clock function and how data is sent to control the different parts of the construction. Next the report presents and describes the new hardware that is needed, such as the encoder, the temperature sensor and the display. After the theory we describe how the program in the PIC may be drafted. Last in the report we have the result of the tests of the temperature variations and the accuracy of the time.

No description available.

The following dissertation attempts to highlight and address the implementation and performance of a Kalman filter on an FPGA. The reasons for choosing the Kalman filter and the platform for implementation are highlighted as well as an in depth explanation of the components and theory behind both are given. A controller system which allows the optimal performance of the Kalman filter on it is developed in VHDL. The design of the controller is dictated by the analysis of the Kalman filter which ensures only the most necessary components and operations are built into the instruction set. The controller is made up of several components including the loader, the ALU, Data RAM, KF IO, Control Store and the Branch Unit. The components working in conjunction allows the system to interface though a handshaking protocol with a peripheral of arbitrary latency. The control store is loaded with program code that is determined by converting human readable assembler into machine code through a Perl encoder. The controller system is tested and verified though an extensive testbench environment that emulates all outside signals and views internal operations. The controller system is capable of five matrix operations which are computed in parallel due to the FPGA development environment, which is far superior in this case to the alternative: a software solution, due to the vector operations inherent in the Kalman filter algorithm. The Kalman filter operation is analyzed and simulated in a MATLAB environment and this analysis confirms the need for the parallel processing power of the FPGA system upon which the controller has been built. FPGA statistical analysis confirms the successful implementation of the system meeting all criteria set at the outset of the project, including memory usage, IO usage and performance and accuracy benchmarks. / Graduate

The goal of this thesis study is to develop a simulator toolkit for Motorola&rsquo / s 8-bit microcontroller MC6811. The toolkit contains a cross-assembler to obtain object code from the source code and a simulator to run the object code. Written document of this thesis study describes the properties of the MC6811 microcontroller and its assembly language. In addition, the document describes the cross-assembler and simulator parts of the toolkit with details. In the cross-assembler part of the toolkit, parsing of the source Code and processing of the parsed information is studied. The simulator part studies the execution of the object code generated by the crossassembler. The execution of each instruction and main functions of the microcontroller can be observed from a Graphical User Interface (GUI). The Central Processing Unit (CPU), the busses, ports and interrupts of the microcontroller are included into the GUI. C++ programming language is used to develop and to implement the toolkit.

Thesis (M. Sc.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 83-86).

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação. / Made available in DSpace on 2013-07-15T23:31:04Z (GMT). No. of bitstreams: 1 212537.pdf: 5484731 bytes, checksum: 2122072c551f935db21ad987880ff10d (MD5)