Makoto TAKITA Masanori HIROTOMO Masakatu MORII
Cassuto and Blaum presented a new coding framework for channels whose outputs are overlapping pairs of symbols in storage applications. Such channels are called symbol-pair read channels. Pair distance and pair error are used in symbol-pair read channels. Yaakobi et al. proved a lower bound on the minimum pair distance of cyclic codes. Furthermore, they provided a decoding algorithm for correcting pair errors using a decoder for cyclic codes, and showed the number of pair errors that can be corrected by their algorithm. However, their algorithm cannot correct all pair error vectors within half of the minimum pair distance. In this paper, we propose an efficient decoding algorithm for cyclic codes over symbol-pair read channels. It is based on the relationship between pair errors and syndromes. In addition, we show that the proposed algorithm can correct more pair errors than Yaakobi's algorithm.
In the study of the capacity problem for multiple access channels (MACs), a lower bound on the error probability obtained by Han plays a crucial role in the converse parts of several kinds of channel coding theorems in the information-spectrum framework. Recently, Yagi and Oohama showed a tighter bound than the Han bound by means of Polyanskiy's converse. In this paper, we give a new bound which generalizes and strengthens the Yagi-Oohama bound, and demonstrate that the bound plays a fundamental role in deriving extensions of several known bounds. In particular, the Yagi-Oohama bound is generalized to two different directions; i.e, to general input distributions and to general encoders. In addition we extend these bounds to the quantum MACs and apply them to the converse problems for several information-spectrum settings.
Jeehoon LEE Minjoong RIM Kiseon KIM
An incremental relaying protocol is a promising scheme for preventing the inefficient use of resources in half-duplex cooperative relay networks. In particular, the incremental selection amplify-and-forward (ISAF) relaying scheme is a well-designed protocol under the condition that the source-to-destination (SD) link is static during the two transmission phases. However, from a practical viewpoint, the SD link is not static but varies with time, and thus the ISAF relaying scheme may not work well in the field. In this work, we first show that the outage performance of the ISAF relaying scheme may decrease when the SD link is not static during the two transmission phases. We then propose a modified version of the ISAF relaying scheme which overcomes such a limitation of the ISAF relaying scheme under time-varying environments. Finally, numerical and simulation results are provided to support our findings.
In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate R is above channel capacity C, the error probability of decoding goes to one as the block length n of code word tends to infinity. He proved the theorem by deriving the exponent function of error probability of correct decoding that is positive if and only if R>C. Subsequently, in 1979, Dueck and Körner determined the optimal exponent of correct decoding. Arimoto's bound has been said to be equal to the bound of Dueck and Körner. However its rigorous proof has not been presented so far. In this paper we give a rigorous proof of the equivalence of Arimoto's bound to that of Dueck and Körner.
This paper proposes a novel direction-of-arrival (DOA) estimation method that can reduce performance degradation due to angular spread. Some algorithms previously proposed for such estimation make assumptions about the distributions of amplitude and phase for incident waves because most DOA estimation algorithms are sensitive to angular spread. However, when the assumptions are inaccurate, these algorithms perform poorly as compared with algorithms without countermeasures against angular spread. In this paper, we propose a method for selecting an appropriate DOA estimation algorithm according to the channel vector of each source signal as estimated by independent component analysis. Computer simulations show that the proposed method can robustly estimate DOA in environments with angular spread.
Azril HANIZ Gia Khanh TRAN Ryosuke IWATA Kei SAKAGUCHI Jun-ichi TAKADA Daisuke HAYASHI Toshihiro YAMAGUCHI Shintaro ARATA
Conventional localization techniques such as triangulation and multilateration are not reliable in non-line-of-sight (NLOS) environments such as dense urban areas. Although fingerprint-based localization techniques have been proposed to solve this problem, we may face difficulties because we do not know the parameters of the illegal radio when creating the fingerprint database. This paper proposes a novel technique to localize illegal radios in an urban environment by interpolating the channel impulse responses stored as fingerprints in a database. The proposed interpolation technique consists of interpolation in the bandwidth (delay), frequency and spatial domains. A localization algorithm that minimizes the squared error criterion is employed in this paper, and the proposed technique is evaluated through Monte Carlo simulations using location fingerprints obtained from ray-tracing simulations. Results show that utilizing an interpolated fingerprint database is advantageous in such scenarios.
Kazuma OUCHIDA Naoki HONMA Yoshitaka TSUNEKAWA
This paper proposes a new method that combines signal modulation and FDTD (Finite-Difference Time-Domain) simulations to reduce the computation time in multiple-antenna analysis. In this method, signals are modulated so as to maintain orthogonality among the excited signals; multiple antennas are excited at the same time. This means just one FDTD simulation is needed whereas the conventional method demands as many simulations as there are transmitting antennas. The simulation of a 2×2 multi-antenna system shows that the proposed method matches the performance of the conventional method even though its computation time is much shorter.
Orthogonal frequency division multiplexing (OFDM) channel estimation is the key technique used in broadband wireless networks. The Doppler frequency caused by fast mobility environments will cause inter-carrier interference (ICI) and degrade the performance of OFDM systems. Due to the severe ICI, channel estimation becomes a difficult task in higher mobility scenarios. Our aim is to propose a pilot-aided channel estimation method that is robust to high Doppler frequency with low computational complexity and pilot overheads. In this paper, the time duration of each estimate covers multiple consecutive OFDM symbols, named a “window”. A close-form of polynomial channel modeling is derived. The proposed method is initialized to the least squares (LS) estimates of the channels corresponding to the time interval of the pilot symbols within the window. Then, the channel interpolation is performed in the entire window. The results of computer simulations and computation complexity evaluations show that the proposed technique is robust to high Doppler frequency with low computation complexity and low pilot overheads. Compared with the state-of-the-art method and some conventional methods, the new technique proposed here has much lower computational complexity while offering comparable performance.
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.
Liang ZHOU Yoji OHASHI Makoto YOSHIDA
The dramatic growth in wireless data traffic has triggered the investigation of fifth generation (5G) wireless communication systems. Small cells will play a very important role in 5G to meet the 5G requirements in spectral efficiency, energy savings, etc. In this paper, we investigate low complexity millimeter-wave communication systems with uniform circular arrays (UCAs) in line-of-sight (LOS) multiple-input multiple-output (MIMO) channels, which are used in fixed wireless access such as small cell wireless backhaul for 5G. First, we demonstrate that the MIMO channel matrices for UCAs in LOS-MIMO channels are circulant matrices. Next, we provide a detailed derivation of the unified optimal antenna placement which makes MIMO channel matrices orthogonal for 3×3 and 4×4 UCAs in LOS channels. We also derive simple analytical expressions of eigenvalues and capacity as a function of array design (link range and array diameters) for the concerned systems. Finally, based on the properties of circulant matrices, we propose a high performance low complexity LOS-MIMO precoding system that combines forward error correction (FEC) codes and spatial interleaver with the fixed IDFT precoding matrix. The proposed precoding system for UCAs does not require the channel knowledge for estimating the precoding matrix at the transmitter under the LOS condition, since the channel matrices are circulant ones for UCAs. Simulation results show that the proposed low complexity system is robust to various link ranges and can attain excellent performance in strong LOS environments and channel estimation errors.
Hideo FUJIWARA Katsuya FUJIWARA
In our previous work [12], [13], we introduced generalized feed-forward shift registers (GF2SR, for short) to apply them to secure and testable scan design, where we considered the security problem from the viewpoint of the complexity of identifying the structure of GF2SRs. Although the proposed scan design is secure in the sense that the structure of a GF2SR cannot be identified only from the primary input/output relation, it may not be secure if part of the contents of the circuit leak out. In this paper, we introduce a more secure concept called strong security such that no internal state of strongly secure circuits leaks out, and present how to design such strongly secure GF2SRs.
In this paper, we consider a distributed power control scheme that can maximize overall capacity of an interference-limited wireless system in which the same radio resource is spatially reused among different transmitter-receiver pairs. This power control scheme employs a gradient-descent method in each transmitter, which adapts its own transmit power to co-channel interference dynamically to maximize the total weighted sum rate (WSR) of the system over a given interval. The key contribution in this paper is to propose a common feedback channel, over which a backward physical signal is accumulated for computing the gradient of the transmit power in each transmitter, thereby significantly reducing signaling overhead for the distributed power control. We show that the proposed power control scheme can achieve almost 95% of its theoretical upper WSR bound, while outperforming the non-power-controlled system by roughly 63% on average.
Radio channel modeling is fundamental for designing wireless communication systems. In millimeter or sub-millimeter wave short range communication, shadowing effect by electrically-large objects is one of the most important factors determining the field strength and thus the coverage. Unfortunately, numerical methods like MoM, FDTD, FEM are unable to compute the field scattered by large objects due to their excessive time and memory requirements. Ray theory like geometrical theory of diffraction (GTD) by Keller is an effective and popular solution but suffers various kinds of singularities at geometrical boundaries such as incidence shadow boundary (ISB) or reflection shadow boundary (RSB). Modified edge representation (MER) equivalent edge current (EEC) is an accurate and a fast high frequency diffraction technique which expresses the fields in terms of line integration. It adopts classical Keller-type knife-edge diffraction coefficients and still provides uniform and highly accurate fields everywhere including geometrical boundaries. MER is used here to compute the millimeter-wave field distribution in compact range communication systems where shadowing effects rather than multi-path ones dominate the radio environments. For further simplicity, trigonometric functions in Keller's diffraction coefficients are replaced by the path lengths of source to the observer via the edge point of integration of the scatterers in the form of Fresnel zone number (FZN). Complexity, Computation time and the memory were reduced drastically without degrading the accuracy. The dipole wave scattering from flat rectangular plates is discussed with numerical examples.
Potential games form a class of non-cooperative games where the convergent of unilateral improvement dynamics is guaranteed in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.
Dexiu HU Zhen HUANG Jianhua LU
This paper proposes and analyses an improved direction finding (DF) method that uses a rotating interferometer. The minimum sampling frequency is deduced in order to eliminate the phase ambiguity associated with a long baseline, the influence of phase imbalance of receiver is quantitatively discussed and the Root Mean Square Error (RMSE) of both bearing angle and pitch angle are also demonstrated. The theoretical analysis of the rotating interferometer is verified by simulation results, which show that it achieves better RMSE performance than the conventional method.
In this paper, we propose an analytical approach for adaptive decode-and-forward (ADF) relaying schemes consisting of burst data transmission based on pilot symbol assisted-channel estimation (PSA-CE) methods over quasi-static Rayleigh fading channels. At first, we focus on the error-event at relay nodes in which the transmission mode switching is carried out burst by burst, whereas previous studies assumed the transmission mode switching symbol-by-symbol, thus showing lower error rate bound. Under consideration of burst transmission for ADF relay systems, we derive exact error rate expressions which better estimate the performance of actual systems. Then, the average bit and burst error rates are derived in approximated expressions for an arbitrary link signal-to-noise ratio (SNR) related with channel estimation errors. Their accuracy is confirmed by comparison with simulation results. Furthermore, ADF relay systems with PSA-CE schemes are confirmed to select correctly decoded relay nodes without additional signaling between relay nodes and the destination node and it is verified to achieve the performance at a cost of negligible SNR loss.
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.
Shidang LI Chunguo LI Yongming HUANG Dongming WANG Luxi YANG
Considering worse-case channel uncertainties, we investigate the robust energy efficient (EE) beamforming design problem in a K-user multiple-input-single-output (MISO) interference channel. Our objective is to maximize the worse-case sum EE under individual transmit power constraints. In general, this fractional programming problem is NP-hard for the optimal solution. To obtain an insight into the problem, we first transform the original problem into its lower bound problem with max-min and fractional form by exploiting the relationship between the user rate and the minimum mean square error (MMSE) and using the min-max inequality. To make it tractable, we transform the problem of fractional form into a subtractive form by using the Dinkelbach transformation, and then propose an iterative algorithm using Lagrangian duality, which leads to the locally optimal solution. Simulation results demonstrate that our proposed robust EE beamforming scheme outperforms the conventional algorithm.
Lucas DE M. GUIMARÃES Jacir L. BORDIM Koji NAKANO
Directional communications have been considered as a feasible alternative to improve spatial division and throughput in mobile communication environments. In general, directional MAC protocols proposed in the literature rely on channel reservation based on control frames, such as RTS/CTS. Notwithstanding, channel reservation based on control frames increases latency and has an impact on the network throughput. The main contribution of this paper is to propose a channel reservation technique based on pulse/tone signals. The proposed scheme, termed directional pulse/tone channel reservation (DPTCR), allows for efficient channel reservation without resorting to control frames such as RTS and CTS. Theoretical and empirical results show that the proposed scheme has a low probability of failure while providing significant throughput gains. The results show that DPTCR is able to provide throughput improvement up to 158% higher as compared to traditional channel reservation employing RTS/CTS frames.
This paper proposes the concept of adaptive multi-rate (AMR), which jointly employs switching between two links and adaptive rate on each link, for hybrid free-space optical/radio-frequency (FSO/RF) systems. Moreover, we present the cross-layer design of AMR switching, which is based on both the physical and link layers with an automatic-repeat request (ARQ) scheme. We develop an analytical framework based on a Markov chain model for system performance analysis. System performance metrics, including frame-error rate, goodput and link switching probability, are analytically studied over fading channels. Numerical results quantitatively show how the proposal significantly outperforms conventional ones with physical layer-based design and/or fixed-rate switching operation.