.png){kind=icon}
返回
Dynamic Threshold Detection Based on Pearson Distance Detection
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2018.2814618.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the transmission and storage of encoded strings of symbols over a noisy channel, where dynamic threshold detection is proposed for achieving resilience against unknown scaling and offset of the received signal. We derive simple rules for dynamically estimating the unknown scale (gain) and offset. The estimates of the actual gain and offset so obtained are used to adjust the threshold levels or to re-scale the received signal within its regular range. Then, the re-scaled signal, brought into its standard range, can be forwarded to the final detection/decoding system, where optimum use can be made of the distance properties of the code by applying, for example, the Chase algorithm. A worked example of a spin-torque transfer magnetic random access memory with an application to an extended (72, 64) Hamming code is described, where the retrieved signal is perturbed by additive Gaussian noise and unknown gain or offset.
Keyword:
Constrained coding
storage systems
non-volatile memories
Pearson distance
Euclidean distance
channel mismatch
Pearson code
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Ab-initio MCSCF study of the homolytic S-S bond dissociation in disulphides, thiosulphinates and α-disulphoxides..png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
查看更多内容