【摘要】：針對地面數(shù)字多媒體廣播演進(jìn)方案(DTMB-A)中由于采用了較大FFT長度而帶來的高峰均比問題,提出一種基于動態(tài)星座圖擴(kuò)展的自適應(yīng)峰均比降低算法。首先介紹了針對APSK調(diào)制方式的動態(tài)星座圖擴(kuò)展算法,明確了星座點(diǎn)可擴(kuò)展區(qū)域的選擇方式;隨后基于峰值抵消信號推導(dǎo)了動態(tài)星座圖擴(kuò)展算法的最優(yōu)時域系數(shù);最后針對現(xiàn)有動態(tài)星座圖擴(kuò)展算法對初始限幅門限值敏感的問題,提出一種在迭代中自適應(yīng)調(diào)整限幅門限值的方法。仿真結(jié)果表明:所提算法的降峰均比性能優(yōu)于現(xiàn)有動態(tài)星座圖擴(kuò)展算法,同時在初始限幅門限值設(shè)置不理想的情況下具有較好的魯棒性。
[Abstract]:An adaptive peak-to-average ratio (PAPR) reduction algorithm based on dynamic constellation expansion is proposed to solve the problem of peak-to-average ratio (PAPR) caused by large FFT length in terrestrial digital multimedia broadcasting evolution scheme (DTMB-A). Firstly, the dynamic constellation expansion algorithm for APSK modulation is introduced, and the selection method of the scalable region of constellation points is defined, then the optimal time-domain coefficients of the expansion algorithm are derived based on the peak cancellation signal. Finally, aiming at the sensitivity of the existing dynamic constellation expansion algorithms to the initial limiting threshold, an adaptive method for adjusting the limiting threshold in iteration is proposed. The simulation results show that the proposed algorithm is superior to the existing dynamic constellation expansion algorithm in peak-to-average ratio (PAPR) performance, and has good robustness when the initial limit threshold is not well set.
【作者單位】： 清華大學(xué)電子工程系 清華信息科學(xué)與技術(shù)國家實(shí)驗(yàn)室;數(shù)字電視國家工程實(shí)驗(yàn)室(北京);
【基金】：國家自然科學(xué)基金創(chuàng)新研究群體項(xiàng)目(61021001) 國家“八六三”高技術(shù)項(xiàng)目(2012AA011704)
【分類號】：TN941

【相似文獻(xiàn)】

相關(guān)期刊論文 前1條

1 梁林峰;王軍;宋健;;針對DTMB-A系統(tǒng)的自適應(yīng)峰均比降低算法[J];清華大學(xué)學(xué)報(自然科學(xué)版);2014年04期

，

本文編號：2196235