IAI. Zakir Ahmed

I. Zakir Ahmed

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


I. Zakir Ahmed has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • An Information-Theoretic Branch-and-Prune Algorithm for Discrete Phase Optimization of RIS in Massive MIMO

    by I. Zakir Ahmed, Hamid R. Sadjadpour, Shahram Yousefi

    In this paper, we consider passive RIS-assisted multi-user communication between wireless nodes to improve the blocked line-of-sight (LOS) link performance. The wireless nodes are assumed to be equipped with Massive Multiple-Input Multiple-Output antennas, hybrid precoder, combiner, and low-resolution analog-to-digital converters (ADCs). We first derive the expression for the Cramer-Rao lower bound (CRLB) of the Mean Squared Error (MSE) of the received and combined signal at the intended receiver under interference. By appropriate design of the hybrid precoder, combiner, and RIS phase settings, it can be shown that the MSE achieves the CRLB. We further show that minimizing the MSE w.r.t. the phase settings of the RIS is equivalent to maximizing the throughput and energy efficiency of the system. We then propose a novel Information-Directed Branch-and-Prune (IDBP) algorithm to derive the phase settings of the RIS. We, for the first time in the literature, use an information-theoretic measure to decide on the pruning rules in a tree-search algorithm to arrive at the RIS phase-setting solution, which is vastly different compared to the traditional branch-and-bound algorithm that uses bounds of the cost function to define the pruning rules. In addition, we provide the theoretical guarantees of the near-optimality of the RIS phase-setting solution thus obtained using the Asymptotic Equipartition property. This also ensures near-optimal throughput and MSE performance.


  • Open Access

    Information-Assisted Dynamic Programming for a Class of Constrained Combinatorial Problems

    by I. Zakir Ahmed, Hamid R. Sadjadpour, Shahram Yousefi

    The constrained discrete optimization (CDO) problems pose an immense challenge to solve with provable accuracy and computational efficiency. Dynamic programming (DP) is an elegant technique that is used to solve a class of such problems with linear constraints that follow a particular structure, namely Bellman’s principle of optimality (BPO). Unfortunately, many of the CDO problems do not fall into this category. This work focuses on solving a class of CDO problems, which we call problem class H, that do not satisfy BPO if the constraint functions are considered. There are no conditions placed on the constraint functions of H. However, the objective function alone satisfies the BPO. Such problems are ubiquitous in wireless communication, signal processing, and machine learning. These problems are, in general, NP-Hard. This paper attempts to unify this class of problems to be solvable using the DP framework. Using the theory of multi-objective optimization and assisted by an information-theoretic measure, we establish provable near-optimality guarantees with reduced computational complexity. We describe two algorithms to solve H. We support our claims by solving the power-constrained analog-to-digital converter bit allocation (BA) problem in massive Multiple-Input Multiple-Output (MaMIMO) receivers. The optimal BA thus obtained ensures the maximum energy efficiency of the MaMIMO receiver.


  • Open Access

    Low Power Decoding of LDPC Codes

    by Mohamed Ismail, Imran Ahmed, Justin Coon

    Wireless sensor networks are used in many diverse application scenarios that require the network designer to trade off different factors. Two such factors of importance in many wireless sensor networks are communication reliability and battery life. This paper describes an efficient, low complexity, high throughput channel decoder suited to decoding low-density parity-check (LDPC) codes. LDPC codes have demonstrated excellent error-correcting ability such that a number of recent wireless standards have opted for their inclusion. Hardware realisation of practical LDPC decoders is a challenging area especially when power efficient solutions are needed. Implementation details are given for an LDPC decoding algorithm, termed adaptive threshold bit flipping (ATBF), designed for low complexity and low power operation. The ATBF decoder was implemented in 90 nm CMOS at 0.9 V using a standard cell design flow and was shown to operate at 250 MHz achieving a throughput of 252 Gb/s/iteration. The decoder area was 0.72 mm2 with a power consumption of 33.14 mW and a very small energy/decoded bit figure of 1.3 pJ.


  • Monolithic DC-DC boost converter with current-mode hysteretic control

    by Ayaz Hasan, Stefano Gregori, Imran Ahmed, Raymond Chik

    A monolithic DC-DC boost converter with current-mode hysteretic control is designed and simulated in 0.18-μm CMOS technology. The system is simple, robust, and has a fast response to external changes. It does not require an external clock, and the output is regulated by voltage feedback in addition to limiting the inductor current by sensing it. A non-overlapping clock is internally generated to drive the power switches using buffers designed to minimize power dissipation. For conversion specifications of 1.8 V to 3.3 V at 150 mA, overall efficiency of 94.5% is achieved. Line regulation is 17.5 mV/V, load regulation is 0.33% for a 100 mA current step, while the output voltage ripple is below 30 mV for nominal conditions.