Viterbi decoding is commonly used for several protocols, but computational cost is quite high and thus it is necessary to implement it effectively. This paper describes GPU implementation of Viterbi decoder utilizing three-point Viterbi decoding algorithm (TVDA), in which the received bits are divided into multiple chunks and several chunks are decoded simultaneously. Coalesced access and Warp Shuffle, which is new instruction introduced are also utilized in order to improve decoder performance. In addition, iterative execution of parallel chunks decoding reduces the latency of proposed Viterbi decoder in order to utilize the decoder as a part of GPU-based SDR transceiver. As the result, the throughput of proposed Viterbi decoder is improved by 23.1%.

Dynamic analysis is frail and insufficient to find hidden paths in environment-intensive program. By analyzing a broad spectrum of different concolic testing systems, we conclude that a number of them cannot handle programs that interact with the environment or require a complete working model. This paper addresses this problem by automatically identifying and modifying outputs of the data input interface function(DIIF). The approach is based on fine-grained taint analysis for detecting and updating the data that interacts with the environment to generate a new set of inputs to execute hidden paths. Moreover, we developed a prototype and conducted extensive experiments using a set of complex and environmentally intensive programs. Finally, the result demonstrates that our approach could identify the DIIF precisely and discover hidden path obviously.

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.

We propose efficient algorithms for Sorting k-Sets in Bins. The Sorting k-Sets in Bins problem can be described as follows. We are given numbered n bins with k balls in each bin. Balls in the i-th bin are numbered n-i+1. We can only swap balls between adjacent bins. Our task is to move all of the balls to the same numbered bins. For this problem, we give an efficient greedy algorithm with $rac{k+1}{4}n^2+O(k+n)$ swaps and provide a detailed analysis for k=3. In addition, we give a more efficient recursive algorithm using $rac{15}{16}n^2+O(n)$ swaps for k=3.

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.

A connected-(r,s)-out-of-(m,n): F system is a kind of the connected-X-out-of-(m,n): F system defined by Boehme et al. [2]. A connected-(r,s)-out-of-(m,n): F system consists of m×n components arranged in (m,n)-matrix. This system fails if and only if there exists a grid of size r×s in which all components are failed. When m=r, this system can be regarded as a consecutive-s-out-of-n: F system, and then the optimal arrangement of this system satisfies theorem which stated by Malon [9] in the case of s=2. In this study, we proposed a new algorithm for obtaining optimal arrangement of the connected-(r,2)-out-of-(m,n): F system based on the above mentioned idea. We performed numerical experiments in order to compare the proposed algorithm with the algorithm of enumeration method, and calculated the order of the computation time of these two algorithms. The numerical experiments showed that the proposed algorithm was more efficiently than the algorithm of enumeration method.

We discuss software reliability assessment considering multiple changes of software fault-detection phenomenon. The testing-time when the characteristic of the software failure-occurrence or fault-detection phenomenon changes notably in the testing-phase of a software development process is called change-point. It is known that the occurrence of the change-point influences the accuracy for the software reliability assessment based on a software reliability growth models, which are mainly divided into software failure-occurrence time and fault counting models. This paper discusses software reliability growth modeling frameworks considering with the effect of the multiple change-point occurrence on the software reliability growth process in software failure-occurrence time and fault counting modeling. And we show numerical illustrations for the software reliability analyses based on our models by using actual data.

