In multi-hop communication systems, two-way relaying is one of the solutions to mitigate the spectral efficiency loss caused by a half-duplex transmission. In this paper, a simple two-way relaying scheme is proposed for two-hop two-user multiple input multiple output (MIMO) systems. In the proposed system, a base station and a relay station (RS), both equipped with two antennas, form a point-to-point MIMO channel, while the RS and two single-antenna mobile users form a point-to-multipoint multiuser (MU)-MIMO channel. Numerical examples show that the proposed system achieves a significant sum rate gain as compared to a one-way relaying system as the distance between a relay and the two users decreases. We also show that although we can expand the proposed scheme to more than two users, its performance gain as compared to that of one-way relaying decreases with an increase in the number of users.

Dispersion management (DM), optical phase conjugation (OPC), and the combination of DM and OPC are promising techniques to compensate for optical signal distortion due to group velocity dispersion and nonlinear Kerr effects. The system performance improvement in DM links combined with OPC has been reported; however, the fixed residual dispersion per span (RDPS) usually used in these links restricts the flexibility of link configuration. Thus, in this paper, a flexible optical link configuration with artificially distributed single-mode fiber (SMF) lengths and RDPS in the combination of DM and OPC is proposed. Simulation results show that the best artificial distribution pattern is the gradually descending distribution of SMF lengths and the gradually ascending distribution of RDPS, as the number of fiber spans is increased, regardless of the average RDPS, the optimal net residual dispersion, and the dispersion coefficient of the dispersion compensating fiber.

The simultaneous suppression of sidelobes and the sharpening of the central peak in the process of diffraction pattern detection based on asymmetric apodization have been investigated. Asymmetric apodization is applied to a semicircular array of two-dimensional (2D) aperture functions, which is a series of 'coded-phase arrays of semicircular rings randomly distributed over the central circular region of a pupil function' and is similar to that used in the field of diffractive optics. The point spread function (PSF) of an imaging system with asymmetric apodization of the discrete type has been found to possess a good side with suppressed sidelobes, whereas its bad side contains enhanced sidelobes. Further, the diffracted field characteristics are obtained in the presence of these aperture functions. Asymmetric apodization is helpful in improving the performance of the optical gratings or 2D arrays used in real-time imaging techniques.

Here, we present a review of the proposals and advances in the field of three-dimensional (3D) imaging acquisition and display made in the last century. The most popular techniques are based on the concept of stereoscopy. However, stereoscopy does not provide real 3D experience, and produces discomfort due to the conflict between convergence and accommodation. For this reason, we focus this paper on integral imaging, which is a technique that permits the codification of 3D information in an array of 2D images obtained from different perspectives. When this array of elemental images is placed in front of an array of microlenses, the perspectives are integrated producing 3D images with full parallax and free of the convergence-accommodation conflict. In the paper we describe the principles of this technique, together with some new applications of integral imaging.

In spectrum sensing, there is a tradeoff between the probability of missed detection and the probability of a false alarm according to the value of the sensing threshold. Therefore, it is important to determine the sensing threshold suitable to the environment of cognitive radio networks. In this study, we consider a cognitive radio-based ad hoc network where secondary users directly communicate by using the same frequency band as the primary system and control their transmit power on the basis of the distance between them. First, we investigate a condition in which the primary and the secondary users can share the same frequency band without harmful interference from each other, and then, propose an algorithm that controls the sensing threshold dynamically on the basis of the transmit power of the secondary user. The analysis and simulation results show that the proposed sensing threshold control algorithm has low probabilities of both missed detection and a false alarm and thus, enables optimized spectrum sharing between the primary and the secondary systems.

The field of body sensor networks has attracted interest of many researchers due to its potential to revolutionize medicine. These sensors are usually implanted inside the human body and communicate among themselves. In the process of receiving, processing, or transmitting data, these devices produce heat. This heat damages the tissues surrounding the devices in the case of prolonged exposure. In this paper, to reduce this damages, we have improved and evaluated two protocols-the least temperature routing protocol and adaptive least temperature routing protocol-by implementing clustering as well as a leadership rotation algorithm. We used Castalia to simulate a basic body area network cluster composed of 6 nodes. A throughput application was used to simulate all the nodes sending data to one sink node. Simulations results shows that improved communication protocol with leadership rotation algorithm significantly reduce the energy consumption as compared to a scheme without leadership rotation algorithm.

This paper presents a concurrent channel time allocation scheme used in the reservation period for concurrent transmissions in 60-GHz wireless personal area networks (WPANs). To this end, the proposed resource allocation scheme includes an efficient method for creating a concurrent transmission group by using a table that indicates whether individual streams experience interference from other streams or not. The coordinator device calculates the number of streams that can be concurrently transmitted with each stream and groups them together on the basis of the calculation result. Then, the coordinator device allocates resources to each group such that the streams belonging to the same group can transmit data concurrently. Therefore, when the piconet coordinator (PNC) allocates the channel time to the individual groups, it should allow for maximizing the overall capacity. The performance evaluation result demonstrates that the proposed scheme outperforms the random grouping scheme in terms of the overall capacity when the beamwidth is $30^{\circ}C$ and the radiation efficiency is 0.9.

This paper discusses computer-generated heuristics for motion planning. Planning with many degrees of freedom is a challenging task, because the complexity of most planning algorithms grows exponentially with the number of dimensions of the problem. A well-designed heuristic may greatly improve the performance of a planning algorithm in terms of the computation time. However, in recent years, with increasingly challenging high-dimensional planning problems, the design of good heuristics has itself become a complicated task. In this paper, we present an approach to algorithmically develop a heuristic for motion planning, which increases the efficiency of a planner in similar environments. To implement the idea, we generalize modern motion planning algorithms to an extent, where a heuristic is represented as a set of random variables. Distributions of the variables are then analyzed with computer learning methods. The analysis results are then utilized to generate a heuristic. During the experiments, the proposed approach is applied to several planning tasks with different algorithms and is shown to improve performance.

This paper proposes a method to manipulate digital hologram contents by manipulating and/or synthesizing the depth information. To synthesize digital holograms themselves in order to create new digital hologram contents. This paper uses both the depth information obtained by converting the disparity information by using a stereo matching method and that obtained by taking pictures with a depth camera. In addition, assuming that digital holograms are created using the computer-generated holography method, we propose a technique for authoring and compositing hologram contents by using either the changes in the three-dimensional positions of objects in the hologram or by combining the objects with other contents by means of changes in the depth information. Further, more than one digital hologram was synthesized to form a hologram. The reconstructed result from the synthesized hologram also contained all the objects in each digital hologram before synthesis at the same positions and distances.

In this paper, we present a graphics processing unit (GPU)-based matching technique for the purpose of fast feature matching between different images. The scale invariant feature transform algorithm developed by Lowe for various feature matching applications, such as stereo vision and object recognition, is computationally intensive. To address this problem, we propose a matching technique optimized for GPUs to perform computations in less time. We optimize GPUs for fast computation of keypoints to make our system quick and efficient. The proposed method uses a self-organizing map feature matching technique to perform efficient matching between the different images. The experiments are performed on various image sets to examine the performance of the system under varying conditions, such as image rotation, scaling, and blurring. The experimental results show that the proposed algorithm outperforms the existing feature matching methods, resulting in fast feature matching due to the optimization of the GPU.