Kazushi TANIHIRA Hiromi KOBAYASHI
This paper presents properties of role-based access control which were obtained through a development of a prototype of a teaching management system. These properties are related to assignment of temporal constraints and access control procedure in terms of the corresponding flow of user's view and considered to be suitable to other information systems.
We research on an importance sampling (IS) simulation to estimate a low error probability of turbo codes. The simulation time reduction in IS depends on another probability density function (p.d.f.) called simulation p.d.f. The previous IS simulation method can not evaluate the error probability on the low SNR and waterfall region. We derive the optimal simulation p.d.f. which gives the perfect estimator. A new simulation p.d.f. design, which is related to the optimal one, is proposed to overcome the problem of the previous IS method. The proposed IS simulation can evaluate all possible error patterns. Finally, some computer simulations show that the proposed method can evaluate the error probability on the low SNR, waterfall, and error floor regions. At the evaluation of the BER of 10-7, the simulation time of the proposed method is about 1/350 times as short as that of the Monte-Carlo simulation. When the BER is less than 710-8, the proposed method requires shorter simulation time than the conventional IS method.
We define discretized Markov transformations and find an algorithm to give the number of maximal-period sequences based on discretized Markov transformations. In this report, we focus on the discretized dyadic transformations and the discretized golden mean transformations. Then we find an algorithm to give the number of maximal-period sequences based on these discretized transformations. Moreover, we define a number-theoretic function related to the numbers of maximal-period sequences based on these discretized transformations. We also introduce the entropy of the maximal-period sequences based on these discretized transformations.
Koichi TANNO Kiminobu SATO Hisashi TANAKA Okihiko ISHIZUKA
In this letter, we propose a sample and hold circuit (S/H circuit) with the clock boost technique and the input signal tracking technique. The proposed circuit block generates the clock with the amplitude of VDD + vin, and the clock is used to control the MOS switch. By applying this circuit to a S/H circuit, we can deal with the rail-to-rail signal with maintaining low distortion. Furthermore, the hold error caused by the charge injection and the clock feedthrough can be also reduced by using the dummy switch. The Star-HSPICE simulation results are reported in this letter.
Chih-Hsien LIN Chang-Hsiao TSAI Chih-Ning CHEN Shyh-Jye JOU
In this paper, a multi-Gbps pre-emphasis design methodology and circuits for a 4/2 Pulse Amplitude Modulation (PAM) transmitter of high-speed data serial link over cable are proposed. Theoretically analysis of the total frequency response including pre-emphasis, package, cable loss and termination are first carried out. In order to gain higher data rates without increasing of symbol rate, we use 4 PAM in our system. Then, we propose a pre-emphasis architecture and algorithm that can enlarge the high frequency response so the overall frequency response in the receiver side is uniform within the desired frequency range. The overall circuit is implemented in TSMC 0.18 µm 1P6M 1.8 V CMOS process. A test chip of this transmitter with pre-emphasis, PLL circuit and on-chip termination resistors is implemented by full custom flow to verify the design methodology. The measurement results of 10/5 Gbps (4/2 PAM) are carried out over 5 meter (m) long cable and is in agreement with our analysis and simulation results.
Kenichi KANATANI Yasuyuki SUGAYA
We analyze the noise sensitivity of the focal length computation, the principal point estimation, and the orthogonality enforcement for single-view 3-D reconstruction based on vanishing points and orthogonality. We point out that due to the nonlinearity of the problem the standard statistical optimization is not very effective. We present a practical compromise for avoiding the computational failure and preserving high accuracy, allowing a consistent 3-D shape in the presence of however large noise.
Tsukasa IDA Shinsaku SHIMIZU Toshimasa MATSUOKA Kenji TANIGUCHI
Wired CDMA interface with adaptivity for interconnect capacitances is designed to receive transmitted data even under a wide variety of connection topologies. The variable gain amplifier (VGA) is one of key circuit blocks to realize the adaptivity for interconnect capacitances. The system level numerical simulations derive the VGA specifications that the required VGA gain range is from 0.37 to 2.0, which can be realized easily using a multiple-differential-pair technique.
Jaewon LEE Seong-Min HONG Hyunsoo YOON
The mobile agent paradigm is a promising technology to structure distributed applications. Since mobile agents physically move to a remote host that is under the control of a different principal, they need to be protected from this environment which is responsible for execution. In this paper, we provide a new cryptographic methodology of protecting mobile agents from unauthorized modification for the program code by malicious hosts.
YoungBae JANG SeungRyoul MAENG JungWan CHO
An active network has the advantage of being able to accept new protocols quickly and easily. The cluster-based active router can provide sufficient computing power for customized computations. In the router architecture, load balancing is achieved by the efficient distribution of packets. We present a packet distribution scheme according to estimated processing time.
In contention-based wireless ad hoc networks, power control is an efficient way to improve the spatial reuse by allowing multiple pairs to communicate simultaneously. In this paper, we propose a game-theoretical approach for joint power and rate control in ad hoc networks, where the transmit rate of each link is maximized. Meanwhile we consider the transmit power as the cost, since higher power leads to higher interference and more energy consumption. In particular, we introduce a novel auction-like pricing algorithm in which the cost per unit power steps up until the network settles down at a Nash equilibrium, which is a feasible power and rate allocation, even when the Signal to Interference and Noise Ratio (SINR) requirements are initially infeasible. Numerical results show significant throughput improvement and energy consumption savings compared with the previously proposed algorithm that defers the link with minimum SINR.
A single chip analog and class D switching mixed mode audio power amplifier using 0.35 µm CMOS process is presented in this paper. It has on-chip power MOSFET's and adopts a novel reverse recovery current free gate control that can reduce EMI noise and current stress of the power MOSFET's. It shows about 0.1% THD at 1 kHz and up to 87% efficiency at 4 Ω BTL at 3.3 V single power supply.
The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. The k-error linear complexity of periodic sequences is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. For 2pn-periodic binary sequences, where p is an odd prime and 2 is a primitive root modulo p2, we present and prove the unique expression of the linear complexity. Moreover we show a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
Masato KITAKAMI Satoshi NAKAMURA
Although data compression is popularly used, compressed data have a problem that they are very sensitive to errors. This paper proposes a single burst error recovery method for Huffman coding by using the bidirectionally decodable Huffman coding. Computer simulation shows that the proposed method can recover 2.5lburst bits burst error with high probability, where lburst is the maximum length of burst errors which the proposed method is expected to be able to recover.
Sangwon KANG Yongwon SHIN Changyong SON Thomas R. FISCHER
A fast encoding technique is described for vector quantization (VQ) of line spectral frequency parameters. A reduction in VQ encoding complexity is achieved by using a preliminary test that reduces the necessary codebook search range. The test is performed based on two criteria. One criterion uses the distance between a specific single element of the input vector and the corresponding element of the codevectors in the codebook. The other criterion makes use of the ordering property of LSF parameters. The fast encoding technique is implemented in the enhanced variable rate codec (EVRC) encoding algorithm. Simulation results show that the average searching range of the codebook can be reduced by 44.50% for the EVRC without degradation of spectral distortion (SD).
We investigate the impact of symbol rate control, modulation level control, and the number of hops on the area spectral efficiency of interference-limited multihop radio networks. By controlling symbol rate and modulation level, data rate can be adapted according to received power. In addition, varying the number of hops can control received power. First, we evaluate the achievable end-to-end throughput of multihop transmission assuming symbol rate and modulation level control. Numerical results reveal that by controlling symbol rate or using multihop transmission, the end-to-end communication range can be extended at the cost of end-to-end throughput, and this may result in lower area spectral efficiency. Next, an expression for the area spectral efficiency of multihop radio networks is derived as a function of the number of hops and the end-to-end throughput. Numerical results also reveal that the resulting area spectral efficiency depends on the specific circumstances, which, however, can be increased only by using multihop transmission.
A method of evaluating the wavelength filter spectrum response is introduced. The increase of the crosstalk level due to the filtering and the relation between the total crosstalk and the spectral efficiency are derived in detail using the Gaussian filter. Since this method can be applied to various kinds of filter spectrum responses, the ultimate spectral efficiencies of filters are compared. In this comparison, the problem of the box-like filter, which has been considered to be desirable, is revealed, and this is improved by cascading the filter spectrum. The requirement on the rejection floor that inheres in the filter is also made clear.
This paper proposes the MultiPath streaming scheme with Media Synchronization control (MPMS) for audio-video transmission in wireless ad hoc networks. In many audio-video streaming applications, media compensate each other from a perceptual point of view. On the basis of this property, we treat the two streams as separate transport streams, and then the source transmits them into two different routes if multiple routes to the destination are available. The multipath transmission disturbs the temporal structure of the streams; in MPMS, the disturbance is remedied by media synchronization control. In order to implement MPMS in this paper, we enhance the existing Dynamic Source Routing (DSR) protocol. We compare the application-level QoS of MPMS and three other schemes for audio-video transmission by simulation with ns-2. In the simulation, we also assess the influence of the multipath transmission on other traffic. The simulation result shows that MPMS is effective in achieving high QoS at the application-level.
Chai-Keong TOH Petri MAHONEN Mikko UUSITALO
In this paper, we provide various perspectives related to wireless sensor and mobile ad hoc networking research. We reveal their commonalities and differences and suggest the need for participation from the computer science community, in addition to communications and protocols. In particular, we reveal the various issues that demand deeper investigation, collaborative research, and standardization. We introduced the aim, structure, objectives, and goals of the World Wireless Research Forum (WWRF) and highlight the activities conducted by the WWRF Working Group 3. Finally, we discuss the status of various standardization efforts and present new research issues and challenges.
Dong-Wan TCHA Soon-Ho LEE Go-Whan JIN
For a CDMA system with a single carrier, we consider a call control policy at each cell, which gives priority to handoff calls over new calls while meeting the overall call quality. New calls are first under the call control of the threshold type, and then receive services together with the handoff calls but under the outage restriction guaranteeing a pre-specified call quality. An optimization model with such quality-guaranteeing constraints is formulated, which is to determine the threshold value for each cell, minimizing the new call blocking probability. We propose a solution heuristic, with which a number of simulations are conducted under a variety of traffic environments. The computational experiments evaluate the usefulness of our call control scheme in that handoff calls are given an appropriate level of priority while the system capacity is effectively utilized.
Ji-Bum KIM Kyung-Ho SOHN Chung-Ha KOH Young-Yong KIM
In this letter, we propose an efficient transmission slot selection scheme for Band Division Multi-Carrier-CDMA (BD-MC-CDMA) systems under the constraints of packet loss and delay bound for each individual session. By utilizing channel dynamics together with the delay deadline and loss history, one can determine whether to transmit or not during each time slot, based on the prediction of future channel variations. To validate the efficiency of the proposed algorithm, we model each sub-band as a discrete time Markov Chain using a finite state Markov channel (FSMC) and derive the criteria required for transmission decision. Simulation results show that our proposed scheme can satisfy quality of service (QoS) requirements for real-time traffic with minimum use of resources, while increasing throughput of non-real-time traffic with the resources saved from real-time traffic.