Computational Complexity and Efficiency in Electro-Optical Computing Systems

1990 ◽  
Author(s):  
John H. Reif
Keyword(s):  
Computational Complexity ◽  
Optical Computing ◽  
Computing Systems

scholarly journals Optical Computing Systems, Materials, and Devices

2001 ◽  
Vol 40 (11) ◽  
pp. 2369 ◽  
Author(s):  
Khan M. Iftekharuddin
Keyword(s):  
Optical Computing ◽  
Computing Systems

scholarly journals Reflective block optics for packaging of optical computing systems

1994 ◽  
Vol 19 (17) ◽  
pp. 1281 ◽  
Author(s):  
Daisuke Miyazaki ◽  
Jun Tanida ◽  
Yoshiki Ichioka
Keyword(s):  
Optical Computing ◽  
Computing Systems

scholarly journals An Effective Algorithm for the Synthesis of Irreducible Polynomials over a Galois Fields of Arbitrary Characteristics

2021 ◽  
Vol 20 ◽  
pp. 508-519
Author(s):  
Anatoly Beletsky
Keyword(s):  
Computational Complexity ◽  
High Performance ◽  
Large Degree ◽  
Search Method ◽  
Effective Algorithm ◽  
Irreducible Polynomials ◽  
Computing Systems ◽  
Galois Fields ◽  
Average Performance ◽  
Very High

The known algorithms for synthesizing irreducible polynomials have a significant drawback: their computational complexity, as a rule, exceeds the quadratic one. Moreover, consequently, as a consequence, the construction of large-degree polynomials can be implemented only on computing systems with very high performance. The proposed algorithm is base on the use of so-called fiducial grids (ladders). At each rung of the ladder, simple recurrent modular computations are performers. The purpose of the calculations is to test the irreducibility of polynomials over Galois fields of arbitrary characteristics. The number of testing steps coincides with the degree of the synthesized polynomials. Upon completion of testing, the polynomial is classifieds as either irreducible or composite. If the degree of the synthesized polynomials is small (no more than two dozen), the formation of a set of tested polynomials is carried out using the exhaustive search method. For large values of the degree, the test polynomials are generating by statistical modeling. The developed algorithm allows one to synthesize binary irreducible polynomials up to 2Kbit on personal computers of average performance

Efficient designs of reversible BCD to EX-3 Converter with low quantum cost in nanoscale

2020 ◽  
Vol 18 (05) ◽  
pp. 2050020 ◽  
Author(s):  
Mojtaba Noorallahzadeh ◽  
Mohammad Mosleh
Keyword(s):  
Quantum Computing ◽  
Optical Computing ◽  
Reversible Logic ◽  
Quantum Cost ◽  
Computing Systems ◽  
Gate Count ◽  
Reversible Gate ◽  
Significant Research ◽  
Research Domain ◽  
Better Than

As an interesting and significant research domain, reversible logic is massively utilized in technologies, including optical computing, cryptography, quantum computing, nanotechnology, and so on. The realization of quantum computing is not possible without the implementation of reversible logic, and reversible designs are presented mainly to minimize the thermal loss because of the data input bits lost in the irreversible circuit. Digital converters, as the most important logic circuits, are used to connect computing systems with different binary codes. This paper first proposes a new reversible gate called Reversible Noorallahzadeh[Formula: see text]Mosleh Gate (RNMG). Then, using the proposed RNMG gate as well as existing NMG1, NMG6, and PG gates, three different designs of reversible Binary-Coded Decimal (BCD) to EX-3 code converter are proposed. Our results indicate that the proposed BCD to EX-3 code converters are superior to previous designs in terms of quantum cost. Moreover, the proposed converters are comparable or better than previous designs in terms of gate count, constant inputs, and garbage outputs.

Sign in / Sign up

Export Citation Format

Share Document