Abstract

The continued scaling of CMOS and FinFET technologies has introduced significant challenges in digital circuit design, including increased susceptibility to aging effects and heightened leakage power variability. This thesis presents a comprehensive exploration of machine learning (ML)-integrated methodologies for standard cell characterization and complex circuit analysis in the context of advanced CMOS and FinFET technologies. Through a sequence of these studies, the work addresses key challenges associated with reliability, power efficiency, and aging-aware modeling in nanoscale digital circuits. RelOps demonstrates an ML-assisted, multi-objective optimization framework for 16nm HP FinFET standard cells. By integrating SPICE-driven time-series datasets with accurate regression models, the framework enables efficient tuning of critical FinFET dimensions (e.g., channel length, fin width, and fin height), thereby mitigating aging effects such as NBTI and HCI across PVT corners. This approach achieves substantial improvements in power-delay product (PDP) and reduces simulation overhead, establishing a scalable path for performance-centric design optimization. PIDArc proposes a novel physics-informed machine learning (PIML) architecture based on a deaggregated methodology to model the aging-induced leakage behavior in 7nm and 10nm FinFETs through pattern knowledge. This approach addresses the limitations of conventional ML models in handling high-variance leakage data and captures the complex non-linear relationship between aging, PVT variations, and leakage power. The proposed method significantly outperforms existing deep learning and boosting models in terms of prediction accuracy, offering a robust solution for aging-aware leakage estimation. Optimo proposes an ML-based optimization at the complex circuit level via the OptiMo methodology, which automates the reduction of power and delay across diverse designs in CMOS technology. The experimental evaluations on multi-stage circuits demonstrate up to 64.6% PDP reduction, reinforcing the scalability and adaptability of the ML optimization framework from standard cells to hierarchical digital systems. Collectively, the proposed techniques establish a unified ML-driven design flow that bridges devicelevel physics, circuit-level modeling, and system-level optimization. This work not only advances the state-of-the-art in FinFET-based digital circuit design but also offers practical and computationally efficient tools for reliability-aware characterization and performance enhancement in emerging technology nodes.

Abstract

