| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Dieny, B., et al.
(författare)
-
Opportunities and challenges for spintronics in the microelectronics industry
- 2020
-
Ingår i: Nature Electronics. - : Springer Science and Business Media LLC. - 2520-1131. ; 3:8, s. 446-459
-
Tidskriftsartikel (refereegranskat)abstract
- This Review Article examines the potential of spintronics in four key areas of application -memories, sensors, microwave devices, and logic devices - and discusses the challenges that need be addressed in order to integrate spintronic materials and functionalities into mainstream microelectronic platforms. Spintronic devices exploit the spin, as well as the charge, of electrons and could bring new capabilities to the microelectronics industry. However, in order for spintronic devices to meet the ever-increasing demands of the industry, innovation in terms of materials, processes and circuits are required. Here, we review recent developments in spintronics that could soon have an impact on the microelectronics and information technology industry. We highlight and explore four key areas: magnetic memories, magnetic sensors, radio-frequency and microwave devices, and logic and non-Boolean devices. We also discuss the challenges-at both the device and the system level-that need be addressed in order to integrate spintronic materials and functionalities into mainstream microelectronic platforms.
|
|
| 7. |
- Ahmed, B. S., et al.
(författare)
-
Optimum design of PIλDμ controller for an automatic voltage regulator system using combinatorial test design
- 2016
-
Ingår i: PLOS ONE. - : Public Library of Science (PLoS). - 1932-6203. ; 11:11
-
Tidskriftsartikel (refereegranskat)abstract
- Combinatorial test design is a plan of test that aims to reduce the amount of test cases systematically by choosing a subset of the test cases based on the combination of input variables. The subset covers all possible combinations of a given strength and hence tries to match the effectiveness of the exhaustive set. This mechanism of reduction has been used successfully in software testing research with t-way testing (where t indicates the interaction strength of combinations). Potentially, other systems may exhibit many similarities with this approach. Hence, it could form an emerging application in different areas of research due to its usefulness. To this end, more recently it has been applied in a few research areas successfully. In this paper, we explore the applicability of combinatorial test design technique for Fractional Order (FO), Proportional-Integral-Derivative (PID) parameter design controller, named as FOPID, for an automatic voltage regulator (AVR) system. Throughout the paper, we justify this new application theoretically and practically through simulations. In addition, we report on first experiments indicating its practical use in this field. We design different algorithms and adapted other strategies to cover all the combinations with an optimum and effective test set. Our findings indicate that combinatorial test design can find the combinations that lead to optimum design. Besides this, we also found that by increasing the strength of combination, we can approach to the optimum design in a way that with only 4-way combinatorial set, we can get the effectiveness of an exhaustive test set. This significantly reduced the number of tests needed and thus leads to an approach that optimizes design of parameters quickly. © 2016 Ahmed et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
|
|
| 8. |
|
|
| 9. |
- Ahmed, Bestoun S., 1982-, et al.
(författare)
-
A new approach to speed up combinatorial search strategies using stack and hash table
- 2016
-
Ingår i: Proceedings of 2016 SAI Computing Conference, SAI 2016. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467384605 ; , s. 1217-1222
-
Konferensbidrag (refereegranskat)abstract
- Owing to the significance of combinatorial search strategies both for academia and industry, the introduction of new techniques is a fast growing research field these days. These strategies have really taken different forms ranging from simple to complex strategies in order to solve all forms of combinatorial problems. Nonetheless, despite the kind of problem these approaches solve, they are prone to heavy computation with the number of combinations and growing search space dimensions. This paper presents a new approach to speed up the generation and search processes using a combination of stack and hash table data structures. This approach could be put to practice for the combinatorial approaches to speed up the generation of combinations and search process in the search space. Furthermore, this new approach proved its performance in diverse stages better than other known strategies. © 2016 IEEE.
|
|
| 10. |
|
|
