For point-to-point mobile visual communications, layered video has been utilized to adapt to time-varying channel capacity over noisy environments. From the perspective of the HVS (Human Visual System), it is necessary to minimize the loss of visual quality by specifically maintaining the throughput of visually important regions, objects and so on. Utilizing the prioritized bitstreams generated according to each layer, the throughput can be improved for given channel statistics. In this paper, we define the transmission gain and measure the improved performance when the throughput of ROI (Regions Of Interest) is increased relative to visually unimportant regions over a capacity limited mobile channel.

Modern processors have large instruction windows to improve performance. They usually adopt register renaming, where every active instruction with a valid destination needs a physical register. As the instruction windows get larger, however, bigger physical register files are required. To solve this problem, we proposed a physical register sharing technique. It shares a physical register among multiple instructions based on a value similarity. As a result, we achieved performance improvement without increasing the size of the physical register file. In addition, the proposed technique can also be used to reduce the timing, complexity and area overhead of the physical register file.

The transmission of duplicate packets provides a loss-resilience without undue time-delay in the video transmission over packet loss networks. However, this method generally deteriorates the problem of traffic congestion because of the increased bit-rate for duplicate packet transmission. In this paper, we propose a set of techniques for an efficient packetization and transmission of duplicate video packets. The proposed method transmits the duplicate packet containing high priority data that is quite small in volume but very important for the reconstruction of the video. This method significantly reduces the required bit-rate for duplicate transmission. An efficient packetization method is also proposed to reduce additional packet overhead which is required for transmitting the duplicate data. It is shown by simulations that the proposed method remarkably improves the packet loss-resilience for video transmission only with small increase of redundant duplicated data for each slice.

Video transcoding technique is an efficient mechanism to deliver visual contents to a variety of users who have different network conditions or terminal devices with different display capabilities. In this paper, we propose two types of transcoding methods for adapting the bitrate of streaming video to the bandwidth of the transmission channel; spatial resolution reduction (SRR) transcoding and temporal resolution reduction (TRR) transcoding. The two transcoding methods are alternatively operated according to the requirements of users. Experimental results show that the proposed transcoding methods can preserve image quality while transcoding to the low bitrate.

If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, for example, the complexity of trispectrum is O(N 4). This problem becomes even more serious when short time Fourier transform (STFT) is computed - computation of the trispectrum is required after every shift of the window. In this paper, a method to recursively compute trispectrum has been presented and it is shown that the computational complexity, for a window size of N, is reduced to be O(N 3) and is the same as the space complexity.

In this paper, we propose two techniques to solve the nonlinear constrained optimization problem in large scale mesh-interconnected system. The first one is a diagram-method-based decomposition technique which decomposes the large scale system into some small subsystems. The second technique is a projected-Jacobi-based parallel dual-type method which can solve the optimization problems in the decomposed subsystems efficiently. We have used the proposed algorithm to solve numerous examples of large scale constrained optimization problems in power system. The test results show that the proposed algorithm has computational efficiency with respect to the conventional approach of the centralized Newton method and the state-of-the-art Block-Parallel Newton method.

A network based on the Inverse Function Delayed (ID) model which can recall a temporal sequence of patterns, is proposed. The classical problem that the network is forced to make long distance jumps due to strong attractors that have to be isolated from each other, is solved by the introduction of the ID neuron. The ID neuron has negative resistance in its dynamics which makes a gradual change from one attractor to another possible. It is then shown that a network structure consisting of paired conventional and ID neurons, perfectly can recall a sequence.

This paper considers the universal coding problem for stationary ergodic sources with countably infinite alphabets. We propose modified versions of LZ77 and LZ78 codes for sources with countably infinite alphabets. Then, we show that for any source µ with Eµ[log X1]<∞, both codes are asymptotically optimum, i.e. the code length per input symbol approaches its entropy rate with probability one. Further, we show that we can modify LZ77 and LZ78 codes so that both are asymptotically optimal for a family of ergodic sources satisfying Kieffer's condition.

The family of Quasi-Additive (QA) algorithms is a natural generalization of the perceptron learning, which is a kind of on-line learning having two parameter vectors: One is an accumulation of input vectors and the other is a weight vector for prediction associated with the former by a nonlinear function. We show that the vectors have a dually-flat structure from the information-geometric point of view, and this representation makes it easier to discuss the convergence properties.

In this paper, given an integer e and n such that e|n, and a prime p, we propose a method of constructing optimal p2-ary low correlation zone (LCZ) sequence set with parameters (pn-1, pe-1, (pn -1)/(pe -1), 1) from a p-ary sequence of the same length with ideal autocorrelation. The resulting p2-ary LCZ sequence set can be viewed as the generalization of the optimal quaternary LCZ sequence set by Kim, Jang, No, and Chung in respect of the alphabet size. This generalization becomes possible due to a completely new proof comprising any prime p. Under this proof, the quaternary case can be considered as a specific example for p = 2.

Collusion-secure codes are used for digital fingerprinting and for traitor tracing. In both cases, the goal is to prevent unauthorized copying of copyrighted material, by tracing at least one guilty user when illegal copies appear. The most well-known collusion-secure code is due to Boneh and Shaw (1995/98). In this paper we improve the decoding algorithm by using soft output from the inner decoder, and we show that this permits using significantly shorter codewords.