With the rise of quantum computing, the traditional cryptographic techniques may face potential vulnerabilities, particularly in the security-critical applications, such as Internet of Things (IoT)-enabled blockchain systems. These systems rely heavily on the digital signatures for authentication, data integrity, and secure transactions. However, the quantum algorithms like Shor’s algorithm threaten conventional public-key based cryptographic schemes, such as RSA and elliptic curve cryptography (ECC) which make post-quantum cryptography (PQC) essential for future-proof security. IoT devices often have constrained computational power and storage, and thus, it makes challenging to integrate complex security protocols. Post-quantum signature schemes need to be designed which are resilient against quantum attacks, such as lattice reduction attack, hybrid classical-quantum attacks, side-channel and fault injection attacks, and brute-force attacks (e.g., searching for secret keys) using the quantum Grover’s Search algorithm in the context of lattice-based signature schemes. Thus, these signature schemes should ensure the long-term security of IoT networks without significantly increasing computational overhead. Additionally, blockchain-based applications rely on immutable records, which become vulnerable if past transactions can be decrypted in the future. Moreover, post-quantum digital signatures mitigate this risk by providing quantum-safe authentication and verification, maintaining trust in blockchain networks. In addition, regulatory and compliance frameworks are evolving to address quantum security threats, necessitating the adoption of PQC in IoT-blockchain systems. Organizations deploying IoT solutions in critical sectors, such as healthcare, finance, and smart cities, must adopt quantum-resistant cryptographic methods to ensure data privacy and system integrity. This thesis aims to design and develop blockchain-integrated lattice-based cryptographic schemes, including aggregate signatures, multi-signatures, and Ciphertext-Policy AttributeBased Encryption (CP-ABE) in IoT environments, to improve security, efficiency, and scalability. These schemes are intended to address the specific challenges of IoT networks, where devices are often limited in resources and require lightweight but strong security measures. In the first contribution, we designed a new lattice-based aggregate signature scheme that relies on the complexity of the Ring Learning-with-Errors (Ring-LWE) lattice-based hard problem for security. This scheme is then applied within the Internet of Drones (IoD) systems using the blockchain technology to ensure secure and transparent data storage. In this scheme, we described the comprehensive security analysis and comparative study, which indicates that the proposed scheme offers enhanced security, including quantum resistance, is efficient. We implemented the testbed experiments and blockchain simulations further to confirm that theproposed scheme is viable for real-world drone applications. Next, by utilizing the widely-adopted lattice hardness assumptions, namely Ring-based short integer solutions (Ring-SIS) and Ring-LWE, we designed an efficient multi-signature scheme for blockchain-based IoT applications. Additionally, we incorporated the single round online phase in the signing algorithm to achieve a low round complexity. The blockchain has been used as an add-on service for secure data storage purposes. In this case, each signer engages in pre-processing the offline phase before the single round online phase. In the offline phase, all the signers engage in interactions and exchange a set of commit messages among themselves. Subsequently, each party employs a random linear combination approach to aggregate all the commit messages and utilize them to generate the corresponding signature of the signer. Without the participation of all signers, a multi-signature cannot be generated, thereby making it impossible for an adversary to produce a fraudulent multi-signature without knowledge of all signers’ secret keys. The security analysis confirms that the scheme is capable of withstanding various attacks, including quantum attacks. A blockchain simulation was conducted to measure the computational time required for mining blocks in the blockchain. Moreover, a comparative study was presented, featuring several existing lattice-based multisignature schemes, to showcase the effectiveness of the proposed scheme in IoT applications. Finally, we designed a novel multi-authority CP-ABE scheme based on the lattice structure in a distributed environment for IoT-based smart healthcare applications. The work supports the implementation of the trapdoor generation to substantially reduce the computational overhead associated with the keygen phase and Gaussian Pre-image sampling techniques. The proposed scheme that has been developed regards the numerous auth

Abstract

In decision-making settings such as medical diagnosis, underwriting, or sentencing in a court of law, decisions are often influenced by multiple factors like the individual’s background, experience, and personal biases. Variability in decisions across individuals is thus inevitable, and so are disparities in different systems. Every system has its own way of addressing prevailing disparities—be it through noise audits, standardized guidelines, or other approaches. In the medical field, for instance, prior studies have documented significant inter-observer variations in the interpretation of clinical images such as MRIs, X-rays, etc., leading to inconsistencies in diagnoses and treatments. To address the issue, the medical domain is witnessing active development of AI tools intended to support clinical data analysis and reduce disparities in healthcare outcomes. In this thesis, we explore a data cube-based methodology to explore the issue of disparities in the legal domain. In the legal domain, decisions related to parole or bail grants, child custody, or sentence imposition are often left to the judges’ discretion. Specifically for sentence imposition, guidelines in many countries around the world allow for subjectivity. For example, in India, while sentencing guidelines prescribe minimum and maximum punishments for different offences, the weights assigned to various aggravating and mitigating circumstances are left to the judge’s discretion. This flexibility, though intended to accommodate case-specific nuances, increases variance, leading to inconsistencies in trial outcomes, sentence lengths, and penalties across courts and judges. The literature widely acknowledges that anomalies and disparities exist in sentencing and other legal decisions, often stemming from personal beliefs, biases, and contextual factors. Over the years, several efforts have also been made to analyse and assess sentencing anomalies/disparities in India and other parts of the world, particularly with respect to individual factors such as gender, race, socioeconomic background, etc., through surveys, case studies, and machine learning techniques. Notably, the Online analytical processing (OLAP) methodology has been widely employed in literature to analyse multidimensional data in different domains. The concept of a data cube was proposed to summarise and extract all subcubes from a table, enabling multi-dimensional analysis and derivation of insights from diverse perspectives. It is commonly adopted to extract interesting trends and anomalies from multidimensional data in domains like sales, marketing, etc. However, so far, no effort has been made to extend the data cube-based framework to explore anomalies and disparities in the legal domain. In this thesis, we leverage the OLAP framework and propose a data cube-based approach to explore potential trends and anomalies in judicial decisions, particularly sentences. A major bottleneck in this domain has been the lack of structured datasets. To address this, we employed a large language model (LLM) to curate a structured dataset from unstructured data extracted manually from Indian criminal case judgments. We designed a conceptual schema by identifying relevant attributes, hierarchies, and defining appropriate aggregate measures. We used this schema to build a data cube on the curated dataset and facilitate anomaly detection. This approach enabled us to uncover potential anomalies in court sentences, particularly in terms of quantum and monetary penalties for similar offenses across Indian states. For instance, we observed that Kerala imposed relatively higher monetary penalties in cases of rape and murder compared to other states. Several additional trends were also identified. Our experiments demonstrate that the proposed framework has the potential to identify the anomalies that could help in further understanding the causal factors, such as bias, that contribute to such anomalies and disparities. We also provide a structured dataset annotated by domain experts, which treasures sentencing-related information along with the verdict rationale from judgements of around 10,000 criminal cases adjudicated in the Trial court, High Court, and Supreme Court of India during 2000-2010. We make this dataset public to encourage further research

