Abstract
Filtered orthogonal frequency division multiplexing (F-OFDM) was introduced to overcome the high side lobes in the OFDM system. Filtering is implemented in the system to reduce the out-of-band emission (OOBE) for the spectrum utilization and to meet the diversified expectation of the upcoming 5G networks. The main drawback in the system is the high peak to average ratio (PAPR). This paper investigates the method used in reducing the PAPR in the F-OFDM system. The proposed method using the block coding technique to overcome the problem of high PAPR are the Arithmetic coding and Huffman coding. This research evaluates the performance of F-OFDM system based on the PAPR values. From the simulation results, the PAPR reduction of the Arithmetic coding is 8.9% lower, while the Huffman Coding is 6.7% lower in the F-OFDM system. The results prove that the Arithmetic Coding will out-perform the Huffman coding in the F-OFDM system.
Highlights
The Orthogonal frequency division multiplexing (OFDM) system has been widely used in many latest wireless and telecommunications standards in the area of the wireless communication and 4G networks due to the high demand of the high data rate communications [1]
This paper evaluate the performance of PAPR for the Filtered OFDM (F-OFDM) system using the block coding techniques which are the Arithmetic coding and Huffman coding
The simulation results of BER and PAPR for F-OFDM system are presented as shown below
Summary
The Orthogonal frequency division multiplexing (OFDM) system has been widely used in many latest wireless and telecommunications standards in the area of the wireless communication and 4G networks due to the high demand of the high data rate communications [1]. The Finite Impulse Response (FIR) digital filter based on the windowing functional method was used in the F-OFDM to divides the bandwidth in the system into a number of sub-bands [9]. The Arithmetic coding and Huffman coding was compared as the Block coding technique using the lossless data compression in the encoding process.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of Electrical Engineering and Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
