scholarly journals Synthesis of sequential circuits by using linearization

2007 ◽  
Vol 20 (3) ◽  
pp. 461-477
Author(s):  
Iliya Levin ◽  
Osnat Keren ◽  
Vladimir Ostrovsky
Keyword(s):  
State Machine ◽  
Sequential Circuits ◽  
Efficient Design ◽  
Linearization Technique ◽  
Logic Functions ◽  
Linearization Techniques

The paper deals with synthesis of sequential circuits defined by their algorithmic state machine notation. Such circuits have a number of specific properties which enable efficient design of the circuits by utilizing so-called linearization techniques. A typical linearization technique includes calculation of autocorrelation values for a system of logic functions corresponding to the circuit. For the mentioned sequential circuits, the calculations which usually require massive computational recourses may be significantly reduced and thus low-overhead implementations of the circuits can be obtained relatively easy. The paper introduces a novel architecture of so-called linearized sequential circuits, and a piece-wise linearization approach for synthesis of sequential circuits. Results are evaluated both analytically and by using a number of standard benchmarks.

Sequential Circuit Equivalence Checking Method Based on Minimizing Automation

2011 ◽  
Vol 204-210 ◽  
pp. 251-254
Author(s):  
Yu Wan Gu ◽  
Guo Dong Shi ◽  
Shi Yan Xie ◽  
Yu Qiang Sun
Keyword(s):  
Finite State Machine ◽  
State Machine ◽  
Sequential Circuits ◽  
Equivalence Checking ◽  
Sequential Circuit ◽  
Minimization Method ◽  
Finite State ◽  
Graph Form

A parallel checking method is proposed in the paper, in order to improve the speed of sequential circuit checking. The graph form of sequential circuits is isomorphic to finite state machine; a parallel sequential circuit equivalence checking method is designed using parallel minimization method of finite state machine. At last, the effectiveness and feasibility of the method is proved with an instance.

scholarly journals Comparative Review on Efficient Design of Reversible Sequential Circuits based on Optimization Parameters

2021 ◽  
Vol 23 (09) ◽  
pp. 1313-1325
Author(s):  
Gobinda Karmakar ◽  
◽  
Dr. Saroj Kumar Biswas ◽  
Dr. Ardhendu Mandal ◽  
Arijit Bhattacharya ◽  
...  
Keyword(s):  
Research Area ◽  
Sequential Circuits ◽  
Quantum Cost ◽  
Efficient Design ◽  
Hardware Complexity ◽  
Constant Input ◽  
Reversible Computing ◽  
Main Challenge ◽  
Comparative Review ◽  
Optimization Parameters

Reversible computing, a well known research area in the field of computer science. One of the aims of reversible computing is to design low power digital circuits that dissipates no energy to heat. The main challenge of designing reversible circuits is to optimize the parameters which make the design costly. In this paper, we review different designs of efficient reversible sequential circuits and prepare a comparative statement based on eight optimization parameters such as Quantum Cost (QC), Delay (del), Garbage Output (GO), Constant Input (CI), Gate Level (GL), Number of Gate (NoG), Type of Gate (ToG), Hardware Complexity (HC) of Circuit.

scholarly journals A New Cost-Efficient Design of a Reversible Gate Based on a Nano-Scale Quantum-Dot Cellular Automata Technology

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1806
Author(s):  
Saeid Seyedi ◽  
Akira Otsuki ◽  
Nima Jafari Navimipour
Keyword(s):  
Cellular Automata ◽  
Quantum Dot ◽  
Efficient Design ◽  
Quantum Dot Cellular Automata ◽  
Feynman Gate ◽  
Cost Efficient ◽  
And Performance ◽  
Logic Functions ◽  
Silicon Based ◽  
Structural Blocks

