Results 11 to 20 of about 38,175 (260)
IEEE Access, 2023 Spin-torque-transfer magnetic random access memory (STT-MRAM) has recently emerged as a promising technology to replace dynamic random access memory (DRAM).
Thien An Nguyen, Jaejin Lee
doaj +1 more source
On the Design of 7/9-Rate Sparse Code for Spin-Torque Transfer Magnetic Random Access Memory
IEEE Access, 2021 A design of 7/9-rate sparse code for spin-torque transfer magnetic random access memory (STT-MRAM) is proposed in this work. The STT-MRAM using spin-polarized current through magnetic tunnel junction (MTJ) to write data is one of the most promising ...
Chi Dinh Nguyen
doaj +1 more source
IEEE Access, 2023 In non-volatile random-access memory (RAM) technologies, the spin-torque transfer magnetic random-access memory (STT-MRAM) is a promising candidate. STT-MRAM has attracted attention owing to its advantages, such as a high density, high endurance, and ...
Thien An Nguyen, Jaejin Lee
doaj +1 more source
Synthesis of a comprehensive population code for contextual features in the awake sensory cortex
eLife, 2021 How cortical circuits build representations of complex objects is poorly understood. Individual neurons must integrate broadly over space, yet simultaneously obtain sharp tuning to specific global stimulus features.
Evan H Lyall +5 more
doaj +1 more source
Mathematics, 2022 Electrocardiogram (ECG) is a common and powerful tool for studying heart function and diagnosing several abnormal arrhythmias. In this paper, we present a novel classification model that combines the discriminative convolutional sparse coding (DCSC ...
Bing Zhang, Jizhong Liu
doaj +1 more source
Foundations and Trends® in Communications and Information Theory, 2019 Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this goal in the last couple of decades, with the emergence of turbo codes, sparsegraph codes, and polar codes.
Ramji Venkataramanan +2 more
openaire +2 more sources
Sparse Coding and Autoencoders [PDF]
2018 IEEE International Symposium on Information Theory (ISIT), 2018 In this new version of the paper with a small change in the distributional assumptions we are actually able to prove the asymptotic criticality of a neighbourhood of the ground truth dictionary for even just the standard squared loss of the ReLU autoencoder (unlike the regularized loss in the older version)
Akshay Rangamani +6 more
openaire +3 more sources
Scholarpedia, 2008 The(frequently updated) original version is avalable at http://www.scholarpedia.org/article ...
Peter Földiák, Dominik M. Endres
openaire +2 more sources
IEEE Transactions on Information Theory, 2014 51 pages, 12 figures, submitted to IEEE Transactions on Information ...
Shenghao Yang 0001, Raymond W. Yeung
openaire +2 more sources
IET Communications, 2023 This paper studies the blind recognition method of the sparse parity‐check matrices of low‐density parity‐check codes in noncooperative communication, which is critical to the reverse analysis of communication protocols using LDPC codes.
Yong Ding, Zhiping Huang, Jing Zhou
doaj +1 more source