Relevant bibliographies by topics / Ternary computing

Academic literature on the topic 'Ternary computing'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Ternary computing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Ternary computing"

1

A. Obiniyi, Afolayan, Ezugwu E. Absalom, and Kwanashie Adako. "Arithmetic Logic Design with ColorCoded Ternary for Ternary Computing." International Journal of Computer Applications 26, no. 11 (July 31, 2011): 31–37. http://dx.doi.org/10.5120/3162-2929.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Orbach, Ron, Sivan Lilienthal, Michael Klein, R. D. Levine, Francoise Remacle, and Itamar Willner. "Ternary DNA computing using 3 × 3 multiplication matrices." Chemical Science 6, no. 2 (2015): 1288–92. http://dx.doi.org/10.1039/c4sc02930e.

Full text
Abstract:
Ternary computing, beyond Boolean logic, is anticipated to enhance computational complexity. DNA-based ternary computing is demonstrated by the assembly of a 3 × 3 multiplication table, and the parallel operation of three 3 × 3 multiplication matrices is highlighted.
APA, Harvard, Vancouver, ISO, and other styles
3

Cambou, Bertrand, Paul Flikkema, James Palmer, Donald Telesca, and Christopher Philabaum. "Can Ternary Computing Improve Information Assurance?" Cryptography 2, no. 1 (March 2, 2018): 6. http://dx.doi.org/10.3390/cryptography2010006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Sunmean, Yesung Kang, Seunghan Baek, Youngchang Choi, and Seokhyeong Kang. "Low-Power Ternary Multiplication Using Approximate Computing." IEEE Transactions on Circuits and Systems II: Express Briefs 68, no. 8 (August 2021): 2947–51. http://dx.doi.org/10.1109/tcsii.2021.3068971.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Buchade, Amar, and Rajesh Ingle. "Ternary Tree Based Approach For Accessing the Resources By Overlapping Members in Cloud Computing." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 6 (December 1, 2017): 3593. http://dx.doi.org/10.11591/ijece.v7i6.pp3593-3601.

Full text
Abstract:
<p>In cloud computing, immediate access of resources is important due to cost incurred to customer by pay per use model of cloud computing. Usually resource is protected by using cryptography technique. The resource may be shared by multiple members in group. There can be overlapping members to access the multiple resources. Group key management is important to form the group key to access the resource. Group key formation time is crucial for immediate access of protected resource in cloud computing. Thus ternary tree based approach is proposed to form the key for overlapping members accessing resources. Membership event such as join and leave also considered. Through the analysis, it is found that computational overhead is reduced by 23% if ternary key trees are combined than independent ternary key trees. It is also observed that combined ternary key tree outperforms the combined binary key tree approach for group key formation by considering overlapping members. Security requirement analysis of group membership for key formation is also provided in the paper.</p>
APA, Harvard, Vancouver, ISO, and other styles
6

Monfared, Asma Taheri, and Majid Haghparast. "Design of New Quantum/Reversible Ternary Subtractor Circuits." Journal of Circuits, Systems and Computers 25, no. 02 (December 23, 2015): 1650014. http://dx.doi.org/10.1142/s0218126616500146.

Full text
Abstract:
Ternary quantum circuits play a significant role in future quantum computing technology because they have many advantages over binary quantum circuits. Subtraction is considered as being one of the key arithmetic operations; hence, subtractors are very essential for the construction of various computational units of quantum computers and other complex computational systems. In this paper, we have proposed the realization of a quantum reversible ternary half-subtractor circuit using a generalized ternary gate, a ternary Toffoli gate, and a ternary C2NOT gate. Based on the realization of the ternary half-subtractor, we proposed the realization of a ternary full-subtractor.
APA, Harvard, Vancouver, ISO, and other styles
7

Zheng, Wei-Min, Qing-Wei Chai, Jie Zhang, and Xingsi Xue. "Ternary compound ontology matching for cognitive green computing." Mathematical Biosciences and Engineering 18, no. 4 (2021): 4860–70. http://dx.doi.org/10.3934/mbe.2021247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Clementini, E., and R. Billen. "Modeling and computing ternary projective relations between regions." IEEE Transactions on Knowledge and Data Engineering 18, no. 6 (June 2006): 799–814. http://dx.doi.org/10.1109/tkde.2006.102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tabrizchi, Sepehr, Atiyeh Panahi, Fazel Sharifi, Hamid Mahmoodi, and Abdel-Hameed A. Badawy. "Energy-Efficient Ternary Multipliers Using CNT Transistors." Electronics 9, no. 4 (April 14, 2020): 643. http://dx.doi.org/10.3390/electronics9040643.

