LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Bit‐level implementation for polynomial cancellation coded DFT‐s‐OFDM transmitters

Photo from academic.microsoft.com

Polynomial cancellation coded discrete Fourier transform-spread orthogonal frequency division multiplexing (PCC-DFT-s-OFDM) is famous for the flexibility of DFT-s-OFDM on the trade-off between peak-to-average power ratio performance and spectral efficiency. Deploying… Click to show full abstract

Polynomial cancellation coded discrete Fourier transform-spread orthogonal frequency division multiplexing (PCC-DFT-s-OFDM) is famous for the flexibility of DFT-s-OFDM on the trade-off between peak-to-average power ratio performance and spectral efficiency. Deploying it on numerous user equipments (UEs) as enhanced uplink signalling becomes a practical issue. In this Letter, a bit-level implementation of PCC mapping is proposed, so that the compatibility of implementation of corresponding circuits on UE transmitters would make the deployment more easily. By taking Long Term Evolution and New Radio standards as examples, the equivalency of bit/symbol-level implementations is validated in terms of bit error rate performance.

Keywords: polynomial cancellation; implementation; level implementation; bit level; cancellation coded; dft ofdm

Journal Title: Electronics Letters
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.