基于多层叠加传输的超奈奎斯特传输方案

doi:10.11959/j.issn.1000-436x.2017185

Abstract

Abstract:

Faster-than-Nyquist (FTN) signaling technique has received much attention recently as an effective way of enhancing the spectral efficiency.In order to reduce the detection complexity for FTN signals,a multi-layer superposition transmission approach was present.In addition,how to calculate upper bounds on the highest information transmission rate was shown and how to choose suitable component codes was suggested.Numerical results show that the system with different code rates and power on each layer outperforms the system with only power variance on each layer,meanwhile results also imply that given the roll-off factor of the pulse shaping function is not zero,the proposed system is superior to the orthogonal system with a higher modulation format.

Key words: faster-than-Nyquist signaling, multi-layer structure, successive interference cancellation, superposition cod-ing, detection method

CLC Number:

TN911.23

Shuang-yang LI,Lei PING,Bao-ming BAI,Xiao MA. Faster-than-Nyquist transmission based on multi-layer superposition[J]. Journal on Communications, 2017, 38(9): 86-94.

Figures/Tables 11

参数	第一层参数		第二层参数	奈奎斯特系统参数
编码方式	Turbo码		Turbo码	Turbo码
信息位长度	N₁=6 000		N₂=3 000	N=12 008
码率	$R_{1} = \frac{2}{3}$		$R_{2} = \frac{1}{3}$	$R = \frac{2}{3}$
编码后比特长度	9 012		9 012	18 024
调制方式	QPSK		QPSK	8PSK
发送功率比	0.5		0.5	1
频谱效率		η₁=1.536bit·s^?1·Hz^?1		η₂=1.537bit·s^?1·Hz^?1

参数	第一层参数	第二层参数
编码方式	LDPC码	LDPC码
信息位长度	N₁=16 384	N₂=16 384
码率	$R_{1} = \frac{2}{3}$	$R_{2} = \frac{2}{3}$
编码后比特长度	24 576	24 576
调制方式	QPSK	QPSK
每层功率比	0.730 9	0.269 1

参数	第一层参数	第二层参数	第三层参数
编码方式	Turbo码	Turbo码	Turbo码
信息位长度	N₁=5 458	N₂=8 187	N₃=8 187
码率	$R_{1} = \frac{1}{3}$	$R_{2} = \frac{1}{2}$	$R = \frac{1}{2}$
编码后比特长度	16 386	16 386	16 386
调制方式	QPSK	QPSK	QPSK
每层功率比	0.106 0	0.291 5	0.602 5

参数	第一层	第二层	第三层	第四层	第五层	第六层	奈奎斯特系统
编码方式	Turbo码	Turbo码	Turbo码	Turbo码	Turbo码	Turbo码	Turbo码
信息位长度	N₁=10 000	N₂=10 000	N₃=10 000	N₄=10 000	N₅=10 000	N₆=10 000	N=90 009
码率	$R_{1} = \frac{1}{2}$	$R_{2} = \frac{1}{2}$	$R_{3} = \frac{1}{2}$	$R_{4} = \frac{1}{2}$	$R_{5} = \frac{1}{2}$	$R_{6} = \frac{1}{2}$	$R = \frac{3}{4}$
编码后比特长度	20 012	20 012	20 012	20 012	20 012	20 012	120 024
调制方式	QPSK	QPSK	QPSK	QPSK	QPSK	QPSK	256-QAM

References 24

