In the OFDMA-based cellular relay networks, relay selection and resource allocation are the main problem to be solved. Many present works about resource allocation are for the goal of throughput maximization. In this ...
详细信息
Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose m...
详细信息
Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose maximum periodic Hamming correlation is 0 at the origin result in an LHZ FHS set based on the Cartesian product, and Proposition 4 presented an upper bound of the maximum periodic Hamming correlation of FHSs. However, their statements are imperfect or incorrect. In this paper, we give counterexamples and make corrections to them. Furthermore, based on the Cartesian product, we construct two classes of LHZ FHS sets with optimal maximum periodic partial Hamming correlation property. It is shown that new FHS sets are optimal by the maximum periodic partial Hamming correlation bound of LHZ FHS set.
This paper presents a bandwidth occupied time proportion fair MAC algorithm (BOTP-FMAC) for WLAN and Wireless Mesh Network (WMN). It aims to address the unfairness problem in enhanced distributed channel access (EDCA)...
详细信息
ISBN:
(纸本)9781424428472
This paper presents a bandwidth occupied time proportion fair MAC algorithm (BOTP-FMAC) for WLAN and Wireless Mesh Network (WMN). It aims to address the unfairness problem in enhanced distributed channel access (EDCA) mechanism, in which higher-priority streaming traffic flows intend to severely deprive the access opportunity of lowerpriority traffic flows due to the capture effect, especially when the network load is near saturation. By dynamically tuning the parameters of channel contention and the threshold of bandwidth occupied time proportion for priority queue adaptively, BOTPFMAC algorithm can achieve a weighted fair allocation of the bandwidth resource among different traffic flows. The simulation results indicate that our proposed algorithm substantially improves the fairness and attains a greater aggregate throughput. Additionally, it is easy to carry out without generating network overhead.
Data Dependent Superimposed Training(DDST) scheme outperforms the traditional su-perimposed training by fully canceling the effects of unknown data in channel *** DDST,however,the channel estimation accuracy and the d...
详细信息
Data Dependent Superimposed Training(DDST) scheme outperforms the traditional su-perimposed training by fully canceling the effects of unknown data in channel *** DDST,however,the channel estimation accuracy and the data detection or channel equalization performance are affected significantly by the amount of power allocated to data and superimposed training sequence,which is the motivation of this *** general,for DDST,there is a tradeoff between the channel estimation accuracy and the data detection reliability,i.e.,the more accurate the channel estimation,the more reliable the data detection;on the other hand,the more accurate the channel estimation,the more demanding on the power consumption of training sequence,which in turn leads to the less reliable data *** this paper,the relationship between the Signal-to-Noise Ratio(SNR) of the data detector and the training sequence power is *** optimal power allocation of the training sequence is derived based on the criterion of maximizing SNR of the *** and simulation results show that for a fixed transmit power,the SNR and the Symbol Error Rate(SER) of detector vary nonlinearly with the increasing of training sequence power,and there exists an optimal power ratio,which accords with the derived optimal power ratio,among the data and training sequence.
Virtual MIMO (VMIMO) in the uplink communication system is a promising technique focused in recent years. It groups two or more user equipments (UEs) with individual antenna to construct a VMIMO channel communicating ...
详细信息
For an odd prime p, two new families of p-ary sequences of period p n - 1 are constructed for odd n = 2l + 1 = (2m + 1)e and even n = 2l = 2me, respectively. It is shown that, for a given integer ρ with 1 ≤ ρ ρ m,...
详细信息
This paper derives a novel multiple symbols soft-decision metrics for frequency-shift keying signals which are affected by additive symmetric α -stable (S α S) noise and fading. The approximate metric, which is for ...
详细信息
This paper derives a novel multiple symbols soft-decision metrics for frequency-shift keying signals which are affected by additive symmetric α -stable (S α S) noise and fading. The approximate metric, which is for the case where channel state information (phases, amplitudes, and noise dispersion parameter) is unknown is obtained based on a generalized-likelihood ratio (GLR) approach. The metric is obtained in closed form and proved to be effective. The performances of the multiple symbols soft-decision metrics are compared numerically for a turbo-coded system. The proposed multiple symbols metric provides substantial improvement over earlier single-symbol metrics.
In frequency-hopping (FH) multiple access systems, frequency-hopping sequences (FHSs) with optimal Hamming correlation properties are needed. Based on the d-form functions with ideal autocorrelation properties, a new ...
详细信息
Dear editor, The massive random access （RA） schemes in the existing literature are mainly grant-free approaches, which are supported by non-orthogonal multiple access [1–3], compressive sensing （CS） [4, 5], group...
详细信息
Dear editor, The massive random access （RA） schemes in the existing literature are mainly grant-free approaches, which are supported by non-orthogonal multiple access [1–3], compressive sensing （CS） [4, 5], group paging [2, 6], and multichannel ALOHA [7]. However, they still face the challenges of high energy consumption and data overhead, especially in future ultra-dense Internet of Things （Io T） networks （> 10～6devices/km2） [8].
In order to efectively reduce the “decoding latency” of successive cancellation decoding aided Fano(SC-Fano) decoder employed in polarization-adjusted convolutional(PAC) codes, a fast parallel SCFano decoding algori...
详细信息
In order to efectively reduce the “decoding latency” of successive cancellation decoding aided Fano(SC-Fano) decoder employed in polarization-adjusted convolutional(PAC) codes, a fast parallel SCFano decoding algorithm is designed, which leverages multiple individual decoding components. Critical challenges arise from how to appropriately initialize the thresholds of diferent SC-Fano decoding components and how will these decoding components cooperate with each other. After appropriately overcoming these challenges, our design is capable of halving the “decoding latency” without incurring any noticeable frame error rate(FER) performance degradation, meanwhile, the overall computational complexity is normally constrained below one and a half times of that required by conventional SC-Fano decoders in simulated typical configurations.
暂无评论