Nobuhide NONAKA Kazushi MURAOKA Tatsuki OKUYAMA Satoshi SUYAMA Yukihiko OKUMURA Takahiro ASAI Yoshihiro MATSUMURA
In order to enhance the fifth generation (5G) mobile communication system further toward 5G Evolution, high bit-rate transmission using high SHF bands (28GHz or EHF bands) should be more stable even in high-mobility environments such as high speed trains. Of particular importance, dynamic changes in the beam direction and the larger Doppler frequency shift can degrade transmission performances in such high frequency bands. Thus, we conduct the world's first 28 GHz-band 5G experimental trial on an actual Shinkansen running at a speed of 283km/h in Japan. This paper introduces the 28GHz-band experimental system used in the 5G experimental trial using the Shinkansen, and then it presents the experimental configuration in which three base stations (BSs) are deployed along the Tokaido Shinkansen railway and a mobile station is located in the train. In addition, transmission performances measured in this ultra high-mobility environment, show that a peak throughput of exceeding 1.0Gbps and successful consecutive BS connection among the three BSs.
Tatsuki OKUYAMA Nobuhide NONAKA Satoshi SUYAMA Yukihiko OKUMURA Takahiro ASAI
The fifth-generation (5G) mobile communications system initially introduced massive multiple-input multiple-output (M-MIMO) with analog beamforming (BF) to compensate for the larger path-loss in millimeter-wave (mmW) bands. To solve a coverage issue and support high mobility of the mmW bands, base station (BS) cooperation technologies have been investigated in high-mobility environments. However, previous works assume one mobile station (MS) scenario and analog BF that does not suppress interference among MSs. In order to improve system performance in the mmW bands, fully digital BF that includes digital precoding should be employed to suppress the interference even when MSs travel in high mobility. This paper proposes two mmW BS cooperation technologies that are inter-baseband unit (inter-BBU) and intra-BBU cooperation for the fully digital BF. The inter-BBU cooperation exploits two M-MIMO antennas in two BBUs connected to one central unit by limited-bandwidth fronthaul, and the intra-BBU cooperates two M-MIMO antennas connected to one BBU with Doppler frequency shift compensation. This paper verifies effectiveness of the BS cooperation technologies by both computer simulations and outdoor experimental trials. First, it is shown that that the intra-BBU cooperation can achieve an excellent transmission performance in cases of two and four MSs moving at a velocity of 90km/h by computer simulations. Second, the outdoor experimental trials clarifies that the inter-BBU cooperation maintains the maximum throughput in a wider area than non-BS cooperation when only one MS moves at a maximum velocity of 120km/h.
Yutaro KOBAYASHI Yukitoshi SANADA
In a multiple-input multiple-output (MIMO) system, maximum likelihood detection (MLD) is the best demodulation scheme if no a priori information is available. However, the complexity of MLD increases exponentially with the number of signal streams. Therefore, various demodulation schemes with less complexity have been proposed and some of those schemes show performance close to that of MLD. One kind of those schemes uses a Gibbs sampling (GS) algorithm. GS MIMO detection that combines feedback from turbo decoding has been proposed. In this scheme, the accuracy of GS MIMO detection is improved by feeding back loglikelihood ratios (LLRs) from a turbo decoder. In this paper, GS MIMO detection using only feedback LLRs from a turbo decoder is proposed. Through extrinsic information transfer (EXIT) chart analysis, it is shown that the EXIT curves with and without metrics calculated from received signals overlap as the feedback LLR values increase. Therefore, the proposed scheme calculates the metrics from received signals only for the first GS MIMO detection and the selection probabilities of GS MIMO detection in the following iterations are calculated based only on the LLRs from turbo decoders. Numerical results obtained through computer simulation show that the performance of proposed GS turbo MIMO detection is worse than that of conventional GS turbo MIMO detection when the number of GS iterations is small. However the performance improves as the number of GS iterations increases. When the number of GS iterations is 30 or more, the bit error rate (BER) performance of the proposed scheme is equivalent to that of the conventional scheme. Therefore, the proposed scheme can reduce the computational complexity of selection probability calculation in GS turbo MIMO detection.
Naoto TSUMACHI Masaya SHIBAYAMA Ryuji KOBAYASHI Issei KANNO Yasuhiro SUEGARA
In March 2020, the 5th generation mobile communication system (5G) was launched in Japan. Frequency bands of 3.7GHz, 4.5GHz and 28GHz were allocated for 5G services, and the 5G use cases fall into three broad categories: Enhanced Mobile Broadband (eMBB), Massive Machine Type Communication (mMTC) and Ultra-Reliable Low Latency Communication (URLLC). The use cases and services that take advantage of the characteristics of each category are expected to be put to practical use, and experiments of practical use are underway. This paper introduces and demonstrates a touchless gate that can identify, authenticate and allow passage through the gate by using these features and 5G beam tracking to estimate location by taking advantage of the low latency of 5G and the straightness of the 28GHz band radio wave and its resistance to spreading. Since position estimation error due to reflected waves and other factors has been a problem, we implement an algorithm that tracks the beam and estimates the user's line of movement, and by using an infrared sensor, we made it possible to identify the gate through which the user passes with high probability. We confirmed that the 5G touchless gate is feasible for gate passage. In addition, we demonstrate that a new service based on high-speed high-capacity communication is possible at gate passage by taking advantage of the wide bandwidth of the 28GHz band. Furthermore, as a use case study of the 5G touchless gate, we conducted a joint experiment with an airline company.
Nobuhide NONAKA Satoshi SUYAMA Tatsuki OKUYAMA Kazushi MURAOKA Yukihiko OKUMURA
In order to realize the higher bit rates compared for the fifth-generation (5G) mobile communication system, massive MIMO technologies in higher frequency bands with wider bandwidth are being investigated for 5G evolution and 6G. One of practical method to realize massive MIMO in the high frequency bands is hybrid beamforming (BF). With this approach, user selection is an important function because its performance is highly affected by inter-user interference. However, the computational complexity of user selection in multi-user massive MIMO is high because MIMO channel matrix size excessive. Furthermore, satisfying user fairness by proportional fairness (PF) criteria leads to further increase of the complexity because re-calculation of precoding and postcoding matrices is required for each combination of selected users. To realize a fair and low-complexity user selection algorithm for multi-user massive MIMO employing hybrid BF, this paper proposes a two-step user selection algorithm that combines PF based user selection and chordal distance user selection. Computer simulations show that the proposed two-step user selection algorithm with higher user fairness and lower computational complexity can achieve higher system performance than the conventional user selection algorithms.
Tsubasa SHOBUDANI Mamoru SAWAHASHI Yoshihisa KISHIYAMA
This paper proposes time division multiplexing (TDM) based reference signal (RS) multiplexing for faster-than-Nyquist (FTN) signaling using orthogonal frequency division multiplexing (OFDM). We also propose a subframe structure in which a cyclic prefix (CP) is appended to only the TDM based RS block and the first FTN symbol to achieve accurate estimation of the channel response in a multipath fading channel with low CP overhead. Computer simulation results show that the loss in the required average received SNR satisfying the average block error rate (BLER) of 10-2 using the proposed TDM based RS multiplexing from that with ideal channel estimation is suppressed to within approximately 1.2dB and 1.7dB for QPSK and 16QAM, respectively. This is compared to when the improvement ratio of the spectral efficiency from CP-OFDM is 1.31 with the rate-1/2 turbo code. We conclude that the TDM based RS multiplexing with the associated CP multiplexing is effective in achieving accurate channel estimation for FTN signaling using OFDM.
A narrowband active noise control (NANC) system is very effective for controlling low-frequency periodic noise. A frequency mismatch (FM) with the reference signal will degrade the performance or even cause the system to diverge. To deal with an FM and obtain an accurate reference signal, NANC systems often employ a frequency estimator. Combining an autoregressive predictive filter with a variable step size (VSS) all-pass-based lattice adaptive notch filter (ANF), a new frequency estimation method is proposed that does not require prior information of the primary signal, and the convergence characteristics are much improved. Simulation results show that the designed frequency estimator has a higher accuracy than the conventional algorithm. Finally, hardware experiments are carried out to verify the noise reduction effect.
Ryo TAKAHASHI Hidenori MATSUO Fumiyuki ADACHI
Ultra-densification of radio access network (RAN) is essential to efficiently handle the ever-increasing mobile data traffic. In this paper, a joint multi-layered user clustering and scheduling is proposed as an inter-cluster interference coordination scheme for ultra-dense RAN using cluster-wise distributed MIMO transmission/reception. The proposed joint multi-layered user clustering and scheduling consists of user clustering using the K-means algorithm, user-cluster layering (called multi-layering) based on the interference-offset-distance (IOD), cluster-antenna association on each layer, and layer-wise round-robin-type scheduling. The user capacity, the sum capacity, and the fairness are evaluated by computer simulations to show the effectiveness of the proposed joint multi-layered user clustering and scheduling. Also shown are uplink and downlink capacity comparisons and optimal IOD setting considering the trade-off between inter-cluster interference mitigation and transmission opportunity.
Kana AONO Bin ZHENG Mamoru SAWAHASHI Norifumi KAMIYA
This paper presents the bit error rate (BER) performance of frequency domain equalization (FDE) using cyclic-shifted code division multiplexing (CDM) pilot signals for single-carrier line-of-sight (LOS) - multiple-input multiple-output (MIMO) multiplexing. We propose applying different cyclic-shift resources of the same Zadoff-Chu sequence to transmission-stream-specific pilot signals that are essential for estimating the channel response for FDE and phase noise in LOS-MIMO. To validate the effectiveness of the cyclic-shifted pilot multiplexing, we use partial low-density parity-check (LDPC) coding with double Gray mapping and collaborative decoding. Simulations show that pilot signal multiplexing using a cyclic-shifted Zadoff-Chu sequence, and frequency domain averaging of the estimated channel response are effective in achieving accurate channel estimation for single-carrier LOS-MIMO. We also show that the required received signal-to-noise power ratio at the BER of 10-7 using partial LDPC coding is decreased by more than 6.6dB compared to that without LDPC coding even for the deep notch depth of -20dB regardless of the relationship between the notch frequencies in the direct and cross links for 2×2 LOS-MIMO in a Rummler fading channel. Therefore, we conclude that the CDM-based pilot signal multiplexing with different cyclic shifts is effective in accurately estimating the channel response specific to the combination sets of transmitter and receiver antennas and in achieving a low pilot-overhead loss for single-carrier LOS-MIMO.
Shoichi HIROSE Yu SASAKI Hirotaka YOSHIDA
We revisit the design of Lesamnta-LW, which is one of the three lightweight hash functions specified in ISO/IEC 29192-5:2016. Firstly, we present some updates on the bounds of the number of active S-boxes for the underlying 64-round block cipher. While the designers showed that the Viterbi algorithm ensured 24 active S-boxes after 24 rounds, our tool based on Mixed Integer Linear Programming (MILP) in the framework of Mouha et al. ensures the same number of active S-boxes only after 18 rounds. The tool completely evaluates the tight bound of the number of active S-boxes, and it shows that the bound is 103 for full (64) rounds. We also analyze security of the Shuffle operation in the round function and resistance against linear cryptanalysis. Secondly, we present a new mode for a pseudorandom function (PRF) based on Lesamnta-LW. It is twice as efficient as the previous PRF modes based on Lesamnta-LW. We prove its security both in the standard model and the ideal cipher model.
Yu WANG Tao LU Zhihao WU Yuntao WU Yanduo ZHANG
Exploring the structural information as prior to facial images is a key issue of face super-resolution (SR). Although deep convolutional neural networks (CNNs) own powerful representation ability, how to accurately use facial structural information remains challenges. In this paper, we proposed a new residual fusion network to utilize the multi-scale structural information for face SR. Different from the existing methods of increasing network depth, the bottleneck attention module is introduced to extract fine facial structural features by exploring correlation from feature maps. Finally, hierarchical scales of structural information is fused for generating a high-resolution (HR) facial image. Experimental results show the proposed network outperforms some existing state-of-the-art CNNs based face SR algorithms.
Shuichi NAGASAWA Masamitsu TANAKA Naoki TAKEUCHI Yuki YAMANASHI Shigeyuki MIYAJIMA Fumihiro CHINA Taiki YAMAE Koki YAMAZAKI Yuta SOMEI Naonori SEGA Yoshinao MIZUGAKI Hiroaki MYOREN Hirotaka TERAI Mutsuo HIDAKA Nobuyuki YOSHIKAWA Akira FUJIMAKI
We developed a Nb 4-layer process for fabricating superconducting integrated circuits that involves using caldera planarization to increase the flexibility and reliability of the fabrication process. We call this process the planarized high-speed standard process (PHSTP). Planarization enables us to flexibly adjust most of the Nb and SiO2 film thicknesses; we can select reduced film thicknesses to obtain larger mutual coupling depending on the application. It also reduces the risk of intra-layer shorts due to etching residues at the step-edge regions. We describe the detailed process flows of the planarization for the Josephson junction layer and the evaluation of devices fabricated with PHSTP. The results indicated no short defects or degradation in junction characteristics and good agreement between designed and measured inductances and resistances. We also developed single-flux-quantum (SFQ) and adiabatic quantum-flux-parametron (AQFP) logic cell libraries and tested circuits fabricated with PHSTP. We found that the designed circuits operated correctly. The SFQ shift-registers fabricated using PHSTP showed a high yield. Numerical simulation results indicate that the AQFP gates with increased mutual coupling by the planarized layer structure increase the maximum interconnect length between gates.
Kyohei SUDO Keisuke HARA Masayuki TEZUKA Yusuke YOSHIDA Keisuke TANAKA
Software watermarking enables one to embed some information called “mark” into a program while preserving its functionality, and to read it from the program. As a definition of function preserving, Cohen et al. (STOC 2016) proposed statistical function preserving which requires that the input/output behavior of the marked circuit is identical almost everywhere to that of the original unmarked circuit. They showed how to construct watermarkable cryptographic primitives with statistical function preserving, including pseudorandom functions (PRFs) and public-key encryption from indistinguishability obfuscation. Recently, Goyal et al. (CRYPTO 2019) introduced more relaxed definition of function preserving for watermarkable signature. Watermarkable signature embeds a mark into a signing circuit of digital signature. The relaxed function preserving only requires that the marked signing circuit outputs valid signatures. They provide watermarkable signature with the relaxed function preserving only based on (standard) digital signature. In this work, we introduce an intermediate notion of function preserving for watermarkable signature, which is called computational function preserving. Then, we examine the relationship among our computational function preserving, relaxed function preserving by Goyal et al., and statistical function preserving by Cohen et al. Furthermore, we propose a generic construction of watermarkable signature scheme satisfying computational function preserving based on public key encryption and (standard) digital signature.
This paper presents an efficient method for solving PnP, PnPf, and PnPfr problems, which are the problems of determining camera parameters from 2D-3D point correspondences. The proposed method is derived based on a simple usage of linear algebra, similarly to the classical DLT methods. Therefore, the new method is easier to understand, easier to implement, and several times faster than the state-of-the-art methods using Gröbner basis. Contrary to the existing Gröbner basis methods, the proposed method consists of three algorithms depending on the number of the points and the 3D point configuration. Experimental results show that the proposed method is as accurate as the state-of-the-art methods even in near-planar scenes while achieving up to three times faster.
Anis Ur REHMAN Ken KIHARA Sakuichi OHTSUKA
In daily reality, people often pay attention to several objects that change positions while being observed. In the laboratory, this process is investigated by a phenomenon known as multiple object tracking (MOT) which is a task that evaluates attentive tracking performance. Recent findings suggest that the attentional set for multiple moving objects whose depth changes in three dimensions from one plane to another is influenced by the initial configuration of the objects. When tracking objects, it is difficult for people to expand their attentional set to multiple-depth planes once attention has been focused on a single plane. However, less is known about people contracting their attentional set from multiple-depth planes to a single-depth plane. In two experiments, we examined tracking accuracy when four targets or four distractors, which were initially distributed on two planes, come together on one of the planes during an MOT task. The results from this study suggest that people have difficulty changing the depth range of their attention during attentive tracking, and attentive tracking performance depends on the initial attentional set based on the configuration prior to attentive tracking.
Computing the weight distribution of a code is a challenging problem in coding theory. In this paper, the weight distributions of (256, k) extended binary primitive BCH codes with k≤71 and k≥187 are given. The weight distributions of the codes with k≤63 and k≥207 have already been obtained in our previous work. Affine permutation and trellis structure are used to reduce the computing time. Computer programs in C language which use recent CPU instructions, such as SIMD, are developed. These programs can be deployed even on an entry model workstation to obtain the new results in this paper.
Kotaro NAGAI Daisuke KANEMOTO Makoto OHKI
This letter reports on the effectiveness of applying the K-singular value decomposition (SVD) dictionary learning to the electroencephalogram (EEG) compressed sensing framework with outlier detection and independent component analysis. Using the K-SVD dictionary matrix with our design parameter optimization, for example, at compression ratio of four, we improved the normalized mean square error value by 31.4% compared with that of the discrete cosine transform dictionary for CHB-MIT Scalp EEG Database.
In this paper, we address the problem of detector design in severely frequency-selective channels for spatial multiplexing systems that adopt filter bank multicarrier based on offset quadrature amplitude modulation (FBMC/OQAM) as the communication waveforms. We consider decision feedback equalizers (DFEs) that use multiple feedback filters to jointly cancel the post-cursor components of inter-symbol interference, inter-antenna interference, and, in some configuration, inter-subchannel interference. By exploiting the special structures of the correlation matrix and the staggered property of the FBMC/OQAM signals, we obtain an efficient method of computing the DFE coefficients that requires a smaller number of multiplications than the linear equalizer (LE) and conventional DFE do. The simulation results show that the proposed detectors considerably outperform the LE and conventional DFE at moderate-to-high signal-to-noise ratios.