Hiroyuki SHINBO Kousuke YAMAZAKI Yoji KISHI
To achieve highly efficient spectrum usage, dynamic sharing of scarce spectrum resources has recently become the subject of intense discussion. The technologies of dynamic spectrum sharing (DSS) have already been adopted or are scheduled to be adopted in a number of countries, and Japan is no exception. The authors and organizations collaborating in the research and development project being undertaken in Japan have studied a novel DSS system positioned between the fifth-generation mobile communication system (5G system) and different incumbent radio systems. Our DSS system has three characteristics. (1) It detects dynamically unused sharable spectrums (USSs) of incumbent radio systems for the space axis by using novel propagation models and estimation of the transmitting location with radio sensor information. (2) It manages USSs for the time axis by interference calculation with propagation parameters, fair assignment and future usage of USSs. (3) It utilizes USSs for the spectrum axis by using methods that decrease interference for lower separation distances. In this paper, we present an overview and the technologies of our DSS system and its applications in Japan.
In this paper, for the purpose of clarifying the desired ITS information and communication systems considering both safety and social feasibility to prevention overengineering, using a microscopic traffic flow simulator, we discuss the required information acquisition rate of three types of safety driving support systems, that is, the sensor type and the communication type, the sensor and communication fusion type. Performances are evaluated from the viewpoint of preventing overengineering performance using the “TsRm evaluation method” that considers a vehicle approaching within the range of R meters within T seconds as the vehicle with a high possibility of collision, and that evaluates only those vehicles. The results show that regarding the communication radius and the sensing range, overengineering performance may be estimated when all vehicles in the evaluation area are used for evaluations without considering each vehicle's location, velocity and acceleration as in conventional evaluations. In addition, it is clarified that the sensor and communication fusion type system is advantageous by effectively complementing the defects of the sensor type systems and the communication type systems.
Yang DING Yuting QIU Hongxi TONG
One of the main problems in list decoding is to determine the tradeoff between the list decoding radius and the rate of the codes w.r.t. a given metric. In this paper, we first describe a “stronger-weaker” relationship between two distinct metrics of the same code, then we show that the list decodability of the stronger metric can be deduced from the weaker metric directly. In particular, when we focus on matrix codes, we can obtain list decodability of matrix code w.r.t. the cover metric from the Hamming metric and the rank metric. Moreover, we deduce a Johnson-like bound of the list decoding radius for cover metric codes, which improved the result of [20]. In addition, the condition for a metric that whether the list decoding radius w.r.t. this metric and the rate are bounded by the Singleton bound is presented.
Yuya KAMATAKI Yusuke KAMEDA Yasuyo KITA Ichiro MATSUDA Susumu ITOH
This paper proposes a lossless coding method for HDR color images stored in a floating point format called Radiance RGBE. In this method, three mantissa and a common exponent parts, each of which is represented in 8-bit depth, are encoded using the block-adaptive prediction technique with some modifications considering the data structure.
Chen CHEN Maojun ZHANG Hanlin TAN Huaxin XIAO
Pedestrian detection is an essential but challenging task in computer vision, especially in crowded scenes due to heavy intra-class occlusion. In human visual system, head information can be used to locate pedestrian in a crowd because it is more stable and less likely to be occluded. Inspired by this clue, we propose a dual-task detector which detects head and human body simultaneously. Concretely, we estimate human body candidates from head regions with statistical head-body ratio. A head-body alignment map is proposed to perform relational learning between human bodies and heads based on their inherent correlation. We leverage the head information as a strict detection criterion to suppress common false positives of pedestrian detection via a novel pull-push loss. We validate the effectiveness of the proposed method on the CrowdHuman and CityPersons benchmarks. Experimental results demonstrate that the proposed method achieves impressive performance in detecting heavy-occluded pedestrians with little additional computation cost.
Chao WANG Michihiko OKUYAMA Ryo MATSUOKA Takahiro OKABE
Water detection is important for machine vision applications such as visual inspection and robot motion planning. In this paper, we propose an approach to per-pixel water detection on unknown surfaces with a hyperspectral image. Our proposed method is based on the water spectral characteristics: water is transparent for visible light but translucent/opaque for near-infrared light and therefore the apparent near-infrared spectral reflectance of a surface is smaller than the original one when water is present on it. Specifically, we use a linear combination of a small number of basis vector to approximate the spectral reflectance and estimate the original near-infrared reflectance from the visible reflectance (which does not depend on the presence or absence of water) to detect water. We conducted a number of experiments using real images and show that our method, which estimates near-infrared spectral reflectance based on the visible spectral reflectance, has better performance than existing techniques.
Yasunori SUZUKI Shoichi NARAHASHI
This paper presents linearization technologies for high efficiency power amplifiers of cellular base stations. These technologies are important to actualizing highly efficient power amplifiers that reduce power consumption of the base station equipment and to achieving a sufficient non-linear distortion compensation level. It is well known that it is very difficult for a power amplifier using linearization technologies to achieve simultaneously high efficiency and a sufficient non-linear distortion compensation level. This paper presents two approaches toward addressing this technical issue. The first approach is a feed-forward power amplifier using the Doherty amplifier as the main amplifier. The second approach is a digital predistortion linearizer that compensates for frequency dependent intermodulation distortion components. Experimental results validate these approaches as effective for providing power amplification for base stations.
This paper presents an analytical model that yields the unavailability of a network function when each backup server can protect two functions and can recover one of them. Previous work describes a model to deal with the case that each function can be protected only by one server. In our model, we allow each function to be protected by multiple servers to ensure function availability. This requires us to know the feasible states of a connected component and its state transitions. By adopting the divide-and-conquer method, we enumerate the feasible states of a connected component. We then classify its state transitions. Based on the obtained feasible states and the classification of the state transitions, we enumerate the feasible states incoming to and outgoing from a general state, the transfer rates, and the conditions. With those informations, we generate multiple equations about the state transitions. Finally, by solving them, we obtain the probabilities that a connected component is in each state and calculate the unavailability of a function. Numerical results show that the average unavailability of a function is reduced by 18% and 5.7% in our two examined cases by allowing each function to be protected by multiple servers.
Erik DAHLMAN Gunnar MILDH Stefan PARKVALL Patrik PERSSON Gustav WIKSTRÖM Hideshi MURAI
The paper provides an overview of the current status of the 5G evolution as well as a research outlook on the future wireless-access evolution towards 6G.
Jiafeng MAO Qing YU Kiyoharu AIZAWA
Well annotated dataset is crucial to the training of object detectors. However, the production of finely annotated datasets for object detection tasks is extremely labor-intensive, therefore, cloud sourcing is often used to create datasets, which leads to these datasets tending to contain incorrect annotations such as inaccurate localization bounding boxes. In this study, we highlight a problem of object detection with noisy bounding box annotations and show that these noisy annotations are harmful to the performance of deep neural networks. To solve this problem, we further propose a framework to allow the network to modify the noisy datasets by alternating refinement. The experimental results demonstrate that our proposed framework can significantly alleviate the influences of noise on model performance.
Manabu MIKAMI Kohei MOTO Koichi SERIZAWA Hitoshi YOSHINO
Fifth generation mobile communication system (5G) mobile operators need to explore new use cases and/or applications together with vertical industries, the industries that are potential users of 5G, in order to fully exploit the new 5G capabilities in terms of its application. Vehicle-to-Everything (V2X) communications for platooning are considered to be one of new 5G use cases requiring low-latency and ultra-reliability are required. This paper presents our field trial of dynamic mode switching for 5G New Radio (NR) based V2X sidelink communications towards application to truck platooning. The authors build a field trial environment, for V2X communications of truck platooning, with actual large-size trucks and a prototype system employing 5G NR technologies, and performed some field trials in rural areas. In this paper, we introduce the 5G NR-V2X prototype system. Its most distinctive characteristic is that the prototype system is equipped with vehicle-to-vehicle (V2V) Direct communication radio interface (i.e., sidelink), in addition to the traditional radio interfaces between base station (BS) and user equipment (UE), i.e., downlink and uplink. Moreover, it is also most distinctive that the sidelink (SL) interface supports a new function of dynamic mode switching between two modes of BS In-Coverage mode (SL Mode-1) and BS Out-of-Coverage mode (SL Mode-2) in order to achieve seamless V2V communications between BS in-coverage area and BS out-of-coverage area. Then, we present the evaluation results on over-the-air latency performance on the V2V Direct communication of the prototype using SL dynamic mode switching with two experimental base station antenna sites in a public express highway environment towards application to truck platooning. The results demonstrate that our developed the SL dynamic mode switching achieves the seamless V2V Direct communications between in-coverage area and out-of-coverage area.
Kakeru MATSUBARA Shun KUROKI Koki ITO Kazushi SHIMADA Kazuki MARUTA Chang-Jun AHN
This letter expands the previously proposed High Time Resolution Carrier Interferometry (HTRCI) to estimate a larger amount of channel status information (CSI). HTRCI is based on a comb-type pilot symbol on OFDM and CSI for null subcarriers are interpolated by time-domain signal processing. In order to utilize such null pilot subcarriers for increasing estimable CSI, they should generally be separated in frequency-domain prior to estimation and interpolation processes. The main proposal is its separation scheme in conjunction with the HTRCI treatment of the temporal domain. Its effectiveness is verified by a pilot de-contamination on downlink two-cell MIMO transmission scenario. Binary error rate (BER) performance can be improved in comparison to conventional HTRCI and zero padding (ZP) which replaces the impulse response alias with zeros.
Natsuki UENO Shoichi KOYAMA Hiroshi SARUWATARI
We propose a useful formulation for ill-posed inverse problems in Hilbert spaces with nonlinear clipping effects. Ill-posed inverse problems are often formulated as optimization problems, and nonlinear clipping effects may cause nonconvexity or nondifferentiability of the objective functions in the case of commonly used regularized least squares. To overcome these difficulties, we present a tractable formulation in which the objective function is convex and differentiable with respect to optimization variables, on the basis of the Bregman divergence associated with the primitive function of the clipping function. By using this formulation in combination with the representer theorem, we need only to deal with a finite-dimensional, convex, and differentiable optimization problem, which can be solved by well-established algorithms. We also show two practical examples of inverse problems where our theory can be applied, estimation of band-limited signals and time-harmonic acoustic fields, and evaluate the validity of our theory by numerical simulations.
In this letter, we will prove that chaotic binary sequences generated by the tent map and Walsh functions are i.i.d. (independent and identically distributed) and orthogonal to each other.
Yi LU Keisuke HARA Keisuke TANAKA
Receiver selective opening (RSO) attack for public key encryption (PKE) captures a situation where one sender sends messages to multiple receivers, an adversary can corrupt a set of receivers and get their messages and secret keys. Security against RSO attack for a PKE scheme ensures confidentiality of other uncorrupted receivers' ciphertexts. Among all of the RSO security notions, simulation-based RSO security against chosen ciphertext attack (SIM-RSO-CCA security) is the strongest notion. In this paper, we explore constructions of SIM-RSO-CCA secure PKE from various computational assumptions. Toward this goal, we show that a SIM-RSO-CCA secure PKE scheme can be constructed based on an IND-CPA secure PKE scheme and a designated-verifier non-interactive zero-knowledge (DV-NIZK) argument satisfying one-time simulation soundness. Moreover, we give the first construction of DV-NIZK argument satisfying one-time simulation soundness. Consequently, through our generic construction, we obtain the first SIM-RSO-CCA secure PKE scheme under the computational Diffie-Hellman (CDH) or learning parity with noise (LPN) assumption.
Satoshi SUYAMA Tatsuki OKUYAMA Yoshihisa KISHIYAMA Satoshi NAGATA Takahiro ASAI
In sixth-generation (6G) mobile communication system, it is expected that extreme high data rate communication with a peak data rate over 100Gbps should be provided by exploiting higher frequency bands in addition to millimeter-wave bands such as 28GHz. The higher frequency bands are assumed to be millimeter wave and terahertz wave where the extreme wider bandwidth is available compared with 5G, and hence 6G needs to promote research and development to exploit so-called terahertz wave targeting the frequency from 100GHz to 300GHz. In the terahertz wave, there are fundamental issues that rectilinearity and pathloss are higher than those in the 28GHz band. In order to solve these issues, it is very important to clarify channel characteristics of the terahertz wave and establish a channel model, to advance 6G radio access technologies suitable for the terahertz wave based on the channel model, and to develop radio-frequency device technologies for such higher frequency bands. This paper introduces a direction of studies on 6G radio access technologies to explore the higher frequency bands and technical issues on the device technologies, and then basic computer simulations in 100Gbps transmission using 100GHz band clarify a potential of extreme high data rate over 100Gbps.
Yanjun LI Haibin KAN Jie PENG Chik How TAN Baixiang LIU
In this letter, we present a construction of bent functions which generalizes a work of Zhang et al. in 2016. Based on that, we obtain a cubic bent function in 10 variables and prove that, it has no affine derivative and does not belong to the completed Maiorana-McFarland class, which is opposite to all 6/8-variable cubic bent functions as they are inside the completed Maiorana-McFarland class. This is the first time a theoretical proof is given to show that the cubic bent functions in 10 variables can be outside the completed Maiorana-McFarland class. Before that, only a sporadic example with such properties was known by computer search. We also show that our function is EA-inequivalent to that sporadic one.
In this paper, we present an algorithm that counts the number of empty quadrilaterals whose corners are chosen from a given set S of n points in general position. Our algorithm can separately count the number of convex or non-convex empty quadrilaterals in O(T) time, where T denotes the number of empty triangles in S. Note that T varies from Ω(n2) and O(n3) and the expected value of T is known to be Θ(n2) when the n points in S are chosen uniformly and independently at random from a convex and bounded body in the plane. We also show how to enumerate all convex and/or non-convex empty quadrilaterals in S in time proportional to the number of reported quadrilaterals, after O(T)-time preprocessing.