An efficient coding algorithm for general Framed Pulse Width Modulations
Soon-Won Kwon, Hyeon-Min Bae

TL;DR
This paper presents a new coding algorithm for Framed Pulse Width Modulation that significantly reduces LUT requirements, increases bitrate, and is compatible with various FPWM configurations, validated through MATLAB simulations.
Contribution
The paper introduces a novel FPWM coding algorithm that reduces LUT size by 93%, increases bitrate by 25%, and supports general FPWM frame lengths and resolutions.
Findings
93% reduction in LUTs required
25% increase in bitrate
No bit errors in decoding
Abstract
This paper introduces a new coding algorithm for Framed Pulse Width Modulation (FPWM). The proposed algorithm requires 93% fewer look-up tables (LUTs) than the previous FPWM coding algorithm and increases a bitrate by 25%. The proposed algorithm is compatible with general FPWM with various frame lengths and pulse width resolutions. Theoretical bitrates and the sizes of LUT required for coding various FPWMs are also provided. The MATLAB simulation demonstrates the proposed FPWM signal which contains 14-bit information in 8 UI frame length, showing 75% higher bitrate than the NRZ signal with the same baud rate. The decoding algorithm restores the original bit without any bit error and validates the proposed FPWM and its coding scheme.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Compression Techniques · Advanced Wireless Communication Techniques · Wireless Communication Networks Research
