We examine a concatenated code which consists of a rate 1/2, 4-state turbo code (an inner code) and a single-parity-check product code (an outer code), and discuss the decoding structure called a double concatenated decoding scheme. From our Monte Carlo simulation trials, we show the advantage of the concatenated codes over turbo codes alone. Specifically, when we use an interleaver of 4096 bits, the Eb/No to obtain a BER of 10-6 is about 1.45 dB for the concatenated code. On the other hand, it is more than 2.5 dB for the turbo code alone. So, the Eb/No improvement can be achieved by about 1 dB. This improvement in Eb/No was also obtained for the interleavers of 8192 and 2048 bits. Therefore, the concatenated codes using a double concatenated decoding scheme can solve the problem of the BER flattening in decoding of turbo codes.

In this paper, the iterative decoding of BCH product codes also called Block Turbo Codes (BTC) is evaluated for the HIPERLAN/2 OFDM system. Simulations show that expurgated BCH codes should be chosen as constituent codes in order to outperform the specified convolutional code. We also show that the bit-by-bit frequency interleaver has a big impact on the behaviour of the turbo decoding process and that increasing its size together with time diversity lead to good performance when compared to the convolutional code.

Recently, Kasahara and Murakami proposed new product-sum type public-key cryptosystems with the Chinese remainder theorem, Methods B-II and B-IV. They also proposed a new technique of selectable encryption key, which is referred to as 'Home Page Method (HP Method).' In this paper, first, we describe Methods B-II and B-IV. Second, we propose an effective attack for Method B-II and discuss the security of Methods B-II and B-IV. Third, applying the HP Method to Methods B-II and B-IV, we propose new product-sum type PKC with selectable encryption key. Moreover, we discuss the security of the proposed cryptosystems.

In this paper, a design of Programmable Logic Device (PLD) and a synthesis approach are proposed. Our PLD is derived from traditional Programmable Logic Array (PLA). The key extension is that programmable AND devices in PLA is replaced by Look-Up Tables (LUTs). A series of cascaded LUTs in the array can generate more complex terms, which we call generalized complex terms (GCTs), than product terms. In order to utilize the capability, a synthesis approach to map a given function into the array is also proposed. Our approach generates a expression of the sum of GCTs aiming to minimize the number of terms. A number of experimental results demonstrate that the number of terms for our PLD generated by our approach is 14.9% fewer than that by an existing approach. We design our PLD based on a fundamental unit named nGCT cell which can be used as LUTs in multiple sizes or random access memories. Implementation of the PLD based on a fundamental unit named nGCT cell which can be used as LUTs or random access memories is also described.

A coded modulation scheme based on a low density parity check (LDPC) code is presented. A modified sum-product algorithm suitable for the LDPC-coded modulation scheme is also devised. Several simulation results show the excellent decoding performance of the proposed coding scheme. For example, an LDPC-coded 8PSK scheme of block length 3976 symbols achieves the symbol error probability 10-5 at only 1.2 dB away from the Shannon limit of the channel.

Recently, Kasahara and Murakami proposed new product-sum public-key cryptosystems using the Chinese remainder theorem as the trapdoor. We proposed 'Yaezakura' as the high-density product-sum PKC applying the method using the reduced bases. In this paper, we propose another high-density scheme with the Chinese remainder theorem trapdoor using the message extension. We also show that the proposed scheme is invulnerable to the low-density attack. In the proposed scheme, the sender can freely select the positions of the dummy messages.

A new architecture and methods for an enhanced autonomous decentralized production system (EADPS) are described. This EADPS was developed to ensure high flexibility of production systems consisting of intelligent devices based on the autonomous decentralized system model and to guarantee the time used for communication to simultaneously maintain high productivity. The system architecture of the EADPS guarantees the time by managing groups of nodes and the priorities in these groups. A bit-arbitration method is used to prevent collision of messages. The nodes autonomously check the waveforms in the network and terminate transmission when the nodes with a higher priority are transmitting. A parallel-filtering method is used to speed up message acceptance. The nodes check the identifiers of the messages using parallel-filtering circuits and each node determines autonomously where a message should be accepted or not. Implementing the system architecture and these methods as circuits and integrating the circuits into a chip using system LSI technologies resulted in low-cost implementation of the system. Experimental evaluation demonstrated the effectiveness of this system.