[1]	MAZO J E . Faster-than-Nyquist signaling[J]. Bell System Technical Journal, 1975,54(8): 1451-1462.
[2]	MAZO J E , LANDAU H J . On the minimum distance problem for faster-than-Nyquist signaling[J]. IEEE Transactions on Information Theory, 1988,34(6): 1420-1427.
[3]	HAJELA D . On computing the minimum distance for faster than Nyquist signaling[J]. IEEE Transactions on Information Theory, 1990,36(2): 289-295.
[4]	FERTONANI D , BARBIERI A , COLAVOLPE G . Reduced- complexity BCJR algorithm for turbo equalization[J]. IEEE Transactions on Communications, 2007,55(12): 2279-2287.
[5]	LIVERIS A D , GEORGHIADES C N . Exploiting faster-than-Nyquist signaling[J]. IEEE Transactions on Communications, 2003,51(9): 1502-1511.
[6]	PRLJA A , ANDERSON J B . Reduced-complexity receivers for strongly narrowband intersymbol interference introduced by faster-than-Nyquist signaling[J]. IEEE Transactions on Communications, 2012,60(9): 2591-2601.
[7]	LE C , SCHELLMANN M , FUHRWERK M ,et al. On the practical benefits of faster-than-Nyquist signaling[C]// 2014 International Conference on Advanced Technologies for Communications (ATC). 2014: 208-213.
[8]	RUSEK F , ANDERSON J B . The two dimensional Mazo limit[C]// 2005 IEEE International Symposium on Information Theory (ISIT2005). 2005: 970-974.
[9]	SCHAICH F , WILD T . A reduced complexity receiver for multi-carrier faster-than-Nyquist signaling[C]// 2013 IEEE Globecom Workshops (GC Workshops). 2013: 235-240.
[10]	RUSEK F , ANDERSON J B . Constrained capacities for faster-than-Nyquist signaling[J]. IEEE Transactions on Information Theory, 2009,55(2): 764-775.
[11]	DASALUKUNTE D , RUSEK F , OWALL V.An 0.8-mm 9 . 6-mW iterative decoder for faster-than-nyquist and orthogonal signaling multicarrier systems in 65-nm CMOS[J]. IEEE Journal of Solid-State Circuits, 2013,48(7): 1680-1688.
[12]	MARWA E H , TAOKA H . Overview of faster-than-Nyquist for future mobile communication systems[C]// 2013 IEEE 77th Vehicular Technology Conference (VTC Spring). 2013: 1-5.
[13]	PHAM N , FREIXE J M , BONNAUD A ,et al. Exploring faster-than-Nyquist for satellite direct broadcasting[C]// AIAA International Communications Satellite Systems Conference. 2013: 14-17.
[14]	BANELLI P , BUZZI S , COLAVOLPE G ,et al. Modulation formats and waveforms for 5G networks:Who will be the heir of OFDM?:An overview of alternative modulation schemes for improved spectral efficiency[J]. IEEE Signal Processing Magazine, 2014,31(6): 80-93.
[15]	ANDERSON J B . Faster-than-Nyquist signaling for 5G communication[J]. Signal Processing for 5G:Algorithms and Implementations, 2016: 24-46.
[16]	OPPENHEIM A V , SCHAFER R W , BUCK J R . Discrete-time signal processing[M]. Englewood Cliffs,NJ: Prentice Hall, 1989.
[17]	PRLJA A , ANDERSON J B , RUSEK F . Receivers for faster-thanNyquist signaling with and without turbo equalization[C]// 2008 IEEE International Symposium on Information Theory (ISIT2008). 2008: 464-468.
[18]	RUSEK F . Partial response and faster-than-Nyquist signaling[M]. Lund University, 2007.
[19]	KIM Y J D , BAJCSY J . Binary faster-than-Nyquist optical transmission via non-uniform power allocation[C]// IEEE 2013 13th Canadian Workshop on Information Theory (CWIT). 2013: 180-185.
[20]	MA X , PING L . Coded modulation using superimposed binary codes[J]. IEEE Transactions on Information Theory, 2004,50(12): 3331-3343.
[21]	王秀妮, 马啸, 白宝明 . 多层叠加 LDPC 码编码调制技术[J]. 电子学报, 2009,37(7): 1536-1541.
	WANG X N , MA X , BAI B M . Multilevel coded modulation based on superimposed LDPC codes[J]. Acta Electronican Sonica, 2009,37(7): 1536-1541.
[22]	WACHSMANN U , FISCHER R F H , HUBER J B . Multilevel codes:theoretical concepts and practical design rules[J]. IEEE Transactions on Information Theory, 1999,45(5): 1361-1391.
[23]	COVER T M , THOMAS J A . Elements of information theory[M]. John Wiley ＆ Sons, 2012.
[24]	GALLAGER R G . Information theory and reliable communication[M]. New York: Wiley, 1968.

Metrics

Recommended 0

No Suggested Reading articles found!

Faster-than-Nyquist transmission based on multi-layer superposition

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 11

References 24

Related Articles 9

Metrics

Recommended 0

[1]	Chaonong XU,Jianxiong WU,Yongjun XU. Highly reliable access algorithm for PD-NOMA based IoT with delay guarantee [J]. Journal on Communications, 2020, 41(9): 210-221.
[2]	Chang-le JING,Xin WANG,Ji-bo WEI,Bin CHEN,Shi-qi WU. Space alternating generalized maximum-likelihood based low-complexity list detection algorithm [J]. Journal on Communications, 2016, 37(4): 192-198.
[3]	Song-hua HU,Jian-jun ZHANG,Yang LU,Bin LIU,Jiang-hong HAN. Power control for successive interference cancellation algorithm based on game theory [J]. Journal on Communications, 2015, 36(9): 215-221.
[4]	Jiang-hong HAN,Song-hua HU,Bin LIU,Zhen CHEN,Lei LIU. Power control strategy with joint of multi-packet reception and fuzzy logic control [J]. Journal on Communications, 2015, 36(2): 11-19.
[5]	Lei SHI,Jiang-hong HAN,Yi SHI,Zhen-chun WEI. High capacity cross layer optimization strategy for multi-hop wireless network with interference management [J]. Journal on Communications, 2014, 35(12): 89-97.
[6]	. High capacity cross layer optimization strategy for multi-hop wireless network with interference management [J]. Journal on Communications, 2014, 35(12): 11-97.
[7]	Shao-he LV,Xiao-dong WANG,Xing-ming ZHOU. Context-aware link scheduling in static wireless networks with successive interference cancellation [J]. Journal on Communications, 2012, 33(8): 69-76.
[8]	Zuo-liang YIN,Xing-peng MAO,Qin-yu ZHANG,Nai-tong ZHANG. Fast recursive algorithm for implementation of MIMO ZF-SIC detection [J]. Journal on Communications, 2012, 33(7): 67-74.
[9]	Yan-xing ZENG,Qin-ye YIN,Ke DENG,Jian-guo DENG. Successive interference cancellation receiver algorithms for uplink STBC coded MC-CDMA systems [J]. Journal on Communications, 2006, 27(9): 118-123.