Paper List
-
The Effective Reproduction Number in the Kermack-McKendrick model with age of infection and reinfection
This paper addresses the challenge of accurately estimating the time-varying effective reproduction number ℛ(t) in epidemics by incorporating two crit...
-
Covering Relations in the Poset of Combinatorial Neural Codes
This work addresses the core challenge of navigating the complex poset structure of neural codes to systematically test the conjecture linking convex ...
-
Collective adsorption of pheromones at the water-air interface
This paper addresses the core challenge of understanding how amphiphilic pheromones, previously assumed to be transported in the gas phase, can be sta...
-
pHapCompass: Probabilistic Assembly and Uncertainty Quantification of Polyploid Haplotype Phase
This paper addresses the core challenge of accurately assembling polyploid haplotypes from sequencing data, where read assignment ambiguity and an exp...
-
Setting up for failure: automatic discovery of the neural mechanisms of cognitive errors
This paper addresses the core challenge of automating the discovery of biologically plausible recurrent neural network (RNN) dynamics that can replica...
-
Influence of Object Affordance on Action Language Understanding: Evidence from Dynamic Causal Modeling Analysis
This study addresses the core challenge of moving beyond correlational evidence to establish the *causal direction* and *temporal dynamics* of how obj...
-
Revealing stimulus-dependent dynamics through statistical complexity
This paper addresses the core challenge of detecting stimulus-specific patterns in neural population dynamics that remain hidden to traditional variab...
-
Exactly Solvable Population Model with Square-Root Growth Noise and Cell-Size Regulation
This paper addresses the fundamental gap in understanding how microscopic growth fluctuations, specifically those with size-dependent (square-root) no...
Scalable DNA Ternary Full Adder Enabled by a Competitive Blocking Circuit
Institute of Computational Science and Technology, Guangzhou University, China | School of Computer Science and Technology, Wuhan University of Science and Technology, China | School of Computer Science and Technology, Dalian University of Technology, China | School of Computing Science, Peking University, China
30秒速读
IN SHORT: This paper addresses the core bottleneck of carry information attenuation and limited computational scale in DNA binary adders by introducing a scalable ternary architecture.
核心创新
- Methodology Proposes a novel Competitive Blocking (CB) circuit that leverages differential reaction kinetics (k2 ≫ k1, k3) to dynamically select and block reaction pathways for precise carry information management.
- Methodology Introduces a ternary (base-3) adder architecture, moving beyond binary systems, which inherently reduces the frequency of carry propagation and increases single-bit information density.
- Methodology Implements a Dynamic Concentration Adjustment (CA) strategy, applying chemical equilibrium principles to optimize reactant ratios and signal transmission, enabling significant bit-width extension.
主要结论
- The CB circuit reliably performs ternary full-adder logic, with experimental validation showing successful 10-bit addition operations.
- The integrated CA strategy enables the adder to scale to 17-bit addition, representing a massive increase in computational scale.
- The architecture achieves a 'scale/strand' metric improvement of 2,405,552x compared to a recent state-of-the-art binary DNA adder capable of only 4 consecutive carries.
摘要: DNA adder circuits are programmable reaction networks that process DNA molecular inputs to compute a sum and serve as essential components for digital computation. Currently, DNA adders primarily focus on binary addition. While efforts extend the operational bit-width by minimizing the number of DNA strands and developing carry-transmission mechanisms, challenges such as the susceptibility of carrying information to attenuation and the limited expressive capacity of the binary system impose significant constraints on computational scale. This paper proposes a scalable ternary adder architecture by introducing an innovative competitive blocking (CB) circuit. The architecture employs a dual cooperative optimization strategy that significantly enhances single-bit computational capacity and incorporates a dynamic concentration adjustment (CA) to effectively broaden the computational bit-width. Consequently, a significant increase in molecular computing scale is achieved compared to previous binary adders. Biochemical experimental results indicate that the CB circuit effectively outputs the ternary full-adder bit and successfully performs 10-bit addition. Furthermore, by implementing the CA strategy, this adder can be further extended to support 17-bit addition. This research provides a novel methodological foundation for advancing DNA computing technologies and offers promising potential for scalable digital computing applications.