Abstract

biomedicine, but their size increasingly exceeds the on-board memory of modern GPUs. While GPUs offer substantial parallelism and memory bandwidth, many real-world inputs fit in CPU memory but not in GPU memory, making naive GPU-only methods inapplicable and unified-memory or zero-copy approaches unpredictable on irregular workloads. This thesis introduces the Parallel Heterogeneous External Memory (PHEM) model—a principled framework for processing graphs that exceed GPU memory while leveraging both CPU and GPU effectively. PHEM targets the regime where the full edge set must be streamed to the device, but the vertex set and modest auxiliary state fit on the GPU. The model partitions an input edge stream into a CPU portion and GPU batches and overlaps communication with computation so that the GPU processes batch i while batch i+1 is transferred. A tunable parameter controls the CPU–GPU work split, enabling adaptation to hardware and dataset characteristics. We present a generic algorithmic template with three customizable components—CPUCompute, GPUCompute, and GPUMerge—that maintains incremental state across batches and minimizes device-space footprint, requiring only one or two passes over the input. We instantiate the model for minimum spanning tree computation (PHEM-MST). On the GPU, we design a memory-efficient Boruvka variant on an edge-list representation that avoids symmetric dupli- ˚ cates and uses a two-phase atomic procedure to find best neighbors, followed by iterative shortcutting and filtering. In parallel, the CPU executes a filter-based Kruskal to prune non-MST edges from its partition. A final GPU-side merge combines the CPU and GPU forests; correctness follows from the optimal substructure of MST. We evaluate on eleven graphs spanning road networks, web crawls, social networks, synthetic generators, and biomedical literature—up to 11.6B edges—on two heterogeneous systems (NVIDIA L4, 24 GB; NVIDIA A100, 40 GB) paired with AMD EPYC CPUs. Against state-of-the-art CPU and GPU baselines (PBBS, ECL-MST) and a monolithic GPU variant, PHEM-MST processes all datasets, including those that exceed GPU memory for baselines, and achieves speedups up to 3.5×. Performance improves further on the A100, underscoring the role of device memory bandwidth. We analyze the impact of batch count and show dataset-specific optima that balance compute, contention, and transfer overheads; explicit batching with overlapped transfers yields more predictable performance than unified-memory mechanisms on irregular access patterns. Contributions include the PHEM model and reusable framework for heterogeneous, out-of-memory graph processing; an efficient PHEM-MST design and implementation; and a comprehensive empirical iii iv study with guidance for tuning and portability. We discuss limitations (parameter sensitivity, structureaware partitioning) and extensions (multi-GPU scaling, disk-backed execution). Beyond MST, the model naturally extends to BFS, connected components, and PageRank on graphs that outgrow GPU memory.