Sparse Matrix-Vector Multiplication (SpMxV) is widely used in many high-performance computing applications, including information retrieval, medical imaging, and economic modeling. To eliminate the overhead of zero padding in SpMxV, prior works have focused on partitioning a sparse matrix into row vectors sets (RVS's) or sub-matrices. However, performance was still degraded due to the sparsity pattern of a sparse matrix. In this letter, we propose a heuristics, called recursive merging, which uses a greedy approach to recursively merge those row vectors of nonzeros in a matrix into the RVS's, such that each set included is ensured a local optimal solution. For ten uneven benchmark matrices from the University of Florida Sparse Matrix Collection, our proposed partitioning algorithm is always identified as the method with the highest mean density (over 96%), but with the lowest average relative difference (below 0.07%) over computing powers.

Two-track squeeze and adjacent track interference (ATI) are major barriers to increasing track density in hard disk drives (HDD). These depend on skew angles made by a magnetic head and circumferential direction on a magnetic disk. This paper describes relationships between the skew angle and the magnetic core width (MCW) which affects two-track squeeze and ATI performance. We propose a design concept of a track pitch profile at different skew angles considering MCW. Equivalent robustness of ATI performance on different skew angle conditions is obtained with the optimized track pitch.

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.

Cu-Mo alloy carries forward not only high electrical conductivity and high thermal conductivity from Cu but also high hardness from Mo, which makes it a promising potential application in electrical contact fields. In this paper, arc characteristic and erosion characteristic of Cu-Mo contacts are studied with a bridge-type contact high speed break mechanism on DC270 V/200 A load condition. And in each experiment group, 2500 times break operations are carried out. During every break operation, a high-speed AD card is used to record voltage and current signal of the arc, a high-speed camera is applied to record arcing process, and the temperature of contacts and arc are acquired by thermocouple and spectrometer, respectively. The mass and contact resistance of contacts are measured before and after every group experiment. Besides, the photograph of contact surface is taken by SEM to help analyze the erosion characteristic. The comparison between Cu-Mo contacts and Cu contacts indicates that although Cu contacts have a better electrical conductivity and thermal conductivity, Cu-Mo contacts can decrease the temperature of arc to prevent thermal breakdown, and they are also harder to be ablated and have a longer life span.

This paper studies a cascade system of dynamic binary neural networks. The system is characterized by signum activation function, ternary connection parameters, and integer threshold parameters. As a fundamental learning problem, we consider storage and stabilization of one desired binary periodic orbit that corresponds to control signals of switching circuits. For the storage, we present a simple method based on the correlation learning. For the stabilization, we present a sparsification method based on the mutation operation in the genetic algorithm. Using the Gray-code-based return map, the storage and stability can be investigated. Performing numerical experiments, effectiveness of the learning method is confirmed.

In a previous paper, we proposed a rescue support system for victims buried in an earthquake disaster by constructing an ad-hoc network using home-server based smart homes. However, this system has the following two problems: i) it cannot ensure sufficient density of home servers to realize adequate WLAN coverage, ii) the system does not consider areas in which home servers cannot be used such as parks and factories, for example. In this paper, we propose a new method using a delay tolerant network (DTN) technique. In this method, rescuers (such as rescue teams) with mobile devices relay information between disconnected networks by walking around during rescue activities. For a performance evaluation, we performed simulation experiments using a map of Abeno-ku, Osaka. From our results, we show that the proposed method increases the information acquisition rate, and that the network can be maintained. We also quantitatively show the penetration rate of smart homes needed for our system. In addition, we show that the rescue request system is more effective than other systems, and the method with the mobile device relay is better than without this method.

This paper describes 0.8-/1.5-GHz-band GaAs-HBT power amplifier modules with a newly designed analog bias control scheme. This scheme has two features. One is to achieve approximately linear quiescent current control using not a BiFET process but only the usual HBT process. The other is to help improve linearity under reduced supply voltage and lower quiescent current operation. The following two key techniques are incorporated into the bias scheme. The first is to employ two different kinds of bias circuits: emitter follower bias and current injection bias. The second is the unique current injection bias block, based on the successful combination of an input buffer with an emitter resistance load and a current mirror. These techniques allow quiescent current control that is almost proportional to an externally applied analog control voltage. To confirm the effectiveness of the scheme, 0.8-GHz-band and 1.5-GHz-band power amplifier modules were designed and fabricated using the usual HBT process. Measurements conducted under the conditions of a 3.4V supply voltage and an HSDPA WCDMA modulated signal are as follows. The 0.8-GHz-band amplifier can deliver a 28-dBm output power (Pout), a 28.4-dB power gain (Gp), and 42% PAE while restricting the ACLR to less than -40dBc. For the 1.5-GHz-band amplifier, 28dBm of Pout, 29dB of Gp, and 41% of PAE are obtained with the same ACLR levels. The measurements also confirm that the quiescent current for the second stage in the amplifiers is approximately linearly changed from 14mA to 58mA over a control voltage ranging from 1.1V to 2.2V. In addition, our measured DG.09-based current dissipation with both supply voltage and analog bias controls is as low as 16.9mA, showing that the analog bias control scheme enables an average current reduction of more than 20%, as compared to a conventional supply voltage and two-step quiescent current control.

