期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings
1
作者 MA Xin-rui XU You-yun ZHANG Le 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第1期24-27,共4页
It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispens... It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers. 展开更多
关键词 Turbo codes Integer ring Permutation polynomial INTERLEAVER Maximum contention-free (MCF)
下载PDF
Neighbor-Aware Multiple Access Protocol for 5G m MTC Applications 被引量:2
2
作者 Yang Yang Guannan Song +2 位作者 Wuxiong Zhang Xiaohu Ge Chengxiang Wang 《China Communications》 SCIE CSCD 2016年第S2期80-88,共9页
In order to support massive Machine Type Communication(mMTC) applications in future Fifth Generation(5G) systems,a key technical challenge is to design a highly effective multiple access protocol for massive connectio... In order to support massive Machine Type Communication(mMTC) applications in future Fifth Generation(5G) systems,a key technical challenge is to design a highly effective multiple access protocol for massive connection requests and huge traffic load from all kinds of smart devices,e.g.bike,watch,phone,ring,glasses,shoes,etc..To solve this hard problem in distributed scenarios with massive competing devices,this paper proposes and evaluates a Neighbor-Aware Multiple Access(NAMA) protocol,which is scalable and adaptive to different connectivity size and traffic load.By exploiting acknowledgement signals broadcasted from the neighboring devices with successful packet transmissions,NAMA is able to turn itself from a contention-based random access protocol to become a contention-free deterministic access protocol with particular transmission schedules for all neighboring devices after a short transition period.The performance of NAMA is fully evaluated from random state to deterministic state through extensive computer simulations under different network sizes and Contention Window(CW)settings.Compared with traditional IEEE802.11 Distributed Coordination Function(DCF),for a crowded network with 50 devices,NAMA can greatly improve system throughput and energy efficiency by more than 110%and210%,respectively,while reducing average access delay by 53%in the deterministic state. 展开更多
关键词 neighbor-aware multiple access contention-based random access contention-free deterministic access ACK signal 802.11 DCF
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部