1-17hit |
In this letter, we present a spectrally efficient multicast method which enables a transmitter to simultaneously transmit multiple multicast streams without any interference among multicast groups. By using unique combiners at receivers with multiple antennas within each multicast group, the proposed method simplifies multiple channels between the transmitter and the receivers to an equivalent channel. In addition, we establish the sufficient condition for the system configuration which should be satisfied for the channel simplification and provide a combiner design technique for the receivers. To remove interference among multicast groups, the precoder for the transmitter is designed by utilizing the equivalent channels. By exploiting time resources efficiently, the channel simplification (CS) based method achieves a higher sum rate than the time division multiplexing (TDM) based method, which the existing multicast techniques fundamentally employ, at high signal-to-noise ratio (SNR) regime. Furthermore, we present a multicast method combining the CS based method with the TDM based method to utilize the benefits of both methods. Simulation results successfully demonstrate that the combined multicast method obtains a better sum rate performance at overall SNR regime.
Suk-Hwan LEE Won-Joo HWANG Jai-Jin JUNG Ki-Ryong KWON
Detailed high capacity vector maps must be compressed effectively for transmission or storage in Web GIS (geographic information system) and mobile GIS applications. In this paper, we present a polyline compression method that consists of polyline feature-based hybrid simplification and second derivative-based data compression. The polyline hybrid simplification function detects the feature points from a polyline using DP, SF, and TF algorithms, and divides the polyline into sectors using these feature points. It then simplifies the sectors using an algorithm to determine the minimum area difference among the DP, SF, and TF results. The polyline data compression method segments the second derivatives of the simplified polylines into integer and fractional parts. The integer parts are compressed using the minimum bounding box of the layer to determine the broad position of the object. The fractional parts are compressed using hierarchical precision levels. Experimental results verify that our method has higher simplification and compression efficiency than conventional methods and produces good quality compressed maps.
Tadashi TAKANO Takehiro IMURA Midori OKUMURA
This paper describes a novel technique to replace some of the driven elements in an array antenna with parasitic elements. First, the antenna characteristics are studied by simulation for a basic unit array with one driven and two parasitic elements. The entire antenna is backed with a flat reflector to conform to practical applications. The parasitic elements are excited by the neighboring driven elements through the electromagnetic coupling effect. It is shown that at the optimal coupling condition, the radiation patterns are almost identical with those of an array antenna whose elements are all driven without coupling. The simulation result is confirmed by performing an experiment at 5.8GHz (λ =51.7mm). Finally, a 12-element array is formed by combining four unit arrays. The simulation results show that the maximum antenna gain is 19.4dBi, indicating that there is no penalty with respect to the antenna gain of a fully driven 12-element array. Therefore, the array antenna can be considerably simplified by replacing 67% of its elements with parasitic elements.
Nagao OGINO Hideyuki KOTO Hajime NAKAMURA Shigehiro ANO
As a network evolves following initial deployment, its service functions remain diversified through the openness of the network functions. This indicates that appropriate simplification of the service functions is essential if the evolving network is to achieve the required scalability of service processing and service management. While the screening of service functions is basically performed by network users and the market, several service functions will be automatically simplified based on the growth of the evolving network. This paper verifies the simplification of service functions resulting from the evolution of the network itself. First, the principles that serve as the basis for simplifying the service functions are explained using several practical examples. Next, a simulation model is proposed to verify the simplification of service functions in terms of the priority control function for path routing and load balancing among multiple paths. From the results of the simulation, this study clarifies that the anticipated simplification of service functions is actually realizable and the service performance requirements can be reduced as the network evolves after deployment. When the simplification of service functions can improve network quality, it accelerates the evolution of the network and increases the operator's revenue.
Zhenfeng SHI Xiamu NIU Liyang YU
Visual degradation is usually introduced during 3D mesh simplification. The main issue in mesh simplification is to maximize the simplification ratio while minimizing the visual degradation. Therefore, effective and objective evaluation of the visual degradation is essential in order to select the simplification ratio. Some objective geometric and subjective perceptual metrics have been proposed. However, few objective metrics have taken human visual characteristics into consideration. To evaluate the visual degradation introduced by mesh simplification for a 3D triangular object, we integrate the structural degradation with mesh saliency and propose a new objective and multi-scale evaluation metric named Global Perceptual Structural Degradation (GPSD). The proper selection of the simplification ratio under a given distance-to-viewpoint is also discussed in this paper. The accuracy and validity of the proposed metric have been demonstrated through subjective experiments. The experimental results confirm that the GPSD metric shows better 3D model-based multi-scale perceptual evaluation capability.
In multiuser multiple-input multiple-output (MU-MIMO) wireless downlink systems, block diagonalization (BD) is a technique, where the transmit precoding matrix of each user is designed such that its subspace lies in the null space of all the other remaining users, so that multiuser interference (MUI) is completely canceled. In low signal to noise power ratio (SNR) or low signal to interference plus noise power ratio (SINR) environments, regularized BD, that lets some MUI remain and maximizes the sum rate capacity of the BD MIMO channel, was also proposed. One of the problems of both the approaches is high complexity of computation due to a lot of singular value decomposition (SVD) processes. In this paper we propose new BD techniques utilizing QR decomposition (QRD) which can be practically achieved by Gram-Schmidt orthogonalization (GSO) with lower complexity compared to the conventional method employing SVD. We can show that the performance of the proposed approaches is close to the conventional approaches, while the proposed approaches have much lower complexity.
Kuo-Hsiung TSENG Tuo-Wen CHANG Ming-Fu HUNG
This study focused on three simplified models, namely (1) one set of single-phase DC-DC converter, (2) two sets of parallel connection single-phase DC-DC converter, and (3) two sets of series connection single-phase DC-DC converter. The purposes are: (1) to propose the simplification conditions and procedures for the three-phase AC-DC converter; (2) propose a set of new simplification steps for modeling, and present the examples of different three-phase AC-DC circuit topologies, detailed discussion on the simplification steps for modeling of a three-phase AC-DC converter is offered, to help people simplify and analyze the simplified model easily; (3) according to three types of simplified modeling in the three-phase AC-DC converter, this study established a useful reference for the design and analysis of the control systems of the three-phase AC-DC converter simply; (4) to acquire PWM control strategy beforehand based on PFC-Controlled property; (5) to reduce the switching loss for the PWM control strategy of the simplified model; (6) to maintain the original circuit topology and verify that the theory can extensively apply the knowledge of single-phase DC-DC converter to the simplified modeling of three-phase AC-DC converter.
In multiple-input multiple-output (MIMO) systems, the multiuser MIMO (MU-MIMO) systems have the potential to provide higher channel capacity owing to multiuser and spatial diversity. Block diagonalization (BD) is one of the techniques to realize MU-MIMO systems, where multiuser interference can be completely cancelled and therefore several users can be supported simultaneously. When the number of multiantenna users is larger than the number of simultaneously receiving users, it is necessary to select the users that maximize the system capacity. However, computation complexity becomes prohibitive, especially when the number of multiantenna users is large. Thus simplified user scheduling algorithms are necessary for reducing the complexity of computation. This paper proposes a simplified capacity-based user scheduling algorithm, based on analysis of the capacity-based user selection criterion. We find a new criterion that is simplified by using the properties of Gram-Schmidt orthogonalization (GSO). In simulation results, the proposed algorithm provides higher sum rate capacity than the conventional simplified norm-based algorithm; and when signal-to-noise power ratio (SNR) is high, it provides performance similar to that of the conventional simplified capacity-based algorithm, which still requires high complexity. Fairness of the users is also taken into account. With the proportionally fair (PF) criterion, the proposed algorithm provides better performance (sum rate capacity or fairness of the users) than the conventional algorithms. Simulation results also shows that the proposed algorithm has lower complexity of computation than the conventional algorithms.
Myeongcheol SHIN Sangheon KIM Jiwon KANG Chungyong LEE
For the closed loop multiple-input-multiple-output (MIMO) systems, Fisher's adaptive bit loading algorithm gives the best error performance by jointly optimizing the transmit powers, rates, and number of streams. However, its good performance comes at the cost of high and variable computational complexity for the joint optimization. In this letter, we propose an efficient multi-mode precoding algorithm using a simplified mode table. Numerical results show that the proposed algorithm provides almost the same performance as Fischer's with much less computational complexity.
Cheng Yong SHAO Hai Long WANG Xia Mu NIU Xiao Tong WANG
A statistic based algorithm for watermarking 2D vector maps is proposed. Instead of 2D coordinates, a one-dimensional distance sequence extracted from the original map is used as the cover data to achieve the shape-preserving ability. The statistical feature of the cover data is utilized for data embedding. Experiment results indicate the scheme's better performance in invisibility, as well as its robustness to certain attacks.
Frank NIELSEN Nicolas De MAUROY
In this paper, we first introduce the notion of texture precision given the 3d geometry of a scene. We then provide an algorithm to acquire a texture/color map of the scene within a given precision. The texture map is obtained using projective devices (like pinhole sensing device) from data acquired either in the real world or computer-synthesized. Finally, we describe a procedure to obtain level of precisions by combining a modified edge-collapse geometry technique with an appropriate remapping texture engine. We report on our experiments and give perspectives for further research.
Qiang ZHU Yusuke MATSUNAGA Shinji KIMURA Katsumasa WATANABE
Combinational logic circuits are usually implemented as multi-level networks of logic nodes. Multi-level logic simplification using the don't cares on each node is widely used. Large don't cares give good simplification results, but suffer from huge memory area and computation time. Extraction of useful don't cares and reduction of the size of the don't cares are important problems on the simplification using don't cares. In the paper, we propose a new robust heuristic method for the selection of don't cares. We consider an adaptive subnetwork for each simplified node in the network and introduce a stepwise enhancement method of the subnetwork considering the memory area and the network structure. The don't cares extracted from the adaptive subnetworks are called the local don't cares. We have implemented our method for satisfiability don't cares and observability don't cares. We have applied the method on MCNC89 benchmarks, and compared the experimental results with those of the SIS system. The results demonstrate the superiority of our method on the quality of the results and on the size of applicable circuits.
Masato TAJIMA Keiji TAKIDA Zenshiro KAWASAKI
In this paper, we state some noteworthy facts in connection with simplification of the BCJR algorithm using the bidirectional Viterbi algorithm (BIVA). That is, we clarify the necessity of metric correction in the case that the BIVA is applied to reliability estimation, where information symbols uj obey non-uniform probability distributions.
Munehiro IWAMI Masahiko SAKAI Yoshihito TOYAMA
Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The improved recursive decomposition ordering is known as the most powerful simplification ordering. Recently Jouannaud and Rubio extended the recursive path ordering to higher-order rewrite systems by introducing an ordering on type structure. In this paper we extend the improved recursive decomposition ordering for proving termination of higher-order rewrite systems. The key idea of our ordering is a new concept of pseudo-terminal occurrences.
Recently, progress has been made in the area of electrical modeling of conductors embedded in arbitrary dielectrics using circuit oriented techniques. These models usually occur in conjunction with VLSI type circuits. Many different applications exist today for such models in the EMI, EIP (Electrical Interconnect and Package) analysis as well as for the microwave circuit area. Practical problems involve a multitude of hardware components and they demand a wide spectrum of both time as well as frequency domain solution techniques. In this paper we consider circuit oriented techniques for the solution of these problems. Specifically, we give an outline of the three dimensional Partial Element Equivalent Circuit (PEEC) full wave modeling approach and review the recent progress in this area.
Shengjin WANG Makoto SATO Hiroshi KAWARADA
High-speed display of 3-D objects in virtual reality environments is one of the currently important subjects. Shape simplification is considered an efficient method. This paper presents a method of hierarchical cube-based segmentation for shape simplification and multiresolution model construction. The relations among shape simplification, resolution and visual distance are derived firstly. The first level model is generated from scattered range data by cube-base segmentation with the first level cube size. Multiresolution models are then generated by re-sampling polygonal patch vertices of each former level model with hierarchical cube-based segmentation structure. The results show that the algorithm is efficient for constructing multiresolution models of free-form shape 3-D objects from scattered range data and high compression ratio can be obtained with little noticeable difference during the visualization.
Yasushi WAKAHARA Atsushi ITO Eiji UTSUNOMIYA Fumio NITTA
The purpose of this paper is to propose a technique to simplify the communications software descriptions written in a procedural language in order to enhance their comprehensibility. Although such a technique was not much studied and discussed in the past, this technique is important to realize high productivity and high quality of the communications software by reducing the complexity of the software description. This paper firstly systematically presents various simplification methods with their principles for the descriptions of the communications software from the viewpoints of their layout, syntactical structures etc. Then, it describes a simplification support system based on these principles for the software specifications written in SDL. Lastly, this paper demonstrates the usefulness and effectiveness of the proposed simplification technique by analyzing the evaluation results of the simplification system.