Loading...
Please wait, while we are loading the content...
Similar Documents
New UI protocol sequences for a collision channel without feedback
| Content Provider | Semantic Scholar |
|---|---|
| Author | Zhang, Yijin Lo, Yuan-Hsun Shum, Kenneth W. Wong, Wing Shing |
| Copyright Year | 2016 |
| Abstract | Protocol sequences are binary and periodic sequences used for deterministic multiple access in a collision channel without feedback. In this paper, we focus on user-irrepressible (UI) protocol sequences that can guarantee a positive individual throughput per sequence period with probability one for a slot-synchronous channel, regardless of the delay offsets among the users. As the sequence period has a fundamental impact on the worst-case channel access delay, a common objective of designing UI sequences is to make the sequence period as short as possible. Consider a communication channel that is shared by M active users, and assume that each protocol sequence has a constant Hamming weight w. To attain a better delay performance than previously known UI sequences, this paper presents a CRTm construction of UI sequences with w = M + 1. For all non-prime M ≥ 8, our construction produces the shortest known sequence period and the shortest known worstcase delay of UI sequences. It is further shown that the new construction not Y. Zhang School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China National Mobile Communications Research Laboratory, Southeast University, Nanjing, China E-mail: yijin.zhang@gmail.com Y.-H. Lo School of Mathematical Sciences, Xiamen University, Xiamen, China E-mail: yhlo0830@gmail.com K. W. Shum Institute of Network Coding, The Chinese University of Hong Kong, Hong Kong E-mail: wkshum@inc.cuhk.edu.hk W. S. Wong Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong E-mail: wswong@ie.cuhk.edu.hk The material in this paper was presented in part at Globecom 2014 Workshop on ULTRA, Austin, USA, Dec. 2014. 2 Yijin Zhang et al. only enjoys a better average delay performance, but also has a higher average system throughput than other constructions which have the same sequence period. In addition, we derive an asymptotic lower bound on the minimum sequence period for w = M +1 if the sequence structure satisfies some technical conditions, called equi-difference, and prove the tightness of this lower bound by using the CRTm construction. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://arxiv.org/pdf/1611.03012v2.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
