Chenhuang WU Zhixiong CHEN Xiaoni DU
We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (e > 2) and 2p (p is an odd prime), respectively. These are extensions of the construction derived from Fermat quotients modulo an odd prime in our earlier work. We determine exact values of the linear complexity, which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this letter are of desired values.
Juhua PU Jia CHEN Xiaolan TANG Zhicheng HAN
This paper presents an efficient algorithm, NEAR, that allows sensor nodes to acquire their off-duty eligibility. Any node only needs to calculate the coverage degrees of the intersections on its sensing boundary, and cooperates with its neighbors to know if it is redundant or not. The computing complexity of NEAR is only O(nlogn).
Lei SUN Jie LENG Jia SU Yiqing HUANG Hiroomi MOTOHASHI Takeshi IKENAGA
Scalable Video Coding (SVC) was standardized as an extension of H.264/AVC with the intention to provide flexible adaptation to heterogeneous networks and different end-user requirements, which provides great scalability in multi-point applications such as video conferencing. However, due to the existence of H.264/AVC-based systems, transcoding between AVC and SVC becomes necessary. Most existing works focus on temporal transcoding, quality transcoding or SVC-to-AVC spatial transcoding while the straightforward re-encoding method requires high computational cost. This paper proposes a low-complexity AVC-to-SVC spatial transcoder based on coarse-level mode mapping for video conferencing scenes. First, to omit unnecessary motion estimations (ME) for layers with reduced resolution, an ME skipping scheme based on AVC mode distribution is proposed with an adaptive search range. Then a probability-profile based scheme is proposed for further mode skipping. After that 3 coarse-level mode-mapping methods are presented for fast mode decision and the adaptive usage of the 3 methods is discussed. Finally, motion vector (MV) refinement is introduced for further lower-layer time reduction. As for the top layer, direct encapsulation is proposed to preserve better quality and another scheme involving inter-layer predictions is also provided for bandwidth-crucial applications. Simulation results show that proposed transcoder achieves up to 92.6% time reduction without significant coding efficiency loss compared to re-encoding method.
Lu ZHAO Qiao-yan WEN Jie ZHANG Zheng-ping JIN
The 2-adic complexity of binary periodic sequences plays an important role in cryptology. In this paper, by means of the usual Fourier transform, we give a simpler form of the upper bound for 2-adic complexity than related result before. For pn-periodic sequences, we discuss the relation between sequences and their Fourier coefficients. Furthermore, based on the relation, we get the lower bound for the number of pn-periodic sequences with given 2-adic complexity.
Petri net is a powerful modeling tool for concurrent systems. Subclasses of Petri net are suggested to model certain realistic applications with less computational cost. Structurally weakly persistent net (SWPN) is one of such subclasses where liveness is verified in deterministic polynomial time. This paper studies the computational complexity to verify whether a give net is SWPN. 3UNSAT problem is reduced to the problem to verify whether a net is not SWPN. This implies co-NP completeness of verification problem of SWPN.
Zhaocheng WANG Jintao WANG Linglong DAI
This paper proposes a novel scheme to reduce the complexity of existing transmit diversity solutions to time domain synchronous OFDM (TDS-OFDM). The space shifted constant amplitude zero autocorrelation (CAZAC) sequence based preamble is proposed for channel estimation. Two flexible frame structures are proposed for adaptive system design as well as cyclicity reconstruction of the received inverse discrete Fourier transform (IDFT) block. With regard to channel estimation and cyclicity reconstruction, the complexity of the proposed scheme is only around 7.20% of that of the conventional solutions. Simulation results demonstrate that better bit error rate (BER) performance can be achieved over doubly selective channels.
Huijuan WANG Qiaoyan WEN Jie ZHANG
This paper studies the 2-adic complexity of the self-shrinking sequence under the relationship between 2-adic integers and binary sequences. Based on the linear complexity and the number of the sequences which have the same connection integer, we conclude that the 2-adic complexity of the self-shrinking sequence constructed by a binary m-sequence of order n has a lower bound 2n-2-1. Furthermore, it is shown that its 2-adic complexity has a bigger lower bound under some circumstances.
In this study, we propose a one dimensional (1D) based successive generalized sidelobe canceller (GSC) structure for the implementation of 2D adaptive beamformers using a uniform rectangular antenna array (URA). The proposed approach takes advantage of the URA feature that the 2D spatial signature of the receive signal can be decomposed into an outer product of two 1D spatial signatures. The 1D spatial signatures lie in the column and the row spaces of the receive signal matrix, respectively. It follows that the interferers can be successively eliminated by two rounds of 1D-based GSC structure. As compared to the conventional 2D-GSC structure, computer simulations show that in addition to having significantly low computational complexity, the proposed adaptive approach possesses higher convergence rate.
Pinhui KE Zheng YANG Jie ZHANG
We determine the autocorrelations of the quaternary sequence over F4 and its modified version introduced by Du et al. [X.N. Du et al., Linear complexity of quaternary sequences generated using generalized cyclotomic classes modulo 2p, IEICE Trans. Fundamentals, vol.E94-A, no.5, pp.1214–1217, 2011]. Furthermore, we reveal a drawback in the paper aforementioned and remark that the proof in the paper by Kim et al. can be simplified.
Solima KHANAM Seok-Woo JANG Woojin PAIK
In this letter, we propose an effective method to retrieve images from a 2D shape image database using discrete shock graphs combined with an adaptive selection algorithm. Experimental results show that our method is more accurate and fast than conventional approaches and reduces computational complexity.
Liming ZHENG Kazuhiko FUKAWA Hiroshi SUZUKI Satoshi SUYAMA
This paper proposes a low-complexity signal detection algorithm for spatially correlated multiple-input multiple-output (MIMO) channels. The proposed algorithm sets a minimum mean-square error (MMSE) detection result to the starting point, and searches for signal candidates in multi-dimensions of the noise enhancement from which the MMSE detection suffers. The multi-dimensional search is needed because the number of dominant directions of the noise enhancement is likely to be more than one over the correlated MIMO channels. To reduce the computational complexity of the multi-dimensional search, the proposed algorithm limits the number of signal candidates to O(NT) where NT is the number of transmit antennas and O( ) is big O notation. Specifically, the signal candidates, which are unquantized, are obtained as the solution of a minimization problem under a constraint that a stream of the candidates should be equal to a constellation point. Finally, the detected signal is selected from hard decisions of both the MMSE detection result and unquantized signal candidates on the basis of the log likelihood function. For reducing the complexity of this process, the proposed algorithm decreases the number of calculations of the log likelihood functions for the quantized signal candidates. Computer simulations under a correlated MIMO channel condition demonstrate that the proposed scheme provides an excellent trade-off between BER performance and complexity, and that it is superior to conventional one-dimensional search algorithms in BER performance while requiring less complexity than the conventional algorithms.
In this letter, we determine the linear complexity and minimum polynomial of the frequency hopping sequences over GF(q) introduced by Chung and Yang, where q is an odd prime. The results of this letter show that these sequences are quite good from the linear complexity viewpoint. By modifying these sequences, another class of frequency hopping sequences are obtained. The modified sequences also have low Hamming autocorrelation and large linear complexity.
This research proposes a Coding-Gain-Based (CGB) complexity control method for real-time H.264 video encoding in complexity-constrained systems such as wireless handsets. By allocating more complexity to the encoding tools which have higher coding efficiency, the CGB method is able to maximize the overall coding efficiency of the encoder.
Let p be an odd prime number. We define a family of quaternary sequences of period 2p using generalized cyclotomic classes over the residue class ring modulo 2p. We compute exact values of the linear complexity, which are larger than half of the period. Such sequences are 'good' enough from the viewpoint of linear complexity.
Sheng LEI Xin ZHANG Cong XIONG Dacheng YANG
We create an efficient statistical pruning (SP) algorithm for fixed-complexity sphere decoder (FSD) by utilizing partial decision feedback detection (i.e., SP-FSD). Simulation results show that SP-FSD not only attains the near-optimal performance, but also achieves much lower complexity than the original FSD and its two lately-developed variants: the simplified FSD (SFSD) and the statistical threshold-based FSD (ST-FSD).
Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.
Liming ZHENG Jooin WOO Kazuhiko FUKAWA Hiroshi SUZUKI Satoshi SUYAMA
This paper proposes a low-complexity algorithm to calculate log likelihood ratios (LLRs) of coded bits, which is necessary for channel decoding in coded MIMO mobile communications. An approximate LLR needs to find a pair of transmitted signal candidates that can maximize the log likelihood function under a constraint that a coded bit is equal to either one or zero. The proposed algorithm can find such a pair simultaneously, whereas conventional ones find them individually. Specifically, the proposed method searches for such candidates in directions of the noise enhancement using the MMSE detection as a starting point. First, an inverse matrix which the MMSE weight matrix includes is obtained and then the power method derives eigenvectors of the inverse matrix as the directions of the noise enhancement. With some eigenvectors, one-dimensional search and hard decision are performed. From the resultant signals, the transmitted signal candidates to be required are selected on the basis of the log likelihood function. Computer simulations with 44 MIMO-OFDM, 16QAM, and convolutional codes (rate =1/2, 2/3) demonstrate that the proposed algorithm requires only 1.0 dB more Eb/N0 than that of the maximum likelihood detection (MLD) in order to achieve packet error rate of 10-3, while reducing the complexity to about 0.2% of that of MLD.
In this letter, we generalize the binary sequence introduced by Li et al. in [S. Q. Li et al., On the randomness generalized cyclotomic sequences of order two and length pq, IEICE Trans. Fund, vol. E90-A, no.9, pp.2037-2041, 2007] to sequence over arbitrary prime fields. Furthermore, the auto-correlation distribution and linear complexity of the proposed sequence are presented.
Chuzo IWAMOTO Kento SASAKI Kenji NISHIO Kenichi MORITA
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A cast puzzle is a type of disentanglement puzzle, where each piece is a zinc die-casting alloy. In this paper, we consider the generalized cast puzzle problem whose input is the layout of a finite number of pieces (polyhedrons) in the 3-dimensional Euclidean space. For every integer k ≥ 0, we present a polynomial-time transformation from an arbitrary k-exponential-space Turing machine M and its input x to a cast puzzle c1 of size k-exponential in |x| such that M accepts x if and only if c1 is solvable. Here, the layout of c1 is encoded as a string of length polynomial (even if c1 has size k-exponential). Therefore, the cast puzzle problem of size k-exponential is k-EXPSPACE-hard for every integer k ≥ 0. We also present a polynomial-time transformation from an arbitrary instance f of the SAT problem to a cast puzzle c2 such that f is satisfiable if and only if c2 is solvable.
Seok-Yong JIN Young-Joon KIM Hong-Yeop SONG
In this paper, we calculate autocorrelation of new generalized cyclotomic sequences of period pn for any n > 0, where p is an odd prime number.