1 December 2010 in Advanced Science Letters
The architecture of a surveillance system, able to make up for the poor ability of the immune system in recognizing endogeneous diseases (like cancer, arteriosclerotic vascular disease, Alzheimer disease, etc.), is designed. Based on the use of swarms of nanobots communicating with a resident central unit, this architecture can actually be implemented, though at a rudimentary level, with current technologies based on the functionalization of integrated circuits.
29 February 2024 in IEEE Transactions on Computers
We propose the Active Compute Memory (ACM), a near-memory-processing architecture capable of performing key–value sort directly in the DRAM. In the ACM architecture, sort is merely the writing of data into memory with one addressing protocol (perspective) and reading it back with different perspective. The first perspective is conventional, based on the data address; the second perspective is the sorted order. The ACM requires additional tables to store the meta-data and moderate control logic enhancements that can be implemented directly in the DRAM silicon. By these modest enhancements to DRAM, ACM exploits the parallelism inherently available in the row buffer to enable sort with O ( n ) complexity. This leads to an order of magnitude improvement in ACM performance and energy compared to conventional O ( n log n ) CPU-centric sort algorithms. The ACM also shows superior performance compared to other near-memory sort accelerators. This is because the ACM processing is done near the row buffer and it exploits much lower memory access latency, higher bandwidth and wider parallel processing. The sort operation covered in this paper is just an example of an address management operation that can be efficiently implemented directly in the DRAM silicon. We release as an open source the simulation infrastructure for the ACM performance and energy modeling. We would encourage the community to use it, adapt it to other PIM proposals, and share their own evaluations.
1 April 2019 in Microprocessors and Microsystems
28 January 2026 in IEEE Transactions on Communications
Low-complexity detection schemes are studied for additive white Gaussian noise channels with an unknown and unbounded offset constant over each memory read. Detectors based on the Pearson distance are analyzed, and a new lower bound on the word error rate of Modified Pearson (MP) detection is derived. Three novel detectors are proposed: the Simplified Pearson (SP), the Ultra-Simplified Pearson (USP), and the Adjusted-Threshold (AT) detectors. The USP and AT detectors are designed to be robust against destructive readings. The proposed schemes are particularly suited for memory systems employing ramp-reading architectures. The analysis demonstrates that the proposed detectors achieve competitive error-rate performance with significantly reduced complexity compared to MP detection.