LJLembit Jurimagi

Lembit Jurimagi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lembit Jurimagi has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Teaching Rapid Application Development Skills for Digitalisation Challenges

    by Tarmo Robal, Uljana Reinsalu, Janika Leoste, Lembit Jürimägi, Risto Heinsar


  • Open Access

    Introducing rapid web application development with Oracle APEX to students of higher education

    by Tarmo Robal, Uljana Reinsalu, Lembit Jürimägi, Risto Heinsar

    The rapid development of information and communication technologies (ICT), and enforcement of digital transformation have caused the need to develop and deliver software in even shorter time than previously, and has become crucial to businesses. Yet, this new need has caused a challenge of finding expert IT workforce able to deliver software applications due expected time. Moreover, in a rapidly changing business world, the traditional software development can no longer keep pace and provide solutions to businesses fast enough. Low-code development and inclusion of so-called citizen developers are seen as a solution for the problem. This paper explores the introduction of rapid application development courses on Oracle APEX technology to students of a European technological university. The paper discusses the implementation of the course and its design, and looks how the developed basic-level course was received by students. It is shown that the courses have been well-received by students, who based on provided feedback are satisfied with the online set up for self-regulated learning of rapid application development skills.


  • Open Access

    ETS 2021 Organizing Committee

    by Georges Gielen, Michele Stucchi, Salvador Manich, R. Rodríguez‐Montañés, Elena Ioana Vatajelu, Salvador Mir, Ferenc Fodor, Erik Larsson, Ilia Chair, Daniel Chair, et al.

    Provides a listing of current committee members and society officers.

  • Algorithm for Restructuring of Structurally Synthesized BDDs

    by L. Jurimagi, R. Ubar

    In this paper, we present a method for synthesizing Shared Structurally Synthesized BDDs $(\mathrm{S}^{3}\mathrm{BDD})$ for representing digital circuits with the goal of speeding up fault simulation. As the core of the method, we propose a novel algorithm to restructure the Structurally Synthesized BDDs (SSBDDs) [1], [2] into a form, which allows iterative embedding of SSBDDs, and compressing a set of SSBDDs into a single Shared SSBDD $(\mathrm{S}^{3}\mathrm{BDD})$ [3]. The target of such a compression of the $\mathrm{S}^{3}\mathrm{BDD}$ model, representing a digital circuit, is to reduce the memory requirements of the model. Experiments with proposed algorithm, applied to three families of benchmark circuits, demonstrate feasibility of the proposed method, its high scalability, and considerable speedup in fault simulation compared to the initial SSBDD model.

  • True Path Tracing in Structurally Synthesized BDDs for Testability Analysis of Digital Circuits

    by Raimund Ubar, Lembit Jurimagi, Adeniyi Olanrewaju Adekoya, Maksim Jenihhin

    A method is proposed for testability analysis of digital circuits focusing on calculating the probabilistic controllability measures in terms of signal probabilities, when random or pseudorandom patterns are applied to the circuit inputs. The tasks of calculating the probabilistic observability and testability measures are transformed into the task of calculating the controllability. The structure of the circuit is presented as a set of Structurally Synthesized BDDs (SSBDD), which allows controllability analysis with higher speed than carrying out calculations on the gate-level, retaining the possibilities of assessment of the controllability of all gate-level nodes represented by related SSBDD nodes. The proposed method is based on tracing true paths in SSBDDs. A general case is considered, where the circuit may include redundancies. It is shown that the known methods of calculating signal probabilities, which are not taking into account the redundancy in circuits, are not accurate. A method is proposed for proving the redundancy of faults, which is based on the same idea of SSBDD path tracing. Experimental results show higher accuracy and higher speed of SSBDD-based probability calculations, compared to gate-level calculation.


  • Application Specific True Critical Paths Identification in Sequential Circuits

    by Lembit Jurimagi, Raimund Ubar, Maksim Jenihhin, Jaan Raik, Sergei Devadze, Adeboye Stephen Oyeniran

    The extreme complexity of digital systems enabled by nanometer-scale implementation technologies comes along with strengthened design requirements that are difficult to achieve with the conventional techniques. Over-designing beyond the minimal required guarantees may have negative impacts on the overall system’s cost. In this paper we focus on the task of timing-critical logic paths identification in digital systems that has many applications in design and test field, like verifying the timing constraints of designs, estimating critical delays, Simulating path delay faults and reliability analysis such as ageing. The contribution is a new scalable simulation-based hierarchical search method for application-specific online-viable true critical paths identification in sequential circuits. The approach is motivated by the concept of mixed-critical systems, but it can be applied for any type of digital system. We propose to represent the circuits hierarchically at the level of higher level submodules using t e theory of Structurally Synthesized BDDs (SSBDD). The search space is limited by the application-specific context that enables accurate results even for complex sequential circuits. Experimental results demonstrate efficiency of the proposed approach, and considerable reduction of the length of critical paths if the application-specific constraints are taken into account.


  • Equivalent Transformations of Structurally Synthesized BDDs and Applications

    by Lembit Jurimagi, Raimund Ubar, Vladimir Viies

    In this paper we explore several properties of Structurally Synthesized Binary Decision Diagrams (SSBDD), and based on these properties we propose a method for equivalent transformations of SSBDDs. The main importance of these transformations is in the fact that the mapping between SSBDD nodes and signal paths of the circuit represented by SSBDD remains invariant. The need of transformations of SSBDDs arose from the tasks of converting SSBDDs into Shared SSBDDs (S3BDD), as a more compact form of BDDs. A procedure is proposed for this task. Other application possibilities where the proposed method of graph transformations may be useful are discussed as well. Experiments demonstrate the feasibility of the proposed method and its high scalability.

  • Conditional Fault Collapsing in Digital Circuits with Shared Structurally Synthesized BDDs

    by Lembit Jurimagi, Raimund Ubar

    The paper presents a scalable method with linear complexity for structural fault collapsing in digital circuits using Shared Structurally Synthesized BDDs (S3BDDs) to reduce search space for test generation, speed up fault simulation and make fault diagnosis easier. The paper introduces a new term of conditional fault collapsing, and identifies the conditionally collapsed faults, produced as the result of transforming SSBDDs into S3BDDs. The necessary and sufficient conditions, to be satisfied by test patterns, are developed to guarantee that the collapsed faults are detected without special targeting them. Experiments demonstrate better results for structural fault collapsing compared to state-of-the-art.


  • Hierarchical Timing-Critical Paths Analysis in Sequential Circuits

    by Lembit Jurimagi, Raimund Ubar, Maksim Jenihhin, Jaan Raik, Sergei Devadze, Sergei Kostin

    The conventional design techniques struggle with integration density and constantly strengthening requirements of today's nanometer technology. Timing-critical paths analysis is one of such tasks. It has applications in critical path identification, path delay fault simulation, circuit reliability analysis e.g. Bias Temperature Instability (BTI) induced aging, and in several others. In this paper, we propose a scalable simulation based hierarchical technique for explicit identification of true timing-critical paths in sequential circuits. We explore the circuits at two levels - at the flat gate-level and at a higher level as a network of modules or sub-circuits. The result of timing analysis carried out at the gate-level is used for calculating the delays on the topological critical paths through the network of higher level modules. To speed-up the module level timing analysis, the theory of Structurally Synthesized BDDs (SSBDD) is used. Experimental results demonstrate considerable speed-up of the SSBDD based timing analysis, compared to the flat gate-level analysis.


  • Timing-critical path analysis with structurally synthesized BDDs

    by Raimund Ubar, Lembit Jurimagi, Maksim Jenihhin, Jaan Raik, Niyi-Leigh Olugbenga, Vladimir Viies

    Timing-critical paths analysis is one of the key-important tasks in the field of design and test of digital circuits and systems. It has applications in time critical path identification, in path delay simulation, in gate-level reliability analysis. To cope with the complexity of the timing analysis of digital circuits at the logic level, we present in this paper a novel hierarchical approach to analysis. We propose to present the circuits at two levels - at the flat gate-level for modules or sub-circuits, and at the higher architectural level as a network of modules. The results of timing analysis carried out at the gate-level for modules are used for calculating the delays on the topological critical paths determined as paths through the network of higher level modules. To speed-up the module level timing analysis, the theory of Structurally Synthesized BDDs (SSBDD) is used. Experimental results demonstrate considerable speed-up of the SSBDD based timing analysis, compared to the flat gate-level analysis.