4,472 research outputs found

    Using Sat solvers for synchronization issues in partial deterministic automata

    Full text link
    We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experimental results demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used.Comment: 15 pages, 3 figure

    Adaptive transmit-side equalization for serial electrical interconnects at 100 Gb/s using duobinary

    Get PDF
    The ever-increasing demand for more efficient data communication calls for new, advanced techniques for high speed serial communication. Although newly developed systems are setting records, off-line determination of the optimal equalizer settings is often needed. Well-known adaptive algorithms are mainly applied for receive-side equalization. However, transmit-side equalization is desirable for its reduced linearity requirements. In this paper, an adaptive sign-sign least mean square equalizer algorithm is developed applicable for an analog transmit-side feed-forward equalizer (FFE) capable of transforming non-return-to-zero modulation to duobinary (DB) modulation at the output of the channel. In addition to the derivation of the update strategy, extra algorithms are developed to cope with the difficult transmit-receive synchronization. Using an analog six tap bit-spaced equalizer, the algorithm is capable of optimizing DB communication of 100Gb/s over 1.5-m Twin-Ax cable. Both simulations and experimental results are presented to prove the capabilities of the algorithm demonstrating automated determination of FFE parameters, such that error-free communication is obtained (BER<10(-13) using PRBS9)

    A Space Communications Study Final Report, Sep. 15, 1965 - Sep. 15, 1966

    Get PDF
    Reception of frequency modulated signals passed through deterministic and random time-varying channel

    Modelaçcão comportamental da camada física NB-IoT - Uplink

    Get PDF
    Mestrado em Engenharia Eletrónica e TelecomunicaçõesA Internet das Coisas (IoT) consiste numa rede sem fios de sensores/atuadores ligados entre si e que têm a capacidade de recolher dados. Devido ao crescimento rápido do mercado IoT, as redes de longa distância e baixa potência (LPWAN) tornaram-se populares. O NarrowBand-IoT (NB-IoT), desenvolvido pela 3rd Generation Partnership Project (3GPP), é um desses protocolos. O principal objectivo desta dissertação é a implementação de uma simulação comportamental em MATLAB do NB-IoT no uplink, que será disponibilizada abertamente. Esta será focada, primariamente, na camada física e nas suas respetivas funcionalidades, nomeadamente turbo coding, modulação SC-FDMA, modelos de simulação de canal, desmodulação SC-FDMA, estimação de canal, equalizador e turbo decoding. A estimação de canal é feita usando símbolos piloto previamente conhecidos. Os modelos de canal utilizados são baseados nas especificações oficiais da 3GPP. A taxa de bits errados (BER) é calculada e usada de forma a avaliar a performance do turbo encoder e do equalizador zero forcing (ZF). Serve também como comparação quando a implementação usa esquemas de modulação diferentes (Binary Phase-Shift Keying (BPSK) e Quadrature Phase-Shift Keying (QPSK)). Além disso, os sinais gerados em MATLAB são transmitidos usando como front-end de radio-frequência (RF) uma Universal Software Radio Peripheral (USRP). Posteriormente, são recebidos, desmodulados e descodificados. Finalmente, é obtida a constelação do sinal, a BER é calculada e os resultados são analisados.The Internet of Things (IoT) refers to a wireless network of interconnected sensors/actuators with data-collecting technologies. Low Power Wide Area Networks (LPWAN) have become popular due to the rapid growth of the IoT market. Narrowband-IoT (NB-IoT), developed by 3rd Generation Partnership Project (3GPP), is one of these protocols. The main objective of this thesis is the implementation of an open-source uplink behavioral simulator based on MATLAB. Its focus is primarily on Layer 1 (physical layer) relevant functionalities, namely turbo coding, Single-Carrier Frequency-Division Multiple Access (SC-FDMA) modulation, channel modeling, SC-FDMA demodulation, channel estimation, equalization and turbo decoding. Channel estimation is performed using known pilot symbols. The used channel models are based on the 3GPP o cial release specs. The Bit Error Rate (BER) is calculated in order to evaluate the turbo encoder and the Zero Forcing (ZF) equalizer performance, and to compare Binary Phase-Shift Keying (BPSK) and Quadrature Phase-Shift Keying (QPSK) implementations. Furthermore, the MATLAB generated signal is transmitted using a radio-frequency (RF) front-end consisting of an Universal Software Radio Peripheral (USRP). Afterwards, the signal is received, demodulated and decoded. A constellation is obtained, the BER is calculated and the results are analyzed

    Engineering evaluations and studies. Volume 3: Exhibit C

    Get PDF
    High rate multiplexes asymmetry and jitter, data-dependent amplitude variations, and transition density are discussed

    Model based test suite minimization using metaheuristics

    Get PDF
    Software testing is one of the most widely used methods for quality assurance and fault detection purposes. However, it is one of the most expensive, tedious and time consuming activities in software development life cycle. Code-based and specification-based testing has been going on for almost four decades. Model-based testing (MBT) is a relatively new approach to software testing where the software models as opposed to other artifacts (i.e. source code) are used as primary source of test cases. Models are simplified representation of a software system and are cheaper to execute than the original or deployed system. The main objective of the research presented in this thesis is the development of a framework for improving the efficiency and effectiveness of test suites generated from UML models. It focuses on three activities: transformation of Activity Diagram (AD) model into Colored Petri Net (CPN) model, generation and evaluation of AD based test suite and optimization of AD based test suite. Unified Modeling Language (UML) is a de facto standard for software system analysis and design. UML models can be categorized into structural and behavioral models. AD is a behavioral type of UML model and since major revision in UML version 2.x it has a new Petri Nets like semantics. It has wide application scope including embedded, workflow and web-service systems. For this reason this thesis concentrates on AD models. Informal semantics of UML generally and AD specially is a major challenge in the development of UML based verification and validation tools. One solution to this challenge is transforming a UML model into an executable formal model. In the thesis, a three step transformation methodology is proposed for resolving ambiguities in an AD model and then transforming it into a CPN representation which is a well known formal language with extensive tool support. Test case generation is one of the most critical and labor intensive activities in testing processes. The flow oriented semantic of AD suits modeling both sequential and concurrent systems. The thesis presented a novel technique to generate test cases from AD using a stochastic algorithm. In order to determine if the generated test suite is adequate, two test suite adequacy analysis techniques based on structural coverage and mutation have been proposed. In terms of structural coverage, two separate coverage criteria are also proposed to evaluate the adequacy of the test suite from both perspectives, sequential and concurrent. Mutation analysis is a fault-based technique to determine if the test suite is adequate for detecting particular types of faults. Four categories of mutation operators are defined to seed specific faults into the mutant model. Another focus of thesis is to improve the test suite efficiency without compromising its effectiveness. One way of achieving this is identifying and removing the redundant test cases. It has been shown that the test suite minimization by removing redundant test cases is a combinatorial optimization problem. An evolutionary computation based test suite minimization technique is developed to address the test suite minimization problem and its performance is empirically compared with other well known heuristic algorithms. Additionally, statistical analysis is performed to characterize the fitness landscape of test suite minimization problems. The proposed test suite minimization solution is extended to include multi-objective minimization. As the redundancy is contextual, different criteria and their combination can significantly change the solution test suite. Therefore, the last part of the thesis describes an investigation into multi-objective test suite minimization and optimization algorithms. The proposed framework is demonstrated and evaluated using prototype tools and case study models. Empirical results have shown that the techniques developed within the framework are effective in model based test suite generation and optimizatio

    Study of modulation techniques for multiple access satellite communications

    Get PDF
    Multiple access communication utilizing small ground stations for satellite communication modulation - multiplexing technique

    TDRSS telecommunications system, PN code analysis

    Get PDF
    The pseudo noise (PN) codes required to support the TDRSS telecommunications services are analyzed and the impact of alternate coding techniques on the user transponder equipment, the TDRSS equipment, and all factors that contribute to the acquisition and performance of these telecommunication services is assessed. Possible alternatives to the currently proposed hybrid FH/direct sequence acquisition procedures are considered and compared relative to acquisition time, implementation complexity, operational reliability, and cost. The hybrid FH/direct sequence technique is analyzed and rejected in favor of a recommended approach which minimizes acquisition time and user transponder complexity while maximizing probability of acquisition and overall link reliability

    Modeling and verifying the FlexRay physical layer protocol with reachability checking of timed automata

    Get PDF
    In this thesis, I report on the verification of the resilience of the FlexRay automotive bus protocol's physical layer protocol against glitches during message transmission and drifting clocks. This entailed modeling a significant part of this industrially used communictation protocol and the underlying hardware as well as the possible error scenarios in fine detail. Verifying such a complex model with model-checking led me to the development of data-structures and algorithms able to handle the associated complexity using only reasonable resources. This thesis presents such data-structures and algorithms for reachability checking of timed automata. It also present modeling principles enabling the construction of timed automata models that can be efficiently checked, as well as the models arrived at. Finally, it reports on the verified resilience of FlexRay's physical layer protocol against specific patterns of glitches under varying assumptions about the underlying hardware, like clock drift.In dieser Dissertation berichte ich über den Nachweis der Resilienz des Bitübertragungsprotokolls für die physikalische Schicht des FlexRay-Fahrzeugbusprotokolls gegenüber Übertragungsfehlern und Uhrenverschiebung. Dafür wurde es notwendig, einen signifikanten Teil dieses industriell genutzten Kommunikationsprotokolls mit seiner Hardwareumgebung und die möglichen Fehlerszenarien detailliert zu modellieren. Ein so komplexes Modell mittels Modellprüfung zu überprüfen führte mich zur Entwicklung von Datenstrukturen und Algorithmen, die die damit verbundene Komplexität mit vernünftigen Ressourcenanforderungen bewältigen können. Diese Dissertation stellt solche Datenstrukturen und Algorithmen zur Erreichbarkeitsprüfung gezeiteter Automaten vor. Sie stellt auch Modellierungsprinzipien vor, die es ermöglichen, Modelle in Form gezeiteter Automaten zu konstruieren, die effizient überprüft werden können, sowie die erstellten Modelle. Schließlich berichtet sie über die überprüfte Resilienz des FlexRay-Bitübertragungsprotokolls gegenüber spezifischen Übertragungsfehlermustern unter verschiedenen Annahmen über die Hardwareumgebung, wie etwa die Uhrenverschiebung.DFG: SFB/TRR 14 "AVACS - Automatische Verifikation und Analyse komplexer Systeme

    Implementation of a digital control unit for a space probe using mosfets

    Get PDF
    Implementation of digital control unit for space probe using MOSFET
    corecore