Full text
Abstract:
In recent decades, power consumption has become an essential factor in attracting the attention of integrated circuit (IC) designers. Multiple-valued logic (MVL) and approximate computing are some techniques that could be applied to integrated circuits to make power-efficient systems. By utilizing MVL-based circuits instead of binary logic, the information conveyed by digital signals increases, and this reduces the required interconnections and power consumption. On the other hand, approximate computing is a class of arithmetic computing used in systems where the accuracy of the computation can be traded-off for lower energy consumption. In this paper, we propose novel designs for exact and inexact ternary multipliers based on carbon-nanotube field-effect transistors (CNFETs). The unique characteristics of CNFETs make them a desirable alternative to MOSFETs. The simulations are conducted using Synopsys HSPICE. The proposed design is compared against existing ternary multipliers. The results show that the proposed exact multiplier reduces the energy consumption by up to 6 times, while the best inexact design improves energy efficiency by up to 35 time compared to the latest state-of-the-art methods. Using the imprecise multipliers for image processing provides evidence that these proposed designs are a low-power system with an acceptable error.
APA, Harvard, Vancouver, ISO, and other styles
10

Peng, Xian Wu, Xiao Ping Fan, and Jian Xun Liu. "Performing Balanced Ternary Logic and Arithmetic Operations with Spiking Neural P Systems with Anti-Spikes." Advanced Materials Research 505 (April 2012): 378–85. http://dx.doi.org/10.4028/www.scientific.net/amr.505.378.

Full text
Abstract:
Spiking neural P systems are a class of distributed and parallel computing models inspired by P systems and spiking neural networks.Spiking neural P system with anti-spikes can encode the balanced ternary three digits in a natural way using three states called anti-spikes, no-input and spikes. In this paper we use this variant of SN P system to simulate universal balanced ternary logic gates including AND,OR and NOT gate and to perform some basic balanced ternary arithmetic operations like addition and subtraction on balanced ternary integers. This paper provides an applicational answer to an open problem formulated by L.Pan and Gh. Păun.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Ternary computing"

1

Setta, Mario. "Multiscale numerical approximation of morphology formation in ternary mixtures with evaporation : Discrete and continuum models for high-performance computing." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-85036.

