Distributed antenna systems (DASs) combined with multi-user multiple-input multiple-output (MU-MIMO) transmission techniques have recently attracted significant attention. To establish MU-MIMO DASs that have wide service areas, the use of a dynamic clustering scheme (CS) is necessary to reduce computation in precoding. In the present study, we propose a simple method for dynamic clustering to establish a single cell large-scale MU-MIMO DAS and investigate its performance. We also compare the characteristics of the proposal to those of other schemes such as exhaustive search, traditional location-based adaptive CS, and improved norm-based CS in terms of sum rate improvement. Additionally, to make our results more universal, we further introduce spatial correlation to the considered system. Computer simulation results indicate that the proposed CS for the considered system provides better performance than the existing schemes and can achieve a sum rate close to that of exhaustive search but at a lower computational cost.
Yuhu CHENG Xue QIAO Xuesong WANG
Zero-shot learning refers to the object classification problem where no training samples are available for testing classes. For zero-shot learning, attribute transfer plays an important role in recognizing testing classes. One popular method is the indirect attribute prediction (IAP) model, which assumes that all attributes are independent and equally important for learning the zero-shot image classifier. However, a more practical assumption is that different attributes contribute unequally to the classifier learning. We therefore propose assigning different weights for the attributes based on the relevance probabilities between the attributes and the classes. We incorporate such weighed attributes to IAP and propose a relevance probability-based indirect attribute weighted prediction (RP-IAWP) model. Experiments on four popular attributed-based learning datasets show that, when compared with IAP and RFUA, the proposed RP-IAWP yields more accurate attribute prediction and zero-shot image classification.
Takahiro MURAKAMI Yoshihisa ISHIDA
The sliding discrete Fourier transform (DFT) is a well-known algorithm for obtaining a few frequency components of the DFT spectrum with a low computational cost. However, the conventional sliding DFT cannot be applied to practical conditions, e.g., using the sine window and the zero-padding DFT, with preserving the computational efficiency. This paper discusses the extension of the sliding DFT to such cases. Expressing the window function by complex sinusoids, a recursive algorithm for computing a frequency component of the DFT spectrum using an arbitrary sinusoidal window function is derived. The algorithm can be easily extended to the zero-padding DFT. Computer simulations using very long signals show the validity of our algorithm.
Ai ISHIDA Keita EMURA Goichiro HANAOKA Yusuke SAKAI Keisuke TANAKA
The primitive called public key encryption with non-interactive opening (PKENO) is a class of public key encryption (PKE) with additional functionality. By using this, a receiver of a ciphertext can prove that the ciphertext is an encryption of a specified message in a publicly verifiable manner. In some situation that a receiver needs to claim that a ciphertext is NOT decrypted to a specified message, if he/she proves the fact by using PKENO straightforwardly, the real message of the ciphertext is revealed and a verifier checks that it is different from the specified message about which the receiver wants to prove. However, this naive solution is problematic in terms of privacy. Inspired by this problem, we propose the notion of disavowable public key encryption with non-interactive opening (disavowable PKENO) where, with respect to a ciphertext and a message, the receiver of the ciphertext can issue a proof that the plaintext of the ciphertext is NOT the message. Also, we give a concrete construction. Specifically, a disavowal proof in our scheme consists of 61 group elements. The proposed disavowable PKENO scheme is provably secure in the standard model under the decisional linear assumption and strong unforgeability of the underlying one-time signature scheme.
The multiterminal hypothesis testing problem with zero-rate constraint is considered. For this problem, an upper bound on the optimal error exponent is given by Shalaby and Papamarcou, provided that the positivity condition holds. Our contribution is to prove that Shalaby and Papamarcou's upper bound is valid under a weaker condition: (i) two remote observations have a common random variable in the sense of Gácks and Körner, and (ii) when the value of the common random variable is fixed, the conditional distribution of remaining random variables satisfies the positivity condition. Moreover, a generalization of the main result is also given.
Takafumi HAYASHI Yodai WATANABE Anh T. PHAM Toshiaki MIYAZAKI Shinya MATSUFUJI Takao MAEDA
The present paper introduces a novel method for the construction of a class of sequences that have a zero-correlation zone. For the proposed sequence set, both the cross-correlation function and the side lobe of the auto-correlation function are zero for phase shifts within the zero-correlation zone. The proposed scheme can generate a set of sequences of length 8n2 from an arbitrary Hadamard matrix of order n and a set of 2n trigonometric-like function sequences of length 4n. The proposed sequence construction can generate an optimal zero-correlation zone sequence set that satisfies the theoretical bound on the number of members for the given zero-correlation zone and sequence period. The auto-correlation function of the proposed sequence is equal to zero for all nonzero phase shifts. The peak factor of the proposed sequence set is √2, and the peak factor of a single trigonometric function is equal to √2. Assigning the sequences of the proposed set to a synthetic aperture ultrasonic imaging system would improve the S/N of the obtained image. The proposed sequence set can also improve the performance of radar systems. The performance of the applications of the proposed sequence sets are evaluated.
Kunihiro OGATA Tomoki MITA Takeshi SHIMIZU Nobuya YAMASAKI
Some unilateral lower-limb amputees, have through continued exertion, increase the foot reaction force of the sound leg. The asymmetric gait with a prosthetic leg may thus negatively affect the musculoskeletal health of the leg on the healthy side. Therefore, it is important for these amputees to learn how to adjust the balance of each foot load in training. The aim of this study is to develop a training support system visualizing floor-reaction forces using a color-depth sensor. The pose of the entire body of the amputee is measured by the depth sensor, and the floor reaction force is estimated based on Zero Moment Point (ZMP), which is calculated using the center of mass of the amputee. Evaluation experiments of the proposed method were performed and they confirmed the effectiveness of the estimation method and the training with the visualization of reaction force.
The pilot symbols in the broadband Air-to-Ground (A/G) communications system, e.g., L-band Digital Aeronautical Communications System (L-DACS1), are expected to be also utilized for navigation. In order to identify the co-channel signals from different Ground Stations (GSs), the N-Shift Zero Correlation Zone (NS-ZCZ) sequences are employed for pilot sequences. The ideal correlation property of the proposed pilot sequence in ZCZ can maintain the signal with less co-channel interference. The simulation confirms that the more co-channel GSs are employed, the higher navigation accuracy can be achieved.
Zhifan YE Pinhui KE Shengyuan ZHANG Zuling CHANG
New classes of zero-difference balanced (ZDB) functions derived from Fermat quotients are proposed in this letter. Based on the new ZDB functions, some applications, such as the construction of optimal frequency hopping sequences set and perfect difference systems of sets, are introduced.
A low-complexity time-frequency multiplex estimator and low-complexity equalizer transceiver design are proposed to combat the problems of RF impairment associated with zero-IF transceiver of multi-carrier systems. Moreover, the proposed preambles can estimate the transmitter (TX) in-phase and quadrature-phase (IQ) imbalance, carrier frequency offset (CFO), and channel impulse response parameters. The proposed system has two parts. First, all parameters of the impairments are estimated by the designed time-frequency multiplex estimator. Second, the estimated parameters are used to compensate the above problems and detect the transmitted signal with low complexity. Simulation results confirm that the proposed estimator performs reliably with respect to IQ imbalance, CFO, and multipath fading channel effects.
Majid DELSHAD Nasrin ASADI MADISEH Bahador FANI Mahmood AZARI
In this paper, a new single soft switched forward converter with a self driven synchronous rectification (SDSR) is introduced. In the proposed converter, a soft switching condition (ZCS turn on and ZVS turn off) is provided for the switch, by an auxiliary circuit without any extra switch. In additional, this auxiliary circuit does not impose high voltage or current stresses on the converter. Since the proposed converter uses SDSR to reduce conductive loss of output rectifier, the rectifier switches are switched under soft switching condition. So, the conductive and switching losses on the converter reduce considerably. Also, implementing control circuit of this converter is very simple, due to the self-driven method employed in driving synchronous rectification and the converter is controlled by pulse width modulation (PWM). The experimental results of the proposed converter are presented to confirm the theoretical analysis.
Rong HU Kirill MOROZOV Tsuyoshi TAKAGI
Code-based public-key encryption schemes (PKE) are the candidates for post-quantum cryptography, since they are believed to resist the attacks using quantum algorithms. The most famous such schemes are the McEliece encryption and the Niederreiter encryption. In this paper, we present the zero-knowledge (ZK) proof systems for proving statements about data encrypted using these schemes. Specifically, we present a proof of plaintext knowledge for both PKE's, and also a verifiable McEliece PKE. The main ingredients of our constructions are the ZK identification schemes by Stern from Crypto'93 and by Jain, Krenn, Pietrzak, and Tentes from Asiacrypt'12.
Ryochi KATAOKA Kentaro NISHIMORI Ngochao TRAN Tetsuro IMAI Hideo MAKINO
The concept of massive multiple input multiple output (MIMO) has recently been proposed. It has been reported that using linear or planar arrays to implement massive MIMO yields narrow beams that can mitigate the interference signal even if interference cancellation techniques such as zero forcing (ZF) are not employed. In this work, we investigate the interference reduction performance achieved by circular array implemented massive MIMO in a real micro cell environment. The channel state information (CSI) is obtained by using a wideband channel sounder with cylindrical 96-element array in the 2-GHz band in an urban area. Circular arrays have much larger beamwidth and sidelobe level than linear arrays. In this paper, when considering the cylindrical array, the interference reduction performance between ZF and maximum ratio combining is compared when one desired user exists in the micro cell while the interference user moves around the adjacent cell. We show that ZF is essential for reducing the interference from the adjacent cell in the circular array based massive MIMO. The required number of antennas in the vertical and horizontal planes for the interference reduction is evaluated, in order to simplify the burden of signal processing for the ZF algorithm in massive MIMO. Because there are elements with low signal to noise power ratio (SNR) when considering cylindrical 96-element array, it is shown that the degradation of the signal to noise plus interference power ratio (SINR) when the number of antennas is reduced is smaller than that by ideal antenna gain reduction with a linear array. Moreover, we show that the appropriate antennas should be selected when a limited number of antennas is assumed, because the dominant waves arrive from certain specific directions.
Fábio S. MONTEIRO Denise H. GOYA Routo TERADA
The MQ problem, which consists of solving a system of multivariate quadratic polynomials over a finite field, has attracted the attention of researchers for the development of public-key cryptosystems because (1) it is NP-complete, (2) there is no known polynomial-time algorithm for its solution, even in the quantum computational model, and (3) it enables cryptographic primitives of practical interest. In 2011, Sakumoto, Shirai and Hiwatari presented two new zero-knowledge identification protocols based exclusively on the MQ problem. The 3-pass identification protocol of Sakumoto et al. has impersonation probability 2/3. In this paper, we propose an improvement that reduces the impersonation probability to 1/2. The result is a protocol that reduces the total computation time, the total communication needed and requires a smaller number of rounds for the same security level. We also present a new extension that achieves an additional communication reduction with the use of some smaller hash commitments, but maintaining the same security level.
In this paper, we propose a zero-forcing (ZF) Tomlinson-Harashima precoding (THP) with substream permutations based on the bit rate maximization for single-user MIMO (SU-MIMO) systems. We study the effect of substream permutations on the ZF-THP SU-MIMO systems, when the mean squared error (MSE) and the bit rate are adopted for the selection of the permutation matrix as criteria. Based on our analysis, we propose a method to increase the bit rate by substream permutations, and derive QR and Cholesky decomposition-based algorithms which realize the proposed method. Furthermore, to improve the error rate performance, we apply zero transmission to subchannels with low signal-to-noise ratios. Numerical examples are provided to demonstrate the effectiveness of the proposed THP MIMO system.
In order to verify the channel sum-rate improvement by multi-user multiple-input multiple-output (MU-MIMO) transmission in distributed antenna systems (DASs), we investigate and compare the characteristics of channel sum-rates in both centralized antenna systems (CASs) and DASs under the effects of path loss, spatially correlated shadowing, correlated multi-path fading, and inter-cell interference. In this paper, we introduce two different types of functions to model the shadowing, auto-correlation and cross-correlation, and a typical exponential decay function to model the multi-path fading correlation. Thus, we obtain the distribution of the channel sum-rate and investigate its characteristics. Computer simulation results indicate that DAS can improve the performance of the channel sum-rate compared to CAS, even in the case under consideration. However, this improvement decreases as interference power increases. Moreover, the decrease in the channel sum-rate due to the increase in the interference power becomes slow under the effect of shadowing correlation. In addition, some other analyses on the shadowing correlation that occurs on both the transmit and receiver sides are provided. These analysis results show that the average channel sum-rate in a DAS without inter-cell interference considerably decreases because of the shadowing correlation. In contrast, there appears to be no change in the CAS. Furthermore, there are two different types of sum-rate changes in a DAS because of the difference in shadowing auto-correlation and cross-correlation.
ChaoYi ZHANG YanDong ZHAO DongYang WANG
Multi-antenna relay transport protocols are analysed, the transmitting matrix of relay node can split into a forward and a backward filters, and these two filters are cascade connection. Based on the zero-forcing relaying protocol, a spatial channel mapping matrix is added between these two filters, and a unified framework of spatial channel mapping matrix is proposed. Then, various linear system designs are summarized, the spatial channel mapping matrix is used to reduce destination noise, so that the relaying noise is suppressed in destination node, and the transmitting power of relay is efficiently utilized. Meanwhile, source node preprocessing operation and destination node equalizer are considered. Simulation results show that the spatial channel mapping matrix has an advantage in terms of system outage probability and capacity performance, and the result is consistent with theoretical analysis.
Hyunwook YANG Gyuyoung LEE Seungwon CHOI
When Zero-Forcing (ZF) is adopted as a detector, decreasing the condition number of the channel matrix increases the BER performance. In this paper, we propose a new detection algorithm which reduces the condition number of channel matrix down to nearly 2 on average. Since the least singular value of the channel matrix is a major factor determining the condition number, we, first, project the received signal into a space spanned by singular vectors that are orthogonal to the one corresponding to the least singular value. Then, LR decomposition is performed to reduce further the condition number of the projected channel matrix. Computer simulations show that the performance of the proposed algorithm is comparable to that of the ML detector for both correlated and uncorrelated channels. And also the proposed algorithm provides an at least 2dB improvement compared to the conventional LR-based Ordered Successive Interference Cancellation (LR-OSIC) detector with a Bit Error Rate (BER) of 10-3 and a comparable computation load.
The performance of multiuser multiple-input single-output (MU-MISO) systems is not only affected by small-scale multipath fading but also by large-scale fading (i.e., shadowing) and path loss. In this paper, we concentrate on the sum rate distribution of MU-MISO systems employing linear zero-forcing beamforming, accounting for both multipath fading and shadowing effects, as well as spatial correlation at the transmit and receiver sides. In particular, we consider the classical spatially correlated lognormal model and propose closed-form bounds on the distribution of the achievable sum rates in MU-MISO systems. With the help of these bounds, we derive a relationship between the interuser distance and sum rate corresponding to 10% of the cumulative distribution function under different environmental conditions. A practical conclusion from our results based on the considered system is that the effect of spatially correlated shadowing can be considered to be independent when the interuser distance is approximately five times the shadowing correlation distance. Furthermore, a detailed analysis of the effects of composite channel attenuation consisting of multipath fading and shadowing is also provided.
Shingo HASEGAWA Shuji ISOBE Jun-ya IWAZAKI Eisuke KOIZUMI Hiroki SHIZUYA
Password-protected secret sharing (PPSS, for short) schemes were proposed by Bagherzandi, Jarecki, Saxena and Lu. In this paper, we consider another attack for PPSS schemes which is based on public parameters and documents. We show that the protocol proposed by Bagherzandi et al. is broken with the attack. We then propose an enhanced protocol which is secure against the attack.