User context and user location in particular play an important role in location-based services (LBS). The location can be determined by various positioning methods. These are typically evaluated with average positioning error or percentile values, which are not the most suitable metrics for evaluation of how a positioning method functions in the semantic space. Therefore, we propose a new method for evaluation of positioning accuracy in the semantic space. We focus on two types of semantic user locations that are widely available in urban areas: the street address and the categories of the surrounding points of interest (POIs). We demonstrate its use on ten different positioning methods: a standalone satellite navigation device, GPS module on a smartphone, two versions of Foursquare positioning service, Google positioning service, a positioning service of the local mobile operator, and four other possible variants of mobile operator-based positioning methods. The evaluation suggests that approach with the street addresses is more promising approach due to either sparse or unevenly distributed POIs. Furthermore, some of the positioning methods that are less accurate in Euclidean space, such as a combination of the GPS data with the mobile operator-based method that relies on the propagation models, performed comparably well in the semantic space as the methods that are using more accurate technologies, such as Google and Foursquare.

This paper gives an outline of key technologies necessary for science-based agriculture. In order to design future agriculture, present agriculture should be redesigned based on the context of smart agriculture that indicates the overall form of agriculture including a social system while the present precision agriculture shows a technical form of agriculture only. Wireless Sensor Network (WSN) and the various type of optical sensors are assumed to be a basic technology of smart agriculture which intends the harmony with the economic development and sustainable agro-ecosystem. In this paper, the current state and development for the optical sensing for environment and plant are introduced.

Physical layer security is effective in wireless communications because it makes a transmission secure from the beginning of protocols. We have proposed a chaos multiple-input multiple-output (C-MIMO) transmission scheme that achieves both physical layer security and channel coding gain using chaos signals. C-MIMO is a type of encryption modulation and it obtains the coding gain in conjunction with encryption without a decrease in the transmission efficiency. Thus, the error rate performance is improved in C-MIMO. However, decoding complexity increases exponentially with code length because of the use of maximum likelihood sequence estimation (MLSE), which restricts the code length of C-MIMO and thus the channel coding gain. Therefore, in this paper, we consider outer channel code concatenation instead of code length expansion for C-MIMO, and propose an iterative turbo decoding scheme for performance improvement by introducing a log-likelihood ratio (LLR) into C-MIMO and by utilizing turbo principle. The improved performances of the proposed scheme, compared to the conventional scheme when the outer channel codes are convolutional code and low-density parity check (LDPC) code, are shown by computer simulations.

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.

The expressions for the reset noise in capacitive-transimpedance-amplifier (CTIA) readout circuits are theoretically derived and confirmed experimentally. The contributions to the reset noise from the thermal current and amplifier noise are considered. The thermal reset noise is found to depend only on the feedback capacitance among the circuit parameters.

Due to the fact that natural images are approximately sparse in Discrete Cosine Transform (DCT) or wavelet basis, the Compressive Sensing (CS) can be employed to decode both the host image and watermark with zero error, despite not knowing the host image. In this paper, Limited-Random Sequence (LRS) matrix is utilized to implement the blind CS detection, which benefits from zero error and lower complexity. The performance in Bit Error Rate (BER) and error-free detection probability confirms the validity and efficiency of the proposed scheme.