We describe a new characteristic of soft handoff, call failure when a mobile moves from the handoff region to the normal region, and introduce the metric of region-transition failure probability to more accurately assess the performance of CDMA systems that support real-time video streaming services. This characteristic has not been considered in previous research. Simulations show that this failure must be considered since it significantly degrades system performance.

This paper proposes a 15-bit 10-MS/s pipelined ADC based on the incomplete settling principle. The traditional complete settling stage is improved to the incomplete settling structure through dividing the sampling clock of the traditional stage into two parts for discharging the sampling and feedback capacitors and completing the sampling, respectively. The proposed ADC verifies the correction and validity of optimizing ADCs' conversion speed without additional power consumption through the incomplete settling. This ADC employs scaling-down scheme to achieve low power dissipation and utilizes full-differential structure, bottom-plate-sampling, and capacitor-sharing techniques as well as bit-by-bit digital self-calibration to increase the ADC's linearity. It is processed in 0.18 µm 1P6M CMOS mixed-mode technology. Simulation results show that 82 dB SNDR and 87 dB SFDR are obtained at the sampling rate of 10 MHz with the input sine frequency of 100 kHz and the whole static power dissipation is 21.94 mW.

We consider coding for sources that output the symbols according to Poisson process from the viewpoint of real-time transmission. In order to reduce the transmission delay we avoid using input buffers. However, the lack of buffer causes overflow error. The theoretical relation between the transmission rate and the error probability is clarified. It is shown that the optimal code that minimizes the probability of error differs from the code that minimizes the expected codeword length. We also investigate the case of block coding as one of the applications of buffers.

We propose a wave analysis method for probe-fed Radial Line Planar Antennas (RLPAs) which yields an approximate solution for the aperture field distribution and scattering by loaded probes. Damping of electric power in the radial line due to radiation by antenna elements is included. The method can accommodate the effect of all conductors, including the terminating wall, by introducing the concept of equivalent posts. We have found good correspondence between the measured and calculated values of the aperture field distribution. The proposed method is effective for general geometries of probe-fed RLPAs.

This paper introduces a novel MIMO (Multiple Input Multiple Output) communication system having orthogonal dual polarization diversity branches. We have designed a dual polarized circular patch antenna which has two orthogonal polarization ports such as vertical polarization (V) and horizontal polarization (H) on its metal surface. This design makes it works as two independent antennas in multipath environments. By using two dual polarized antennas at both the transmitter and receiver, we designed a dual-polarization 44 MIMO experiment system. This system can be used to investigate the performance of various MIMO transmission methods as well as the performance of adaptive algorithms in indoor multipath environments. To investigate the performance of our experiment system, we carried out a number of MIMO transmission experiments such as space-time-coded transmission having two parallel streams and MIMO eigenmode transmission. We will show the results of those experiments and discuss the advantages of using polarization diversity in MIMO communication system for next generation broadband wireless communication.

A rigorous and simple method is proposed for analyzing guided modes of metallic electromagnetic crystal waveguides. The method is a combination of generalized reflection and transmission matrices and the mode-matching technique. Fast convergence, low computer cost, and high calculating precision are main advantages of the proposed method. This method can easily avoid the relative convergence phenomena than a classical mode-matching method, and the proposed formulation is very suitable to analyzing multilayered problems with very low computer cost. The existence of H-polarized modes in metallic electromagnetic crystal waveguides has been verified.

A test structure to separately measure sheet resistances of highly-doped-drain (HDD) and lightly-doped-drain (LDD) in LDD-type CMOSFETs with various gate spaces S having sub-100 nm sidewalls was proposed. From the reciprocal of source/drain-resistance R-1 versus S characteristics, the sheet resistance ρH of the high-conductive-region (HCR) corresponding to HDD and the approximate width WLC of the low-conductive-region (LCR) corresponding to LDD could be estimated. Both of ρH and WLC for p- and n-MOS devices were scarcely dependent on the gate voltage. The sidewall-width difference of 40 nm could be sufficiently detected by using the test structure with the S pitch of about 60 nm. The R-1 versus S characteristics showed the unstable resistance variations in the narrow S region less than 0.3 µm, which corresponded to the minimum S for the process used for the test device fabrication and suggested that various micro-loading effects seriously affected on the characteristics.

A novel structure for a frequency-independent steerable composite right/left-handed (CRLH) leaky wave (LW) antenna in the millimeter-wave band is proposed. This has the advantages of wide beam scanning and low profile, and is a suitable structure for mass-production. The proposed antenna has features wherein a movable dielectric slab is placed above the CRLH LW antenna, and the radiation angle can be steered by changing the distance between the slab and the antenna using compact actuators. Moreover, slots are added to the antenna to control the aperture amplitude distribution of the array antenna in order to enhance aperture efficiency. A prototype CRLH LW antenna has been fabricated with these slots, and backward-to-forward beam scanning characteristics at 76 GHz have been demonstrated successfully by measurement. A wide scanning angle from 73 to 114 deg. has been achieved experimentally. The aperture efficiency is 25.3%.

A compact open-loop resonator bandpass filter is presented to suppress the spurious passband using compensated compact microstrip resonant cell (C-CMRC) feeding structure. Based on the inherently compact and stopband characteristics of the C-CMRC feeding, the proposed filters shows a better spurious rejection performance than the only open-loop resonator filter. The suppression is -57.4 dB, -49.5 dB, and -43.9 dB at the 2nd, 3rd and 4th harmonic signal separately. All the performance of proposed filters have been verified by the measured results.