ARCHIVES

Original Article

An Analysis of Entropy Reduction in Digital Logic Circuits with Feedback

Sourjya Gupta1 Sumana Sikdar2 Anwesha Bose3
1 2 3 Department of Computer Science Engineering, Techno India University, Kolkata, West Bengal, India.

Published Online: September-December 2025

Pages: 258-264

Abstract

: This paper demonstrates that a designed Boolean logic circuit with feedback connections can transform completely random binary inputs into structured output sequences exhibiting lower Shannonentropy. We establish that the circuit output follows an ergodic Markov chain, which—by the law of large numbers—converges to a non-uniform probability distribution over sequences. This convergence reduces Shannon entropy from its maximum value of 4.7004 bits (for perfectly random sequences) to lower values. We formalize the circuit architecture using combinational logic gates with controlled probabilities and demonstrate through both mathematical derivation and computational experiments that random inputs, when processed through appropriate logic arrangements, can produce increasingly deterministic patterns. This work establishes a fundamental connection between Boolean circuit topology and information-theoretic properties, suggesting that determinism can emerge from randomness through structural design.

Related Articles

2025

Transforming Cyber-Physical Systems: Machine Learning for Secure and Efficient Solutions

2025

Exploring AI Techniques for Quantum Threat Detection and Prevention

2025

Maturity Models for Business Intelligence: An Overview

2025

INSPIRO: An AI Driven Institution Auditor

2025

Adaptive AI Framework for Anomaly Detection and DDoS Mitigation in Distributed Systems

2025

Predictive Modeling for College Admission Using Machine Learning and Statistical Methods

Share Article

X
LinkedIn
Facebook
WhatsApp

Or copy link

https://test.indjcst.com/archives/10.59256/indjcst.20250403041

*Instagram doesn't support direct link sharing from web. Copy the link and share it in your Instagram story or post.