Quantum-dot cellular automata (QCA) nanotechnology is a practical suggestion for replacing present silicon-based technologies. It provides many benefits, such as low power usage, high velocity, and an extreme density of logic functions on a chip. In contrast, designing circuits with no waste of information (reversible circuits) may further reduce energy losses. The Feynman gate has been recognized as one of the most famous QCA-based gates for this purpose. Since reversible gates are significant, this paper develops a new optimized reversible double Feynman gate that uses efficient arithmetic elements as its key structural blocks. Additionally, we used several modeling principles to make it consistent and more robust against noise. Moreover, we examined the suggested model and compared it to the previous models regarding the complexity, clocking, number of cells, and latency. Furthermore, we applied QCADesigner to monitor the outline and performance of the proposed gate. The results show an acceptable improvement via the designed double Feynman gate in comparison to the existing designs. Finally, the temperature and cost analysis indicated the efficiency of the proposed nan-scale gate.

scholarly journals Linearization as a Solution for Power Amplifier Imperfections: A Review of Methods

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1073
Author(s):  
Andžej Borel ◽  
Vaidotas Barzdėnas ◽  
Aleksandr Vasjanov
Keyword(s):  
Power Efficiency ◽  
5G Networks ◽  
Research Attention ◽  
Linearization Technique ◽  
Advantages And Disadvantages ◽  
Linearization Methods ◽  
History Of ◽  
Comparison Of Techniques ◽  
Two Parameters ◽  
Linearization Techniques

Development of 5G networks requires a substantial increase to both spectral and power efficiency of transmitters. It is known that these two parameters are subjected to a mutual trade-off. To increase the linearity without losing power efficiency, linearization techniques are applied to power amplifiers. This paper aims to compare most popular linearization techniques to date and evaluate their applicability to upcoming 5G networks. The history of each respective linearization technique is followed by the main principle of operation, revealing advantages and disadvantages supported by concluding the latest research results. Three main groups of linearization methods currently known are feedforward, feedback, and predistortion, each with its own tradeoffs. Although digital predistortion seems to be the go-to method currently, other techniques with less research attention are still non-obsolete. А generalized discussion and a direct comparison of techniques analyzed are presented at the end of this paper. The article offers a systematic view on PA linearization problems which should be useful to researchers of this field. It is concluded that there are still a lot of problems that need to be addressed in every linearization technique in order to achieve 5G specifications.

MARKOV MATHEMATICAL MODEL OF DYNAMIC ADAPTIVE TESTING OF AN ACTIVE AGENT

2018 ◽  
pp. 29-35
Author(s):  
N. V. Brovka ◽  
P. P. Dyachuk ◽  
M. V. Noskov ◽  
I. P. Peregudova
Keyword(s):  
Mathematical Model ◽  
Finite State Machine ◽  
Active Agent ◽  
Adaptive Testing ◽  
State Machine ◽  
Learning Activities ◽  
Independent Learning ◽  
Complex Object ◽  
Total Reward ◽  
Finite State

The problem and the goal.The urgency of the problem of mathematical description of dynamic adaptive testing is due to the need to diagnose the cognitive abilities of students for independent learning activities. The goal of the article is to develop a Markov mathematical model of the interaction of an active agent (AA) with the Liquidator state machine, canceling incorrect actions, which will allow mathematically describe dynamic adaptive testing with an estimated feedback.The research methodologyconsists of an analysis of the results of research by domestic and foreign scientists on dynamic adaptive testing in education, namely: an activity approach that implements AA developmental problem-solving training; organizational and technological approach to managing the actions of AA in terms of evaluative feedback; Markow’s theory of cement and reinforcement learning.Results.On the basis of the theory of Markov processes, a Markov mathematical model of the interaction of an active agent with a finite state machine, canceling incorrect actions, was developed. This allows you to develop a model for diagnosing the procedural characteristics of students ‘learning activities, including: building axiograms of total reward for students’ actions; probability distribution of states of the solution of the problem of identifying elements of the structure of a complex object calculate the number of AA actions required to achieve the target state depending on the number of elements that need to be identified; construct a scatter plot of active agents by target states in space (R, k), where R is the total reward AA, k is the number of actions performed.Conclusion.Markov’s mathematical model of the interaction of an active agent with a finite state machine, canceling wrong actions allows you to design dynamic adaptive tests and diagnostics of changes in the procedural characteristics of educational activities. The results and conclusions allow to formulate the principles of dynamic adaptive testing based on the estimated feedback.

Sign in / Sign up

Export Citation Format

Share Document