Abstract

Water quality monitoring of inland waterbodies is a global challenge due to limited monitoring infrastructure and availability of high-resolution hydrological data. Timely assessment and mitigation of water quality threats is constrained by limited data availability. To address this issue, remote sensing techniques have emerged as a robust tool for continuous real-time monitoring of inland water quality. In tropical regions, there has been a greater emphasis on remote sensing techniques for the continuous monitoring of water quality, mainly in eutrophic or hypereutrophic inland water bodies such as estuaries, rivers, and lakes, while reservoirs have received comparatively less attention. However, worldwide, tropical reservoirs are vulnerable to contamination risks due to their multifunctional roles, i.e., drinking, irrigation, and hydropower generation and long periods of storage times without adequate outflows which are critical for maintaining downstream water quality. Furthermore, the surrounding catchment influence contamination dynamics, as rapid changes in land use/land cover (LULC) can introduce sediments, nutrients, and heavy metals, contributing to elevated levels of physical, biological, and chemical characteristics of water quality parameters. Identifying the critical importance of monitoring tropical reservoirs, the present study focuses on employing remote sensing techniques to estimate water quality parameters, focusing on physio-biological characteristics, mainly in oligotrophic and mesotrophic reservoirs, and underscores the significance of catchment-related factors in influencing contamination levels. This approach is essential for maintaining optimal water quality levels, benefiting both local communities and the surrounding environment. The study selected two tropical reservoirs, Bhadra and Tungabhadra, situated within the same river system and experiencing similar climatic conditions but distinct landscape characteristics. The primarily aim is to develop a modeling framework to map and quantify the spatiotemporal variability of Chlorophyll-a (Chl-a), turbidity and surface water temperature (SWT), along with associated water spread for 2016-2021 using Sentinel 2 and Landsat 8 satellite datasets. The second aim is to examine interconnections among selected water quality parameters, to improve the accuracy of reservoir water quality assessments and identify potential correlations and interdependencies. The third aim is to comprehend how the landscape (land use/land cover (LULC)) and meteorological variables (rainfall, air temperature) of the contributing catchment influence contamination dynamics. The remote sensing-based results, validated with field-based observations measured from the Aquaread AP7000 instrument and secondary data include EOMAP (Earth Observation and Mapping) water quality derived datasets were employed to enhance accuracy and reliability. Chl-a, used as a proxy for nutrient contamination primarily from agricultural runoff, estimated using the Maximum Chlorophyll Index (MCI) derived from Sentinel 2 satellite data in the Google Earth Engine (GEE) platform. The results indicate a consistent and extensive distribution of Chl-a across the entire water surface of the Tungabhadra reservoir, while the Bhadra reservoir exhibited a more limited distribution. During the post-monsoon, increase in Chl-a spread in the Tungabhadra reservoir, primarily attributed to nutrient-rich water inflows from agricultural and urban areas. This notable rise linked to the harvesting of Kharif crops. Additionally, the discharge of untreated sewage further contributes to the degradation of water quality in the Tungabhadra reservoir. In contrast, the Bhadra reservoir, surrounded predominantly by forested areas, maintained water cleanliness and served as a riparian boundary. These findings demonstrate how LULC changes drive nutrient contamination in tropical reservoirs. Turbidity was considered as a proxy for sediments, detected and mapped using Sentinel-2 data. The Normalised Difference Turbidity Index (NDTI) values strongly correlated with EOMAP and field-based observations having values > 10 NTU (nephelometric turbidity unit) with R 2 = 0.81 and standard error estimate (SEE) of 5.3, respectively. In addition, the correlation between red band reflectance values with < 10 NTU, demonstrated a strong relation with an R 2 = 0.74, SEE = 1.7. Combining NDTI and red band reflectance allowed classification into low, moderate, and high turbidity zones. Further analyses indicated that diverse land use patterns, particularly high proportions of urban and agriculture area along with rainfall, significantly influenced the annual and seasonal turbidity variations. Surface water temperature (SWT) is a significant physical parameter affecting aquatic metabolism, nutrient cycling, and contaminant interaction was estimated using Landsat 8 Thermal Infrared (TIR) d

