KMITL
Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1
Browse
2 results
Search Results
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Proposal of sub-optimum algorithm for trellis-based SLM reducing PAPR of FBMC-OQAM signals(2018-05-30) ;Rujiprechanon, Latthawit ;Boonsrimuang, Pisit ;Sanpan, SunisaBoonsrimuang, PornpawitFilter bank multi-carrier with offset quadrature amplitude modulation (FBMC-OQAM) has several advantages. FBMC-OQAM is considered a major candidate for the next generation mobile communication systems. The high peak-to-average power ratio (PAPR) is one of disadvantage for FBMC-OQAM signal which could be solved by the Trellis-based SLM (TSLM) technique. This TSLM technique has a much better PAPR reduction performance. However, the trellis-based algorithm has high computational complexity. This paper proposes the sub-optimum algorithm for trellis-based SLM scheme. The proposed algorithm show much lower computational complexity than trellis-based SLM scheme with small degradation of PAPR reduction performance. On the other hand, the PAPR reduction performance of proposed algorithm shows better than conventional SLM with similar computational complexity when the number of L symbols is large. The efficiencies of proposed scheme were verified by using various computer simulations. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, PAPR reduction in FBMC-OQAM signals with half complexity of trellis-based SLM(2018-03-23) ;Jirajaracheep, Panya ;Sanpan, Sunisa ;Boonsrimuang, PornpawitBoonsrimuang, PisitThe filter Bank Multicarrier (FBMC) modulation with offset-QAM (OQAM) has attracted attention as a major candidate for future wireless communication systems which has several advantages. A disadvantage of FBMC-OQAM is high peak-to-average power ratio (PAPR). To overcome this problem, the trellis-based SLM technique is employed and achieved a much better PAPR reduction performance. However, The Trellis-based algorithm has also the intrinsic disadvantage of high computational complexity, to decreasing the complexity will make the system more desirable. This paper proposes the half-complexity algorithm for trellis-based SLM scheme which achieves lower computational complexity when compared to trellis-based SLM scheme with small degradation of PAPR reduction performance. From various simulation results, the proposed algorithm shows less computational complexity about 50% compared to the trellis-based algorithm with similar PAPR reduction performance.
