pith. sign in

arxiv: 1905.00274 · v1 · pith:4CNQFABSnew · submitted 2019-05-01 · 📡 eess.SP

An efficient coding algorithm for general Framed Pulse Width Modulations

classification 📡 eess.SP
keywords algorithmcodingfpwmproposedpulsewidthbitrateframe
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.