Abstract

While text-to-image (T2I) models have demonstrated remarkable improvements in spatial consistency and positioning of large scene components, they struggle with fine-grained structural control, particularly for anatomically complex objects with multiple interconnected parts. This limitation manifests as anatomical inconsistencies, missing or hallucinated components and incorrect part connectivity, critical failures for applications requiring precise structural fidelity. Recent developments in controlled image generation have produced models capable of high-fidelity synthesis. However, these models either rely on sophisticated conditioning inputs such as detailed pose skeletons or segmentation masks that require human expertise. We introduce PLATO, a novel two-stage framework that bridges this gap by enabling precise, partcontrolled object generation from simple, intuitive inputs: an object category and a list of constituent parts. The first stage employs PLayGen, our novel part layout generator built upon a Graph Convolutional Network Variational Autoencoder (GCN-VAE) architecture. PLayGen consists of a GCN Refinement Decoder that iteratively refines part placements through graph-based message passing, capturing inter-part spatial relationships during refinement. To address the challenge of training with nonintersecting bounding boxes and small parts, we introduce the Dynamic Margin IOU (DyI) loss, which dynamically adjusts margins based on box dimensions to ensure meaningful gradients throughout training. Additionally, our Differential Refinement loss scheme enables the model to learn both coarse positioning and fine-grained adjustments simultaneously. The overall loss formulation also has the effect of stabilizing the training process while improving structural coherence. In the second stage, PLayGen’s synthesized layout guides a custom-tuned ControlNet-based diffusion model through a novel visual conditioning format using color-coded inscribed ellipses combined with part-aware text prompts. This design enforces both spatial constraints and semantic consistency, resulting in anatomically accurate, high-fidelity object generations that faithfully contain precisely the user-specified parts. We observed that standard layout and image quality metrics do not sufficiently capture the nuances of structural composition. To address this gap for a rigorous structural consistency evaluation, we also propose novel part-level evaluation measures including Disconnection Percentage (measuring layout connectivity), Part-Layout IOU (quantifying spatial adherence) and Part-Layout F1 score (assessing part presence accuracy). Experiments on PASCAL-Parts and PartImageNet datasets demonstrate that PLATO significantly outperforms state-of-the-art approaches across both layout quality and structural controllability

Abstract

Automated segmentation of medical image volumes holds immense potential to significantly reduce the time and effort required from medical experts for annotation. However, leveraging machine learning for this task remains a formidable challenge due to variations in imaging modalities, the inherent complexity of medical images, and the limited availability of labeled patient data. While existing interactive segmentation methods and foundational models incorporate user-provided prompts to iteratively refine segmentation masks, they often fail to learn the continuity and inter-related information between consecutive slices in a 3D medical image volume. This limitation leads to inconsistencies, spatial discontinuities, and loss of anatomical coherence, ultimately affecting the reliability of segmentation results in clinical applications. The work proposes a novel interactive segmentation framework that dynamically updates model parameters during inference using a test-time training paradigm guided by user-provided scribbles. Unlike traditional approaches, our method preserves crucial spatial and contextual information from both previously processed slices within the same medical volume and the training dataset through a studentteacher learning mechanism. By leveraging sequential dependencies across slices, our approach ensures smoother and more anatomically consistent segmentation masks while integrating prior knowledge from the training distribution. We extensively evaluated our framework across diverse datasets, encompassing CT, MRI, and microscopic cell images, demonstrating its superior performance in both efficiency and accuracy. Our method significantly reduces user annotation time by a factor of 6.72× compared to manual annotation workflows and factor of 1.93× compared to state-of-the-art interactive segmentation methods. Furthermore, when benchmarked against foundational segmentation models, our framework achieves a Dice score of 0.9 within just 3–4 user interactions—substantially improving upon the 5–8 interactions required by existing models. This reduction in required interactions translates to a more streamlined and intuitive annotation process for volumetric CT and MRI scans. Additionally, our framework exhibits strong generalization capabilities, effectively segmenting unseen objects with minimal user guidance while maintaining spatial continuity across slices. Its ability to dynamically adapt during inference, integrate sequential information, and leverage interactive feedback makes it a highly effective tool for medical image analysis. To facilitate adoption and further research, we will publicly release the full source code, pre-trained models, and the developed annotation tool upon publication. This work underscores the transformative potential of our framework in enhancing the efficiency, accuracy, and consistency of medical image segmentation, addressing a critical need in the medical imaging field.

