|
|
|
| Comparison of Programmable Josephson Junction Array voltage output algorithms |
|
|
|
|
Abstract Introduces the principles of a balanced ternary algorithm and a non-integer multiple algorithm for the voltage output of programmable Josephson junction arrays. Through a comprehensive comparative analysis of these algorithms, including the algorithm's execution process, time complexity, structure number offset, and segment bias, based on a practical programmable Josephson junction array case, it was found that the non-integer multiple algorithm has a more concise execution process, higher computational speed, and the ability to choose fewer subarrays to output the same voltage. In terms of structure number offset, the results of the two algorithms are almost identical. In addition, the non-integer multiple algorithm can be used to expressing integer using binary sequence, ternary sequence or non-integer multiple sequence. It demonstrates that non-integer multiple algorithm has a strong advantage.
|
|
Received: 19 February 2024
Published: 19 March 2025
|
|
|
|
|
|
|
2025, Vol. 46 