The efficiency-fractional bandwidth product (EB), which is expressed as a ratio of the radiation resistance to the absolute value of the input reactance of an antenna, is used as a performance criterion for small dielectric loaded monopole antennas (DLMAs). The dependence of the EB on the permittivity of the dielectric loading (i.e., the electrical volume) is experimentally and numerically investigated for the first time in antenna research. As a result, it is found that the EBs of the some DLMAs are enhanced over a bare monopole antenna and an EB characteristic curve has a maximum point. This result suggests the presence of the optimum electrical volume for the dielectric loading in order to obtain the best EB performance. A general reason for the existence of the peak value is also explained using a mathematical deduction. Finally the system EB, which is an efficiency-fractional bandwidth product of the DLMA with a practical matching circuit, is defined and its dependence on the relative permittivity is illustrated. Consequently, the existence of the peak value is also confirmed for the system EBs. In addition, it is demonstrated that the enhancement of the system EB is mainly due to the enhancement in the efficiency of the antenna system.

It is very difficult to obtain a linearizing feedback and a coordinate transformation map, even though the system is feedback linearizable. It is known that finding a desired transformation map and feedback is equivalent to finding an integrating factor for an annihilating one-form. In this paper we develop a numerical algorithm for an integrating factor involving a set of partial differential equations and corresponding zero-form using the C.I.R method. We employ a tensor product splines as an interpolation method to data which are resulted from the numerical algorithm in order to obtain an approximate integrating factor and a zero-form in closed forms. Next, we obtain a coordinate transformation map using the approximate integrating factor and zero-form. Finally, we construct a stabilizing controller based on a linearized system with the approximate coordinate transformation.

This paper concerns resource planning in a VLSI assembly facility. The facility can process more than 100 sorts of WIPs (Works-In-Process) simultaneously. Specifically it performs product-mix production. An old resource estimation system, which gave a good estimation for a memory VLSI production facility, went wrong for an assembly facility. To adjust the estimation of required machinery resources of the assembly facility, a new parameter--the tuning value for the service time--is introduced. The tuning value expresses the reduction in machine utilization in the processing steps due to the product-mix. The value is empirically determined and the machinery resources can be estimated in good accuracy. Also the waiting time for processing in the incoming buffer is successfully considered in the estimation of turnaround time. However the tuning value is not enough in estimating human resources. A novel algorithm to estimate the resources for machine adjustments is proposed. The algorithm is based on a periodic assignment of multiple sorts of WIPs in a single machine, where the adjustments of machines for the product-mix are considered. The adjustments are additional operator's jobs in the product-mix. It estimates the operator request rate and machine utilization rate when multiple sorts of WIPs with different arrival rates are processed in a single machine. Finally, this resource estimation system considers the operator allocated not only to the preprocessing and postprocessing but also to the adjustments of machines for the product-mix. The estimated machinery, human resources, and turnaround time were evaluated in a real facility, and the proposed method is confirmed to be applicable in the weekly or monthly resource planning for the facility.

To achieve a sound field reproduction system, it is important to design multichannel inverse filters which cancel the effects of room transfer functions. The design method in the frequency domain based on the least-norm solution (LNS) requires less memory and less calculation than the design method in the time domain. However, the LNS method cannot guarantee the causality or stability of the filters. In this paper, a design method of a time-domain inverse filter using iterative processing in the frequency domain for multichannel sound field reproduction is proposed, and the result of numerical analysis is described. The proposed method can decrease the squared error of every control point by 3-12 dB. Furthermore, the sound reproduced by this method attains over 13 dB improvement in the segmental signal-noise ratio (SNR) compared with that designed by the LNS method for real environment impulse responses.

In this paper, we propose a generalized frequency assignment algorithm to minimize the intermodulation products caused by nonlinear amplification in satellite transponder. We also analyze the performance of proposed algorithms in terms of C/IM and execution time. Most of the published algorithms are too restrictive to be applied to the frequency planning of many realistic systems that are usually characterized by multi-level and/or multi-bandwidth. In developing the proposed "TDTI algorithm," we utilized and modified basic concepts of Okinaka's DELINS-INSDEL algorithm to extend its applicability from one-level systems to more general systems. We also propose a modified version of TDTI algorithm called "WTDI-SDELINS" to circumvent the problem of relatively long execution time.