Abstract

Quantum computing currently stands at the threshold of practical applications, although large-scale, faulttolerant quantum computers remain distant. Indeed, despite practical quantum computers having been perpetually “ten years away" for the past ten years, incremental yet substantial advances continue to fuel optimism. Remarkable progress over the past decade has led to increasingly robust, larger-scale, and better-connected quantum hardware. Notably, recent years have witnessed several demonstrations of quantum computing devices whose physical error rates lie below critical thresholds required by certain error-correction schemes, signaling a significant transitional phase in quantum computing technology. Nevertheless, fully fault-tolerant quantum computers capable of executing arbitrarily large quantum circuits with an unrestricted number of qubits are still far off. Instead, near-term quantum hardware will be limited to simpler, shallow-depth circuits operating on a restricted number of qubits. Such early fault-tolerant quantum devices cannot accommodate advanced quantum subroutines like amplitude amplification, block-encoding, or Quantum Singular Value Transformation (QSVT), which inherently rely on deep quantum circuits, multi-controlled gates, and extensive ancillary qubit resources. Consequently, it becomes imperative to rethink quantum algorithm design, focusing specifically on algorithms that operate within these restricted computational frameworks. Motivated by this challenge, this thesis develops quantum algorithms explicitly tailored for early faulttolerant quantum computing devices. We introduce a randomized quantum algorithm for efficiently simulating quantum collision models which provide a versatile theoretical framework for modeling open quantum system dynamics. Quantum collision models describe physical processes in which the system undergoes repreated interactions with a sequence of environmental degrees of freedom. Our algorithm employs a novel approach that composes multiple controlled short-time evolutions of simple Hamiltonians, interspersed with operations that trace out the environmental registers. Crucially, our method requires neither specialized quantum subroutines such as block-encodings nor extensive ancillary qubit resources, thus aligning closely with the limitations of near-term quantum devices. Moreover, by exploiting the fundamental correspondence between Lindbladian evolution and Markovian collision models, we present an end-to-end quantum algorithm for simulating Lindbladian dynamics tailored specifically for near-term quantum hardware. For a quantum system consisting of n qubits, we provide a detailed analysis of the circuit depth required to estimate expectation values of observables with respect to the state evolved under open quantum dynamics for evolution time t. Our algorithm performs this simulation using at most n+2 qubits, achieving a circuit depth that scales polynomially with the number of qubits, desired precision, and evolution time. Additionally, we offer a detailed comparison of our algorithm with existing approaches, highlighting advantages in terms of required resources and suitability for near-term quantum hardware. We further generalize our framework beyond the memoryless scenario, developing an efficient method to simulate memory-retaining collision models, where successive environmental interactions give rise to non-Markovian dynamics. This extension allows us to model more intricate and realistic open-system behaviors that inherently exhibit memory effects. By providing novel quantum algorithms that robustly simulate both Markovian and non-Markovian quantum dynamics within early fault-tolerant quantum computing platforms, this thesis significantly expands the scope of feasible quantum simulations. Collectively, these advances offer a deeper understanding of the computational capabilities and inherent limitations of imminent quantum technologies, laying an essential foundation for further theoretical and practical developments in quantum computing.

Abstract

