1-13hit |
Longye WANG Houshan LIU Xiaoli ZENG Qingping YU
This letter presented several new constructions of complementary sets (CSs) with flexible sequence lengths using matrix transformations. The constructed CSs of size 4 have different lengths, namely N + L and 2N + L, where N and L are the lengths for which complementary pairs exist. Also, presented CSs of size 8 have lengths N + P, P + Q and 2P + Q, where N is length of complementary pairs, P and Q are lengths of CSs of size 4 exist. The achieved designs can be easily extended to a set size of 2n+2 by recursive method. The proposed constructions generalize some previously reported constructions along with generating CSs under fewer constraints.
Nobutaka SUZUKI Takuya OKADA Yeondae KWON
Cascading Style Sheets (CSS) is a popular language for describing the styles of XML documents as well as HTML documents. To resolve conflicts among CSS rules, CSS has a mechanism called specificity. For a DTD D and a CSS code R, due to specificity R may contain “unsatisfiable” rules under D, e.g., rules that are not applied to any element of any document valid for D. In this paper, we consider the problem of detecting unsatisfiable CSS rules under DTDs. We focus on CSS fragments in which descendant, child, adjacent sibling, and general sibling combinators are allowed. We show that the problem is coNP-hard in most cases, even if only one of the four combinators is allowed and under very restricted DTDs. We also show that the problem is in coNP or PSPACE depending on restrictions on DTDs and CSS. Finally, we present four conditions under which the problem can be solved in polynomial time.
Bing LIU Zhengchun ZHOU Udaya PARAMPALLI
Inspired by an idea due to Levenshtein, we apply the low correlation zone constraint in the analysis of the weighted mean square aperiodic correlation. Then we derive a lower bound on the measure for quasi-complementary sequence sets with low correlation zone (LCZ-QCSS). We discuss the conditions of tightness for the proposed bound. It turns out that the proposed bound is tighter than Liu-Guan-Ng-Chen bound for LCZ-QCSS. We also derive a lower bound for QCSS, which improves the Liu-Guan-Mow bound in general.
Kaijie ZHOU Huali WANG Peipei CAO Zhangkai LUO
This paper proposes a chirp-BOK modulation scheme for VLF (Very low frequency, 3-30kHz) communication under symmetric alpha-stable (SαS) noise. The atmospheric noise which is the main interference in VLF communication is more accurately characterized as SαS distribution in the previous literatures. Chirp-BOK, one of the chirp spread spectrum (CSS) technologies is widely used for its anti-interference performance and constant envelope properties. However, up-chirp and down-chirp are not strictly orthogonal, the bit error rate (BER) performance of chirp-BOK system is no longer improved with the increase of time-bandwidth product. So in this paper, the influence of non-orthogonal modulation waveform on the system is considered, and the model of the optimal parameters for chirp-BOK is derived from the perspective of minimum BER under gaussian noise and SαS noise respectively. Simulations for chirp-BOK scheme under gaussian noise and SαS noise with different α validate the effectiveness of the proposed method.
By investigating the properties that the offsets should satisfy, this letter presents a brief proof of general QAM Golay complementary sequences (GCSs) in Cases I-III constructions. Our aim is to provide a brief, clear, and intelligible derivation so that it is easy for the reader to understand the known Cases I-III constructions of general QAM GCSs.
The performance of cooperative spectrum sensing (CSS) is limited not only by the imperfect sensing channels but also by the imperfect reporting channels. In order to improve the transmission reliability of the reporting channels, an object based cooperative spectrum sensing scheme with best relay (Pe-BRCS) is proposed, in which the best relay is selected by minimizing the total reporting error probability to improve the sensing performance. Numerical results show that, the reduced total reporting error probability and the improved sensing performance can be achieved by the Pe-BRCS scheme.
Woosuk KIM Hideaki KUZUOKA Kenji SUZUKI
The style of a gesture provides significant information for communication, and thus understanding the style is of great importance in improving gestural interfaces using hand gestures. We present a novel method to estimate temporal and spatial scale—which are considered principal elements of the style—of hand gestures. Gesture synchronization is proposed for matching progression between spatio-temporally varying gestures, and scales are estimated based on the progression matching. For comparing gestures of various sizes and speeds, gesture representation is defined by adopting turning angle representation. Also, LCSS is used as a similarity measure for reliability and robustness to noise and outliers. Performance of our algorithm is evaluated with synthesized data to show the accuracy and robustness to noise and experiments are carried out using recorded hand gestures to analyze applicability under real-world situations.
Haiming WANG Xiqi GAO Bin JIANG Xiaohu YOU Wei HONG
In this letter, an improved channel estimator for MIMO-SCBT systems is proposed. Pilot blocks are constructed using quadriphase complementary sequences (QCSs) which enable both one-sided (OSD) and two-sided (TSD) channel estimation (CE). And OSD-CE and TSD-CE are combined to provide improved performance in frequency-selective fast and slow fading channels and to maintain low-complexity implementations. Simulation results demonstrate the performance merits of the proposed scheme.
Taeung YOON Youngpo LEE So Ryoung PARK Suk Chan KIM Iickho SONG Seokho YOON
The relationship between the degree of overlap in direct modulation chirp spread spectrum systems with binary phase shift keying and intersymbol interference (ISI) is analyzed. It is observed that the ISI due to overlap fluctuates or monotonically increases as the number of overlaps changes and that, in some cases, the overlap does not incur ISI at all.
Sujin KIM Na Young KIM Youngok KIM Joonhyuk KANG
In this study, a computationally efficient ranging scheme exploiting a minimum mean square error (MMSE) and a matrix-pencil (MP) technique is proposed for the IEEE 802.15.4a chirp spread spectrum (CSS) system. Based on the characteristics of the CSS signal, a practical methodology for the MMSE process is devised and the appropriate values of parameters, which are cutoff bandwidth, number of samples and sampling duration in frequency domain, are investigated and numerically determined to enhance the performance. The performance of proposed scheme is analyzed in terms of the computational complexity and the ranging estimation errors. Simulation results demonstrate that the proposed scheme performs as well as the conventional scheme at remarkably reduced computational costs.
Daegun OH Sanghun YOON Jong-Wha CHONG
For robust time delay estimation, we propose a new subspace-based algorithm which estimates the phase shift not between the adjacent samples of the dechirped sinusoid but between the dechirped sinusoids in different bands. We analyze the proposed and the conventional method in AWGN channel and verifiy the proposed algorithm through Monte-carlo simulations in AWGN and multi-path channels.
Hanbing SHEN Weihua ZHANG Kyung Sup KWAK
Cognitive Radios (CR) can recognize the communication environment and switch its communication scheme to more efficiently and flexibly utilize the radio spectrum. The performance of ultra wideband (UWB) degrades if interference is not suppressed properly. We propose here a series of adaptive chirp waveforms in UWB systems. By designing waveform shaping of both linear chirp and non-linear cases, we avoid the estimated spectrum of the on-going applications without the necessity of notch filters, and thus reduce the system complexity. We evaluate system performance of the proposed scheme by simulations and verify that the proposed scheme is a candidate for cognitive UWB systems.
Kin-ichiroh TOKIWA Hatsukazu TANAKA
Recently, Vatan, Roychowdhury and Anantram have presented two types of revised versions of the Calderbank-Shor-Steane code construction, and have also provided an exhaustive procedure for determining bases of quantum error-correcting codes. In this paper, we investigate the revised versions given by Vatan et al., and point out that there is no essential difference between them. In addition, we propose an efficient algorithm for searching for bases of quantum error-correcting codes. The proposed algorithm is based on some fundamental properties of classical linear codes, and has much lower complexity than Vatan et al.'s procedure.