This paper proposes a method of supporting behavioral decision-making with a rule-based system to be used for the design stage of service specifications or service scenarios based on a state transition model. We consider telecommunication services as service scenarios of state transitions. A state transition can be described as a transition rule that is represented as the notation of an IF-THEN rule : "if < condition > then < action >. " Thus, behaviors or service scenarios are assumed to be treated as a set of IF-THEN rules in this paper. In general, an "if < condition > then < action >" rule is called a production rule, and production rules are often used to represent knowledge in expert systems. Thus, rules treated in this paper are a kind of production rule. It is still difficult to decide if behaviors are concurrent, cooperative, or exclusive as a whole system when many service scenarios are combined, even if each rule is clearly described and easy to understand. When several service scenarios are combined, it is necessary for the sub-elements of each state transition to cooperate. The method proposed in this paper consists of the following techniques: (1) decompositions of a state transition to sub-elements, (2) rule descriptions for the decomposed sub-elements and the application of rules, (3) use of conflict and cooperation strategies, and (4) support for behavioral decision-making by showing recommendations for cooperative, exclusive, or concurrent behavior. We provide examples of telecommunication services to show the effectiveness of the proposed method in an easy-to-understand manner. We also show cooperative resolution in the interactions among several services.

The encryption and the decryption of the product-sum type public key cryptosystems can be performed extremely fast. However, when the density is low, the cryptosystem should be broken by the low-density attack. In this paper, we propose a new class of the product-sum type public key cryptosystems based on the reduced bases, which is invulnerable to the low-density attack.

This paper presents a new method that efficiently generates all of the kernels of a sum-of-products expression. Its main feature is the memorization of the kernel generation process by using a graph structure and implicit cube set representations. We also show its applications for common logic extraction. Our extraction method produces smaller circuits through several extensions than the extraction method based on two-cube divisors known as best ever.

This study presents two new bit-parallel cellular multipliers based on an irreducible all one polynomial (AOP) over the finite field GF(2m). Using the property of the AOP, this work also presents an efficient algorithm of inner-product multiplication for computing AB2 multiplications is proposed, with a structure that can simplify the time and space complexity for hardware implementations. The first structure employs the new inner-product multiplication algorithm to construct the bit-parallel cellular architecture. The designed multiplier only requires the computational delays of (m+1)(TAND+TXOR). The second proposed structure is a modification of the first structure, and it requires (m+2) TXOR delays. Moreover, the proposed multipliers can perform A2iB2j computations by shuffling the coefficients to make i and j integers. For the computing multiplication in GF(2m), the novel multipliers turn out to be efficient as they simplify architecture and accelerate computation. The two novel architectures are highly regular, simpler, and have shorter computation delays than the conventional cellular multipliers.

We discuss human collaborative discovery processes using a production system model as a cognitive simulator. We have developed an interactive production system architecture to construct the simulator. Two production systems interactively find targets in which the only experimental results are shared; each does not know the hypothesis the other system has. Through this kind of interaction, we verify whether or not the performance of two systems interactively finding targets exceeds that of two systems independently finding targets. If we confirm the superiority of collaborative discovery, we approve of emergence by the interaction. The results are: (1) generally speaking collaboration does not produces the emergence defined above, and (2) as the different degree of hypothesis testing strategies that the two system use gets larger, the benefits of interaction gradually increases.

This paper describes a new algorithm for configuring the array of adders used to add the partial products in a multiplier circuit. The new algorithm reduces not only the number of half adders in an adder tree, but also the number of operands passed to the block generating the final product in a multiplier. The arrays obtained with this algorithm are smaller than Wallace's ones and have fewer outputs than Dadda's arrays. We show some evaluation figures and preliminary simulation results of 4, 8 and 16-bit tree configurations.

A new method of sequential control has been developed in order to increase the productivity and flexibility of production systems. This advanced sequential control (ASC) method is proposed for sequential control systems based on the autonomous decentralized system (ADS) architecture. The ADS defines the system software and message formats and makes it easy to expand the number of devices and software modules. The ASC method increases productivity because it minimizes the processing and adjustment times of production lines by adjusting the starting times of production processes automatically. Experimental evaluation results of the ASC method showed that it increases the productivity of production systems. It is also applied to an actual production system and the results are reported.

In this paper, we propose a projection based design of near perfect reconstruction QMF banks. An advantage of this method is that additional design specifications are easily implemented by defining new convex sets. To apply convex projection technique, the main difficulty is how to approximate the design specifications by some closed convex sets. In this paper, introducing a notion of Magnitude Product Space where a pair of magnitude responses of analysis filters is expressed as a point, we approximate design requirements of QMF banks by multiple closed convex sets in this space. The proposed method iteratively applies a convex projection technique, Hybrid Steepest Descent Method, to find a point corresponding to the optimal analysis filters at each stage, where the closed convex sets are dynamically improved. Design examples show that the proposed design method leads to significant improvement over conventional design methods.