Power, Performance, and Area have been some of the most crucial specification metrics to adjudge the quality of systems. Circuits based on nanoscale transistors operate at lower values of threshold and supply voltages, thereby providing better power-delay specifications. CMOS based nanoscale circuits (≤45nm) show higher static leakage losses than dynamic losses and become highly sensitive to PVT (Process parameters, Supply Voltage and Temperature) variations. Reliability analysis of the circuit in terms of propagation delays are greatly affected factors such as Bias Temperature Instability (BTI) and Hot Carrier Injection. Hence optimization is one of the most important aspects of the design flow. This thesis suggests an algorithm-based transistor sizing approach toward low-power and high-performance optimization of digital circuits. It proposes the use of 2 swarm intelligence based algorithms- Spider Monkey Optimization and Elephant Herding Optimization for transistor resizing in gates/ blocks either for low power or for high performance scenarios. In the first phase discussions, basic digital cells such as logic gates and blocks like Full Adders are optimized by resizing their transistors to meet the required specifications. The second phase involves the optimization of complex circuits comprising several of such basic cells/ blocks. This includes factors such as the critical signal path performance specifications, pairwise driver(s) and load(s) analysis, etc. This thesis proposes a python based top level module that scans through the circuit for potential critical/ near critical signals paths, identifies the types of basic cells present and the loads they drive, optimizes and finally places the appropriate resized cells to improve the overall circuit performances. We could obtain about 65% power and 44% in high performance optimization. Approximate computation deals in fields where the accuracy has a more relaxed tolerance level such asimage processing,speech processing etc. Thisis due to the fact that human senses are cannot perceive minute errors. We have utilized this performance-accuracy trade-off phenomenon to design low power systems with the help of algorithms. We have generated low power Full Adder designs through transistor pruning (selective removal of transistors) for speech processing systems with 67% power optimization. Accuracy has been tested and our design show improved performances as compared to previous works.

Abstract

Stuttering is a neurodevelopmental uency disorder characterized by disruptions in the normal ow of speech, such as repetitions of sounds, syllables, or words, prolongations of sounds, and audible or silent blocks. These speech disuencies can lead to signicant communication challenges and adversely affect an individual’s social, emotional, and occupational well-being. Accurate and timely detection and classication of stuttering events are crucial steps for appropriate clinical intervention, personalized therapy planning, and monitoring treatment efcacy. Traditional assessment methods often rely on perceptual judgments by clinicians, which, while valuable, can be subjective, time-consuming, and may exhibit inter-rater variability, particularly in complex cases or large-scale studies. Consequently, objective assessment methods leveraging computational analysis are gaining prominence due to their potential for enhanced consistency, efciency, and scalability in both clinical practice and research settings. There is a growing impetus for robust automated systems that can reliably identify stuttering events and categorize them, thereby assisting clinicians in the diagnostic process and in objectively tracking therapeutic progress over time. The development of objective assessment tools utilizing acoustic and signal processing techniques for the analysis of speech can effectively uncover the specic manifestations and nuances of stuttered events. Therefore, the extraction of salient acoustic, temporal, and prosodic features from the speech signal is considered a paramount step in building robust automated systems for stuttering analysis. While previous research has made strides in the automatic detection of stuttering, further advancements are necessary to improve the accuracy of detecting the diverse range of disuency types and to reliably differentiate stuttered speech from instances of typical disuency that occur in normally uent speakers. To characterize the distinct acoustic and temporal patterns associated with various stuttered events, a detailed analysis of speech segment durations, spectral characteristics, energy contours, and fundamental frequency variations is essential. Furthermore, the application of advanced signal processing methodologies and machine learning algorithms holds signicant promise for enhancing the performance and discriminative power of stuttering assessment systems. The primary objectives of this thesis are the automatic detection of stuttering from continuous speech signals and the subsequent classication of these identied stuttering events into their respective types. In this thesis, SEP-28k was the primary dataset used in most of the studies and also used Fluency Bank, VCTK stutter corpus. The F1 score and Accuracy were the primary metrics used for the evaluation of the models.