학술
기타
Fixed Point Exploration For CV-QKD IR QC-MET-LDPC Toward Hardware Implementation
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
High-speed LDPC decoding is a major bottleneck in CV-QKD and motivates hardware acceleration with fixed-point arithmetic.
This work compares SPA, MSA, and NMS under a unified low-SNR fixed-point framework using common graph, matrix, and quantization settings.
Multiple formats are evaluated through FER, and average iterations.
The results show that performance depends strongly on the interaction between decoder rule and numerical precision.
SPA achieved the best overall performance.
For reduced-complexity decoders, Q16.8 was the lowest consistent precision, with NMS outperforming MSA.
Practically, SPA with Q8.4 offered the best balance between reliability and hardware efficiency for large-scale implementations.
이 뉴스, 어떠셨어요?
탭 한 번으로 반응 · 로그인 불필요
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
arXiv의 다른 기사
Deterministic Replay for AI Agent Systems
arXiv CS.AI
Generative Ontology Induction: Domain-Agnostic Schema Discovery from Document Corpora Using Large Language Models
arXiv CS.AI
Democratizing AI with Small Language Models: Structured Benchmarking and Parameter-Efficient Fine-Tuning for Local Deployment
arXiv CS.AI