Full text
Abstract:
We propose three models to study morphology formations in interacting ternary mixtures with the evaporation of one component. Our models involve three distinct length scales: microscopic, mesoscopic, and respectively, macroscopic. The real-world application we have in mind concerns charge transport through the heterogeneous structures arising in the fabrication of organic solar cells. As first model, we propose a microscopic 3-spins lattice dynamics with short-range interactions between the considered species. This microscopic model is approximated numerically via a Monte Carlo Metropolis-based algorithm. We explore the effect of the model parameters (volatility of the solvent, system's temperature, and interaction strengths) on the structure of the formed morphologies. Our second model is built upon the first one, by introducing a new mesoscale corresponding to the size of block spins. The link between these two models as well as between the effects of the model parameters and formed morphologies are studied in detail. These two models offer insight into cross-sections of the modeling box. Our third model encodes a macroscopic view of the evaporating mixture. We investigate its capability to lead to internal coherent structures. We propose a macroscopic system of nonlinearly coupled Cahn-Hilliard equations to capture numerical results for a top view of the modeling box. Effects of effective evaporation rates, effective interaction energy parameters, and degree of polymerization on the wanted morphology formation are explored via the computational platform FEniCS using a FEM approximation of a suitably linearized system. High-performance computing resources and Python-based parallel implementations have been used to facilitate the numerical approximation of the three models.
APA, Harvard, Vancouver, ISO, and other styles
2

Hawash, Maher Mofeid. "Methods for Efficient Synthesis of Large Reversible Binary and Ternary Quantum Circuits and Applications of Linear Nearest Neighbor Model." PDXScholar, 2013. https://pdxscholar.library.pdx.edu/open_access_etds/1090.

Full text
Abstract:
This dissertation describes the development of automated synthesis algorithms that construct reversible quantum circuits for reversible functions with large number of variables. Specifically, the research area is focused on reversible, permutative and fully specified binary and ternary specifications and the applicability of the resulting circuit to the physical limitations of existing quantum technologies. Automated synthesis of arbitrary reversible specifications is an NP hard, multiobjective optimization problem, where 1) the amount of time and computational resources required to synthesize the specification, 2) the number of primitive quantum gates in the resulting circuit (quantum cost), and 3) the number of ancillary qubits (variables added to hold intermediate calculations) are all minimized while 4) the number of variables is maximized. Some of the existing algorithms in the literature ignored objective 2 by focusing on the synthesis of a single solution without the addition of any ancillary qubits while others attempted to explore every possible solution in the search space in an effort to discover the optimal solution (i.e., sacrificed objective 1 and 4). Other algorithms resorted to adding a huge number of ancillary qubits (counter to objective 3) in an effort minimize the number of primitive gates (objective 2). In this dissertation, I first introduce the MMDSN algorithm that is capable of synthesizing binary specifications up to 30 variables, does not add any ancillary variables, produces better quantum cost (8-50% improvement) than algorithms which limit their search to a single solution and within a minimal amount of time compared to algorithms which perform exhaustive search (seconds vs. hours). The MMDSN algorithm introduces an innovative method of using the Hasse diagram to construct candidate solutions that are guaranteed to be valid and then selects the solution with the minimal quantum cost out of this subset. I then introduce the Covered Set Partitions (CSP) algorithm that expands the search space of valid candidate solutions and allows for exploring solutions outside the range of MMDSN. I show a method of subdividing the expansive search landscape into smaller partitions and demonstrate the benefit of focusing on partition sizes that are around half of the number of variables (15% to 25% improvements, over MMDSN, for functions less than 12 variables, and more than 1000% improvement for functions with 12 and 13 variables). For a function of n variables, the CSP algorithm, theoretically, requires n times more to synthesize; however, by focusing on the middle k (k by MMDSN which typically yields lower quantum cost. I also show that using a Tabu search for selecting the next set of candidate from the CSP subset results in discovering solutions with even lower quantum costs (up to 10% improvement over CSP with random selection). In Chapters 9 and 10 I question the predominant methods of measuring quantum cost and its applicability to physical implementation of quantum gates and circuits. I counter the prevailing literature by introducing a new standard for measuring the performance of quantum synthesis algorithms by enforcing the Linear Nearest Neighbor Model (LNNM) constraint, which is imposed by the today's leading implementations of quantum technology. In addition to enforcing physical constraints, the new LNNM quantum cost (LNNQC) allows for a level comparison amongst all methods of synthesis; specifically, methods which add a large number of ancillary variables to ones that add no additional variables. I show that, when LNNM is enforced, the quantum cost for methods that add a large number of ancillary qubits increases significantly (up to 1200%). I also extend the Hasse based method to the ternary and I demonstrate synthesis of specifications of up to 9 ternary variables (compared to 3 ternary variables that existed in the literature). I introduce the concept of ternary precedence order and its implication on the construction of the Hasse diagram and the construction of valid candidate solutions. I also provide a case study comparing the performance of ternary logic synthesis of large functions using both a CUDA graphic processor with 1024 cores and an Intel i7 processor with 8 cores. In the process of exploring large ternary functions I introduce, to the literature, eight families of ternary benchmark functions along with a Multiple Valued file specification (the Extended Quantum Specification XQS). I also introduce a new composite quantum gate, the multiple valued Swivel gate, which swaps the information of qubits around a centrally located pivot point. In summary, my research objectives are as follows: * Explore and create automated synthesis algorithms for reversible circuits both in binary and ternary logic for large number of variables. * Study the impact of enforcing Linear Nearest Neighbor Model (LNNM) constraint for every interaction between qubits for reversible binary specifications. * Advocate for a revised metric for measuring the cost of a quantum circuit in concordance with LNNM, where, on one hand, such a metric would provide a way for balanced comparison between the various flavors of algorithms, and on the other hand, represents a realistic cost of a quantum circuit with respect to an ion trap implementation. * Establish an open source repository for sharing the results, software code and publications with the scientific community. With the dwindling expectations for a new lifeline on silicon-based technologies, quantum computations have the potential of becoming the future workhorse of computations. Similar to the automated CAD tools of classical logic, my work lays the foundation for creating automated tools for constructing quantum circuits from reversible specifications.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Ternary computing"

1

Cambou, Bertrand, and Donald Telesca. "Ternary Computing to Strengthen Cybersecurity." In Advances in Intelligent Systems and Computing, 898–919. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01177-2_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dubey, Manish Kant, and Anuradha. "On Quasi-ideals in Ternary Semirings." In Mathematics and Computing 2013, 313–22. New Delhi: Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-1952-1_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yuan, Jing-Hua, Hao-Dong Zhu, Yong Gan, and Li Shang. "Enhanced Local Ternary Pattern for Texture Classification." In Intelligent Computing Theory, 443–48. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09333-8_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Caraiman, Simona, and Vasile Manta. "Image Representation and Processing Using Ternary Quantum Computing." In Adaptive and Natural Computing Algorithms, 366–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37213-1_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Haridas, Deepthi, K. C. Emmanuel Sanjay Raj, Venkataraman Sarma, and Santanu Chowdhury. "Probabilistically Generated Ternary Quasigroup Based Stream Cipher." In Advances in Intelligent Systems and Computing, 153–60. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-3376-6_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chakraborty, Sanjay, Sudhindu Bikash Mandal, Soharab Hossain Shaikh, and Lopamudra Dey. "Ternary Quantum Circuit for Color Image Representation." In Advances in Intelligent Systems and Computing, 95–108. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-3391-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bhattacharjee, Amrita, and Bipul Syam Purkayastha. "Parikh Matrices and Words Over Ternary Alphabet." In Advances in Intelligent Systems and Computing, 135–45. New Delhi: Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-2217-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yong, Qi-dong, Ju-dong Liu, and Rong-sen Ren. "Research on Numerical Simulation for Ternary Complicated Uncertain Number." In Advances in Soft Computing, 1681–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03664-4_178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cambou, Bertrand. "Password Manager Combining Hashing Functions and Ternary PUFs." In Advances in Intelligent Systems and Computing, 494–513. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22868-2_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Prasad, Vikash, and Debaprasad Das. "Design of Ternary Content-Addressable Memory Using CNTFET." In Advances in Intelligent Systems and Computing, 853–58. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7834-2_80.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Ternary computing"

1

Jaber, Ramzi A., Hiba Bazzi, Ali Haidar, Bilal Owaidat, and Abdallah Kassem. "1-trit Ternary Multiplier and Adder Designs Using Ternary Multiplexers and Unary Operators." In 2021 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT). IEEE, 2021. http://dx.doi.org/10.1109/3ict53449.2021.9581366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Khan, A. I., N. Nusrat, S. M. Khan, and M. Hasan. "Novel Realization of Some Ternary Circuits for Quantum Computing." In TENCON 2006 - 2006 IEEE Region 10 Conference. IEEE, 2006. http://dx.doi.org/10.1109/tencon.2006.343816.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Xiangxing, Keren Zhu, Xiyuan Tang, Meizhi Wang, Mingtao Zhan, Nanshu Lu, Jaydeep P. Kulkarni, David Z. Pan, Yongpan Liu, and Nan Sun. "An In-Memory-Computing Charge-Domain Ternary CNN Classifier." In 2021 IEEE Custom Integrated Circuits Conference (CICC). IEEE, 2021. http://dx.doi.org/10.1109/cicc51472.2021.9431398.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jayashree, H. V., and V. P. Sai Shruthi. "Ternary SRAM for low power applications." In 2012 International Conference on Communication, Information & Computing Technology (ICCICT 2012). IEEE, 2012. http://dx.doi.org/10.1109/iccict.2012.6398121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mounika, J., K. Ramanujam, and Mohd Ziauddin Jahangir. "CMOS based design and simulation of ternary full adder and Ternary coded Decimal (TCD) adder circuit." In 2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT). IEEE, 2016. http://dx.doi.org/10.1109/iccpct.2016.7530153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Inbar, Hanni, Ian M. Barton, Paul Blair, and Mohammad R. Taghizadeh. "High-fidelity optical interconnections using ternary phase-amplitude filtering." In Optics in Computing '98, edited by Pierre H. Chavel, David A. B. Miller, and Hugo Thienpont. SPIE, 1998. http://dx.doi.org/10.1117/12.308893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Ni, Georgy Gimel'farb, and Patrice Delmas. "Combined ternary patterns for texture recognition." In 2015 International Conference on Image and Vision Computing New Zealand (IVCNZ). IEEE, 2015. http://dx.doi.org/10.1109/ivcnz.2015.7761509.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schoenbaum, Lucius T., and Waleed K. Al-Assadi. "Binary/Ternary Logic Applications for Systems Programming and Reversible Computing." In SoutheastCon 2019. IEEE, 2019. http://dx.doi.org/10.1109/southeastcon42311.2019.9020479.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Moraga, Claudio. "On Some Basic Aspects of Ternary Reversible and Quantum Computing." In 2014 IEEE 44th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2014. http://dx.doi.org/10.1109/ismvl.2014.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Goenka, Aadarsh G., Shyamali Mitra, and Nibaran Das. "Design of Balanced Ternary Encoder and Decoder." In 2022 6th International Conference on Computing Methodologies and Communication (ICCMC). IEEE, 2022. http://dx.doi.org/10.1109/iccmc53470.2022.9753941.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Ternary computing"

1

Boumova, Silvia, Tedis Ramaj, and Maya Stoyanova. Computing Distance Distributions of Ternary Orthogonal Arrays. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, February 2021. http://dx.doi.org/10.7546/crabs.2021.02.03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Ternary computing' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography