Makoto SUGIHARA Kenta NAKAMURA Yusuke MATSUNAGA Kazuaki MURAKAMI
The character projection (CP) lithography is utilized for maskless lithography and is a potential for the future photomask fabrication. The drawback of the CP lithography is its low throughput and leads to a price rise of IC devices. This paper discusses a technology mapping technique for enhancing the throughput of the CP lithography. The number of electron beam (EB) shots to project an entire chip directly determines the fabrication time for the chip as well as the throughput of CP equipment. Our technology mapping technique maps EB shot count-effective cells to a circuit in order to increase the throughput of CP equipment. Our technique treats the number of EB shots as an objective to minimize. Comparing with a conventional technology mapping, our technology mapping technique has achieved 26.6% reduction of the number of EB shots for the front-end-of-the-line (FEOL) process without any performance degradation of ICs. Moreover, our technology mapping technique has achieved a 54.6% less number of EB shots under no performance constraints. It is easy for both IC designers and equipment developers to adopt our technique because our technique is a software approach with no additional modification on CP equipment.
Geographic distributed hash table (DHT) protocols are considered to be efficient for P2P object sharing in mobile ad-hoc networks. These protocols assume that the set of
In recent years, digital watermarking has become a popular technique for hiding information in digital images to help protect against copyright infringement. In this paper we develop a high quality and robust watermarking algorithm that combines the advantages of block-based permutation with that of neighboring coefficient embedding. The proposed approach uses the relationship between the coefficients of neighboring blocks to hide more information into high frequency blocks without causing serious distortion to the watermarked image. In addition, an extraction method for improving robustness to mid-frequency filter attacks is proposed. Our experimental results show that the proposed approach is very effective in achieving perceptual imperceptibility. Moreover, the proposed approach is robust to a variety of signal processing operations, such as compression (JPEG), image cropping, sharpening, blurring, and brightness adjustments. The robustness is especially evident under blurring attack.
An electrooptic near-field mapping system based on a gain-switched distributed feedback (DFB) pulsed laser and a CdTe electrooptic crystal was used for characterizing stationary and transient near-field patterns of conventional and uniplanar compact photonic band gap (UC-PBG) patch antennas. Effect of the UC-PBG structure on reduction in surface waves in the UC-PBG patch antenna was experimentally verified by comparing stationary and transient near-field measurement of the conventional and UC-PBG patch antennas.
Debatosh DEBNATH Tsutomu SASAO
This paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR): two functions have the same NPR if one can be obtained from the other by a permutation and/or complementation(s) of the variables. By using a table look-up and a tree-based breadth-first search strategy, our method quickly computes the NPR for a given function. Boolean matching of the given function against the whole library is determined by checking the presence of its NPR in a hash table, which stores NPRs for all the library functions and their complements. The effectiveness of our method is demonstrated through experimental results, which show that it is more than two orders of magnitude faster than the Hinsberger-Kolla's algorithm.
Let A(n, d, w) denote the maximum possible number of code words in binary (n,d,w) constant weight codes. For smaller instances of (n, d, w)s, many improvements have occurred over the decades. However, unknown instances still remain for larger (n, d, w)s (for example, those of n > 30 and d > 10). In this paper, we propose a new class of binary constant weight codes that fill in the remaining blank instances of (n, d, w)s. Specifically, we establish several new non-trivial lower bounds such as 336 for A(64, 12, 8), etc. (listed in Table 2). To obtain these results, we have developed a new systematic technique for construction by means of groups acting on some sets. The new technique is performed by considering a triad (G, Ω, f) := ("Group G," "Set Ω," "Action f on Ω") simultaneously. Our results described in Sect. 3 are obtained by using permutations of the elements of a set that include ∞ homogeneously like the other elements, which play a role to improve their randomness. Specifically, in our examples, we adopt the following model such as (PGL2(Fq), P1(Fq), "linear fractional action of subgroups of PGL2(Fq) on P1(Fq)") as a typical construction model. Moreover, as an application, the essential examples in [7] constructed by using an alternating group are again reconstructed with our new technique of a triad model, after which they are all systematically understood in the context of finite subgroups that act fractionally on a projective space over a finite field.
Hyung Yun KONG Ho Van KHUONG Doo-Hee NAM
AOC-SS (Advanced Orthogonal Code Spread Spectrum) modulation [1] is a flexible scheme that offers multi-rate transmission but causes a PAPR (Peak-to-Average Power Ratio) increase in proportion to the number of AOCs. Our solution to this problem is a new mapping technique. In addition, by combining with STC (Space-Time Coding), AOC-SS can resist multi-path fading. Computer simulations validate the proposed scheme.
This paper studies bit-interleaved coded modulation with iterative decoding (BICM-ID) systems that employ multi-dimensional mappings of M-ary constellations to improve the error performance over Rayleigh fading channels. Based on the analytical evaluations of the asymptotic bit error probability (BEP), the distance criteria for the mapping designs can be obtained. A binary switching algorithm (BSA) is then applied to find the optimal mappings with respect to the asymptotic performance. Simulation and analytical results show that the use of multi-dimensional mappings of M-ary constellations can significantly improve the error performance.
This paper proposes a simple and efficient method to numerically obtain the mapping degree deg(f, 0, B) of a C1 map f : Rn → Rn at a regular value 0 relative to a bounded open subset B ⊂ Rn. For practical application, this method adopts Aberth's algorithm which does not require computation of derivatives and determinants, and reduces the computational cost with two additional procedures, namely preconditioning using the coordinate transformation and pruning using Krawczyk's method. Numerical examples show that the proposed method gives the mapping degree with 2n+1 operations using interval arithmetic.
Yang Chan CHO Seung Hee HAN Jae Hong LEE
High peak-to-average power ratio (PAPR) of the transmit signal is a major drawback of orthogonal frequency division multiplexing (OFDM). Selected mapping (SLM) technique is an efficient PAPR reduction technique for OFDM. In the SLM technique, many data blocks are generated from an OFDM data block using a set of phase sequences, and then the one with the lowest PAPR is chosen and transmitted. In this paper, an SLM technique with magnitude extension is proposed. In the proposed SLM technique, it is not needed to transmit side information from transmitter to receiver. The proposed technique achieves significant reduction in PAPR with only a small increase in transmit signal power.
Gooyoun HWANG Jitae SHIN JongWon KIM
This paper introduces a network-aware video delivery framework where the quality-of-service (QoS) interaction between prioritized packet video and relative differentiated service (DiffServ) network is taken into account. With this framework, we propose a dynamic class mapping (DCM) scheme to allow video applications to cope with service degradation and class-based resource constraint in a time-varying network environment. In the proposed scheme, an explicit congestion notification (ECN)-based feedback mechanism is utilized to notify the status of network classes and the received service quality assessment to the end-host applications urgently. Based on the feedback information, DCM agent at ingress point can dynamically re-map each packet onto a network class in order to satisfy the desired QoS requirement. Simulation results verify the enhanced QoS performance of the streaming video application by comparing the static class-mapping and the class re-mapping based on loss-driven feedback.
Dai-boong LEE Hwangjun SONG Inkyu LEE
Differentiated-services model has been prevailed as a scalable solution to provide quality of service over the Internet. Many researches have been focused on per hop behavior or a single domain behavior to enhance quality of service. Thus, there are still difficulties in providing the end-to-end guaranteed service when the path between sender and receiver includes multiple domains. Furthermore differentiated-services model mainly considers quality of service for traffic aggregates due to the scalability, and the quality of service state may be time varying according to the network conditions in the case of relative service model, which make the problem more challenging to guarantee the end-to-end quality-of-service. In this paper, we study class mapping mechanisms along the path to provide the end-to-end guaranteed quality of service with the minimum networking price over multiple differentiated-services domains. The proposed mechanism includes an effective implementation of relative differentiated-services model, quality of service advertising mechanism and class selecting mechanisms. Finally, the experimental results are provided to show the performance of the proposed algorithm.
Shinichiro HIROOKA Hideo SAITO
In this paper, we propose a novel virtual display system for a real object surface by using a video projector, so that the viewer can feel as if digital images are printed on the real surface with arbitrary shape. This system consists of an uncalibrated camera and video projector connected to a same PC and creates a virtual object by rendering 2D contents preserved beforehand onto a white object in a real world via a projector. For geometry registration between the rendered image and the object surface correctly, we regard the object surface as a set of a number of small rectangular regions and perform geometry registration by calculating homographies between the projector image plane and the each divided regions. By using such a homography-based method, we can avoid calibration of a camera and a projector that is necessary in a conventional method. In this system, we perform following two processes. First of all, we acquire the status of the object surface from images which capture the scene that color-coded checker patterns are projected on it and generate image rendered on it without distortion by calculating homographies. After once the projection image is generated, the rendered image can be updated if the object surface moves, or refined when it is stationary by observing the object surface. By this second process, the system always offers more accurate display. In implementation, we demonstrate our system in various conditions. This system enables it to project them as if it is printed on a real paper surface of a book. By using this system, we expect the realization of a virtual museum or other industrial application.
In this paper, we shall construct mathematical theory based on the concept of set-valued mappings, suitable for available operation of extraordinarily complicated large-scale network systems by introducing some connected-block structures. A fine estimation technique for availability of system behaviors of such network systems are obtained finally in the form of fixed point theorem for a special system of fuzzy-set-valued mappings.
It is known that in a bit-interleaved coded-modulation with iterative decoding (BICM-ID), signal constellation and mapping strongly influence the system's error performance. This letter presents good mappings of various 8-ary constellations for BICM-ID systems operating over a frequency non-selective block Rayleigh fading channel. Simulation results for the error performance of different constellations/mappings are also provided and discussed.
Yan LIU Dong ZHENG Jiying ZHAO
This letter presents an image rectification scheme that can be used by any image watermarking algorithms to provide robustness against rotation, scaling and translation (RST) transformations.
Takaharu HIRAOKA Yoshiaki NEISHI Tetsuo ANADA Jui-Pang HSU
A detailed investigation of the electromagnetic field distributions in high frequency printed circuits and high-speed interconnects is very useful for physical understanding, studies of electromagnetic coupling effects for EMC and EMI and for optimization of electromagnetic circuit designs. The aim of this paper is to show how to measure the electric field distributions in electromagnetic circuits. An electromagnetic analysis for microstrip-line circuits is carried out by using a finite-difference time domain technique and its measurement is carried out by using a small probe antenna. The measurement results are in fairly good agreement with those of the numerical analysis using the FDTD method. Thus, the measurement system offers a valid means for predictions in the theoretical analysis of more complicated discontinuity problems.
Debatosh DEBNATH Tsutomu SASAO
Checking the equivalence of two Boolean functions under permutation of the variables is an important problem in the synthesis of multiplexer-based field-programmable gate arrays (FPGAs), and the problem is known as Boolean matching. This paper presents an efficient breadth-first search technique for computing a canonical form--namely P-representative--of Boolean functions under permutation of the variables. Two functions match if they have the same P-representative. On an ordinary workstation, on the average, the method requires several microseconds to check the Boolean matching of functions with up to eight variables against a library with tens of thousands of cells.
Ick Hoon JANG Sang Hyun KIM Nam Chul KIM
In this paper, we propose a fast fractal image coding based on LMSE (least mean square error) analysis and subblock feature. The proposed method focuses on efficient search of contrast scaling, position of its matched domain block, and isometric transform for a range block. The contrast scaling and the domain block position are searched using a cost function that comes from the LMSE analysis of the range block and its fractal-approximated block. The isometric transform is searched using 2 2 blocks formed with the averages of subblocks of range block and domain block. Experimental results show that the encoding time of a conventional fractal image coding with our search method is 25.6-39.7 times faster than that with full search method at the same bit rate while giving PSNR decrement of 0.2-0.7 dB with negligible deterioration in subjective quality. It is also shown that the encoding time of a conventional fractal image coding with our search method is 3.4-4.2 times faster than Jacquin's fractal image coding and is superior by maximum 0.8 dB in PSNR. It also yields reconstructed images of better quality.
Let us introduce n ( 2) nonlinear mappings fi (i = 1,2,,n) defined on complete linear metric spaces (Xi-1,ρ) (i = 1,2,,n), respectively, and let fi:Xi-1 Xi be completely continuous on bounded convex closed subsets Xi-1, (i = 1,2,,n 0), such that fi() . Moreover, let us introduce n fuzzy-set-valued nonlinear mappings Fi:Xi-1Xi {a family of all non-empty closed compact fuzzy subsets of Xi}. Here, by introducing arbitrary constant βi (0,1], for every integer i (i = 1,2,,n 0), separately, we have a fixed point theorem on the recurrent system of βi -level fuzzy-set-valued mapping equations: xi Fiβi(xi-1, fi(xi-1)), (i = 1,2,,n 0), where the fuzzy set Fi is characterized by a membership function µFi(xi):Xi [0,1], and the βi -level set Fiβi of the fuzzy set Fi is defined as Fiβi {ξi Xi |µFi (ξi) βi}, for any constant βi (0,1]. This theorem can be applied immediately to discussion for characteristics of ring nonlinear network systems disturbed by undesirable uncertain fluctuations and to extremely fine estimation of available behaviors of those disturbed systems. In this paper, its mathematical situation and proof are discussed, in detail.