The theory of the method of moments (MoM), which has been widely used as a numerical technique for analyzing the characteristics of antennas and scatterers, is described. First, the steps of MoM to solve integral equations for conducting wires and planes are presented. It is pointed out that MoM combined with Galerkin's method yields highly accurate results. The importance of ensuring the continuity condition of current on conducting bodies is emphasized and numerical examples for a conducting structure involving junctions of wire segments and planar segments are presented. Finally, MoM for dielectric scatterers including recent developments is described.

The finite difference time domain (FDTD) method has been developed in tandem with the progress of computer technology since K. S. Yee applied it to the analysis of an electromagnetic problem in 1966. The FDTD method is widely recognized as a powerful computational tool for analyzing electromagnetic problems involving complex geometries, such as antennas, microwave and optical waveguides and interaction between antennas and the human body. The commercial electromagnetic simulators based on the FDTD are also being developed very actively because users are able to trace temporal electromagnetic behaviors and to easily obtain a practical level of accuracy. However, the user must understand the principle of the method in order to use the simulator efficiently. In this paper, the basic concept and the principle of the FDTD method are reviewed for beginners, including graduate course students, rather than specialists in this discipline. Several recent topics concerning electromagnetic and antenna problems are also introduced.

This paper reviews the approximation principle of Physical Optics in view of diffraction theory. Two key error factors are identified for PO, that is, 1) errors in edge diffraction coefficients and 2) fictitious penetrating rays. Improved methods named PO-AF and PTD-AF are proposed as the methods which suppress the fictitious penetrating rays from PO and PTD respectively. In deep shadow regions of the reflector antennas, PO-AF and PDT-AF approach to PO-EEC and UTD respectively, while the continuity is assured. The effectiveness is numerically demonstrated for two dimensional scatterers.

In this paper, we present the classification of small antennas based on statistical data. The three categories of downsizing methods are loading a matching circuit, changing the current path, and using dielectric/magnetic materials. These categories are explained using several examples. In this paper, we show that the miminum Q value as a fundamental limit defined by an infinitesimal dipole is effective for determining the index factor of small antennas. Radiation efficiency measurements for small antennas are also discussed.

Broadening the frequency bandwidth of antennas has been one of the major subjects concerning antenna design technologies. Two of the major subjects for microstrip antennas, which appeared in the 1970s, have also been the broadening of the frequency bandwidth and the sharing of multifrequency bands. In this paper, we describe the broadband and multiband techniques of printed antennas, and show the configurations of realized broadband and multiband antennas and their characteristics. Here, resonant-type microstrip antennas, planar monopole antennas, fractal antennas and ultra-wideband printed antennas are introduced. The optimum design techniques using a genetic algorithm are introduced for developing broadband and multiband printed antennas. The usefulness of this method is verified by the simulation and experimental results of the fabricated planar monopole antenna which has ultrawide-band characteristics.

To understand radio propagation structures and consider signal recovering techniques in mobile communications, it is most effective to estimate the signal parameters (e.g., DOA) of individual incoming waves. Also, in radar systems, it is required to discriminate the desired signal from interference. As one of the high-resolution DOA estimators, MUSIC and ESPRIT have attracted considerable attention in recent years. They need the eigenvectors of the correlation matrix and therefore we have to execute the EVD (eigenvalue decomposition) of correlation matrix. However, the EVD generally brings us a heavy computational load and as a result it is difficult to realize the real-time DOA estimator, which will be useful as a multibeam-forming algorithm for adaptive antennas. This paper focuses on MUSIC and ESPRIT using subspace tracking methods, such as BiSVD, PAST, and PASTd, to carry out iterative DOA estimation. Then, they are compared through computer simulation. Adaptive beamforming based on DCMP and MLM is also mentioned and an example is shown.

This paper provides an overview of research in channel modeling for multiple-input multiple-output (MIMO) data transmission focusing on a radio wave propagation. A MIMO channel is expressed as an equivalent circuit with a limited number of eigenpaths according to the singular-value decomposition (SVD). Each eigenpath amplitude depends on the propagation structure not only of the path direction profiles for both transmission and reception points but also of intermediate regions. Inherent in adaptive control is the problem of instability as a hidden difficulty. In this paper these issues are addressed and research topics on MIMO from a radio wave propagation viewpoint are identified.

Currently, space division multiplexing (SDM), where individual data streams are transmitted from different antennas simultaneously, is expected to be a promising technology for achieving a high data rate within a limited frequency band in a multiple-input multiple-output channel. In this paper, transmitter and receiver architectures of SDM applications are described, and performance improvement with the increase of data streams is shown referring to results of computer simulations. In addition, channel coded systems are also evaluated.

Japanese terrestrial digital broadcasting (ISDB-T) began in 2003. To spread its signals throughout the country, optical fibers will be used to complement radio-wave networks. This paper describes recent applications of optical transmission of ISDB-T. It also describes our research on re-transmission with 40-GHz Radio On Fiber technology.

Optical Burst Switching (OBS) aims to provide higher utilization and greater flexibility at a lower cost and reduced complexity than current optical circuit switched networks. We introduce a new routing protocol for Optical Burst Switching, Shortest Path Prioritized Random Deflection Routing (SP-PRDR), that aims to lower burst loss probabilities while only using limited state information from traditional Internet Protocol technologies. We show, through analysis and simulation, that loss in OBS networks is significantly reduced by SP-PRDR for loads that previously gave moderate or low losses in the unmodified case. In the simulation examples studied, by using SP-PRDR we are able to increase the input load by approximately 15-20% while maintaining a constant burst loss probability of 10^-3. Additionally, unlike other schemes, we show that the worst case burst loss probability of SP-PRDR is provably upper-bounded by the burst loss probability of standard OBS.

Network survivability is one of the most pivotal issues in optical WDM networks. In particular, if a conduit is cut, approximately 16 terabits per millisecond can be lost in recent technology. A huge loss even by a single conduit failure fatally damages the performance and operation of the whole network. In this paper, we propose a new heuristic algorithm, called the Generalized Minimum-Cost (GMC) selection algorithm, to choose a pair of working and backup path which firstly minimizes total number of required wavelengths of working and backup path and secondly distributes lightpath request traffic into whole network links, if there are several pairs to require the same number of minimum wavelengths, in order to achieve load-balancing effect. GMC selection algorithm contains several formulas to get Working and Backup path Reservation Cost (WBRC) which can be obtained through heuristic GMC function. By using WBRC, our GMC selection algorithm achieves superior performance compared to the current Combined Min-Cost (CMC) selection algorithm and random selection algorithm in terms of the amount of wavelength consumption and blocked lightpath requests, especially on the relatively less-connected New Jersey LATA and 28-node US networks. Furthermore, we suggest a maximum number of non-blocked lightpath requests against single link failure in simulated networks for network operators to consider acceptable maximum traffic on their networks, so that they can provide 100% restoration capability in a single link failure without lightpath request blocking. We also analyze the complexity of the GMC selection algorithm and verify that the complexity of the GMC selection algorithm is lower than that of the CMC selection algorithm if the number of lightpath requests is sufficiently large.

A novel optical header extraction scheme based on optical differential phase shift keying--DPSK--decoding is examined analytically and experimentally. The header is applied in front of the payload, on the phase of a pulsed optical level introduced for the duration of the header. The proposed scheme offers maximized header extraction efficiency, required by the electronics to identify the header bits and control the switch. At the same time, the payload is transmitted at maximum extinction ratio. Analytical results prove the enhanced performance of the decoding scheme with respect to the extinction ratio and in comparison to other DPSK based schemes. Moreover, the utilised scheme is cost efficient and easily upgradeable to any bit rates and adds minimum complexity at the transmitter and detector parts of the system. Finally, the implementation of the developed technique in a real optical packet switch is demonstrated, where header extraction, reading, processing and switch control using field programmable gate array--FPGA--technology is successfully demonstrated.

In this paper, we propose a heuristic multicast routing algorithm, which minimizes the cost while satisfying both the wavelength required and hop length selection. The algorithm consists of two subproblems: the wavelength assignment & the routing path selection. For solving the wavelength assignment subproblem, an auxiliary graph is created where by the nodes and the links in the original network are transformed to the edges and the vertices, respectively, and the same availability wavelength of each edge is taken into a multicast group. Furthermore, for solving the routing path selection subproblem, the shortest-path routing strategy is adopted to choose transmission path between two multicast groups. Simulation results show that our algorithm performs much better than previously proposed algorithms with increasing call-connection probability by 28% and reducing the blocking probability by 52%.

In the next-generation networks, ultra high-speed data transmission will become necessary to support a variety of advanced point-to-point and multipoint multimedia services with stringent quality-of-service (QoS) constraints. Such a requirement desires the realization of optical WDM networks. Researches on multicast in optical WDM networks have become active for the purpose of efficient use of wavelength resources. Since multiple channels are more likely to share the same links in WDM multicast, effective routing and wavelength assignment (RWA) technology becomes very important. The introduction of the wavelength conversion technology leads to more efficient use of wavelength resources. This technology, however, has problems to be solved, and the number of wavelength converters will be restricted in the network. In this paper, we propose an effective WDM multicast design method on condition that wavelength converters on each switching node are restricted, which consists of three separate steps: routing, wavelength converter allocation, and wavelength assignment. In our proposal, preferentially available waveband is classified according to the scale of multicast group. Assuming that the number of wavelength converters on each switching node is limited, we evaluate its performance from a viewpoint of the call blocking probability.

In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.

In this paper, a cycle-based network recovery method for optical mesh networks is studied. The study in this paper concentrates on improving two performance requirements on network recovery: efficient spare resource utilization, and robustness for multiple failures. The proposed method uses multiple ring-covers and performs distributed link restoration using preplanned logical cycles embedded in physical mesh topologies. This method provides fast and simple recovery operation by exploiting the characteristics of ring topology and also provides efficient resource utilization by using multiple backup paths per link to improve the sharability of overall spare resources in the networks. With this method, layered reliability can be provided to network services by enabling priority-based robustness against multiple failures. The performance results reveal the trade-off between the resource efficiency for single failure and the robustness for multiple failures, and show the preconfiguration of a few logical cycles per link can provide enhanced resource efficiency and priority-based hierarchical robustness.

Although the Internet is playing an increasingly significant role in global communication, it remains vulnerable to malicious traffic such as worms and DoS/DDoS attacks. In the last few years, the emergence of high speed active worms, such as Code Red II, Nimda, SQL Slammer and MS Blaster, has become a serious issue. These worms cause serious damage to communication networks throughout the world by using up network bandwidth. In addition, since conventional firewall systems are located just in front of the server and do not prevent malicious traffic from entering the network, they cannot prevent such network congestion. Therefore, the firewall between domains or between core routers should play important roles in the photonic networks. We have developed a prototype system of a network firewall using reconfigurable processors. In this paper, we overview the developed system and present its evaluation results.

In high-capacity optical WDM networks, the failure of a network component such as a fiber link may disconnect many optical lightpaths, leading to severe disruption in network services. Therefore it is imperatively important to provide fast and full protection against any failure in optical WDM networks. The method of pre-configured protection cycles (p-cycles) is very attractive for design of survivable optical networks. So far p-cycle approach has been extensively studied for design of survivable optical networks where traffic demand is static. In this paper, we first briefly describe our recently proposed p-cycle design heuristic and then show how to apply this heuristic to optical networks where traffic demand is dynamically changing. We consider three different strategies to configure dynamic p-cycles for dynamic traffic demands, and compare their performance in terms of blocking probability and computational time.

Optical signal processing is one of essential technologies for improving the flexibility of all-optical network. Above all, recently there have been a lot of studies regarding all-optical 2R/3R regeneration technology. However, there are few studies about all-optical 2R/3R technologies that are carried out in field environment. In this paper, we report the successful results of field trials of an all-optical 2R regeneration system based on an electro-absorption modulator for 40-Gbit/s WDM transmission systems with optical add/drop multiplexing. It was made sure that by applying the all-optical 2R regeneration system to the optical add/drop multiplexer in the 320-km-long transmission systems the transmission characteristics of the express signal after 320-km transmission and those of the dropped signal at 160-km can be made nearly the same. It is quite important that the transmission characteristics are equal for both the dropped and express channel from a point of view of the system design, and the results in this paper suggests one possible solution for this matter.

The history of forward error correction in optical communications is reviewed. The various types of FEC are classified as belonging to three generations. The first generation FEC represents the first to be successful in submarine systems, when the use of RS(255, 239) became widespread as ITU-T G.975, and also as G.709 for terrestrial systems. As WDM systems matured, a quest began for a stronger second generation FEC. Several types of concatenated code were proposed for this, and were installed in commercial systems. The advent of third-generation FEC opened up new vistas for the next generation of optical communication systems. Thanks to soft decision decoding and block turbo codes, a net coding gain of 10.1 dB has been demonstrated experimentally. That brought us a number of positive impacts on existing systems. Each new generation of FEC was compared in terms of the ultimate coding gain. The Shannon limit was discussed for hard or soft decision decoding. Several functionalities employing the FEC framing were introduced, such as overall wrapping by the FEC frame enabling the asynchronous multiplexing of different clients' data. Fast polarization scrambling with FEC was effective in mitigating polarization mode dispersion, and the error monitor function proved useful for the adaptive equalization of both chromatic dispersion and PMD.

We describe a transmission system having a data rate of 160 Gbit/s based on the RZ-DPSK modulation format. The 160 Gbit/s single-polarization signal is generated by optical time division multiplexing technology using the base rate of 40 Gbit/s. The setup is explained and results are given with a special focus on the stability issue of the transmission system. The pulse source, the optical gate for demultiplexing, the clock recovery and the balanced photo-detector are based on semiconductor components. We present long-term bit error measurements (10 hours) over two different long-haul fiber links. The first link comprises 3106 km standard single mode fiber and uses a PMD mitigation scheme. The other link consists of 4 dispersion managed 80 km fiber spans without the need for an additional PMD compensation. Using EDFA amplification solely and also no FEC, error-free operation was achieved over several hours, only limited by slow drift effects in the laboratory system.

In this paper, firstly, effects of third order dispersion (TOD) on coupled pulses are analyzed. Then, averaging method is modified and proved to be an effective way for obtaining non-radiative bi-soliton solution of the TOD perturbed nonlinear Schrodinger equation (NLSE), which models a dispersion managed (DM) optical transmission system. Finally, the obtained bi-soliton evolution behavior is studied, and compared with that of uni-soliton. With the increase of average TOD, pulse velocity of bi-soliton largely deviates from that of uni-soliton. Thus, even though TOD cannot be exactly vanished in fabrication, it is suggested to compensate average TOD as low as possible.

Recently, the research on all-optical analog-to-digital conversion (ADC) has been extensively attempted to break through inherently limited operating speed of electronic devices. In this paper, we describe a novel quantization scheme by slicing supercontinuum (SC) spectrum for all-optical ADC and then propose a 2-bit all-optical ADC scheme consisting of the quantization by slicing SC spectrum and the coding by switching pulses with a nonlinear optical loop mirror (NOLM). The feasibility of the proposed quantization scheme was confirmed by numerical simulation. We conducted proof-of-principle experiments of optical quantization by slicing SC spectrum with an arrayed waveguide grating and optical coding by switching pulses with NOLM. We successfully demonstrated optical quantization and coding, which allows us to confirm the feasibility of the proposed 2-bit ADC scheme.

We present and demonstrate a novel method of generating a π phase-alternated return-to-zero (RZ) signal together with pulse-amplitude equalization in a rational harmonic mode-locked fiber ring laser, by using a dual-drive Mach-Zehnder modulator. By adjusting the voltages applied to both arms of the modulator, amplitude-equalization and π phase shift can be achieved successfully at a 9.95 GHz repetition rate. The generated alternate-phase RZ signals show enhanced transmission performance in the single-mode fiber (SMF) links without dispersion compensation.

We investigate the impact of electrical band-limitation on the transmission performance of both carrier suppressed return-to-zero (CSRZ) and CSRZ differential phase shift keying (CSRZ-DPSK) format for high spectral efficiency DWDM systems. Results show that electrical band-limitation improves signal spectral compactness, leading to reduced linear crosstalk and improved tolerance against chromatic dispersion in optical fiber link without causing any degradation to fiber nonlinearity tolerance. In addition, it is shown that the electrical band-limitation is more efficient to CSRZ-DPSK signal than CSRZ signal in reducing signal degradation caused by linear crosstalk and fiber chromatic dispersion.

Novel gain monitoring scheme in Remotely-Pumped EDF/DRA hybrid inline amplifier is proposed using Optical Time Domain Reflectometer (OTDR). Signal degradation due to cross gain modulation (XGM) caused by an OTDR pulse in the distributed Raman amplifier (DRA) section and remotely-pumped EDF (RP-EDF) unit is analyzed theoretically. The required conditions for suppressing of XGM in the DRA section are derived. We propose the directional bypass configuration to realize OTDR measurement without XGM in the EDF unit. Transmission experiments using the RP-EDF/DRA hybrid inline amplifier demonstrate the absence of transmission impairement induced by OTDR. An analysis of the OTDR trace for each gain medium is also discussed. The theoretical analysis agrees well with the experimental result.

Modulator output and fiber transmission characteristics of optical single sideband (SSB) modulations are analyzed under the assumption that SSB modulators are constructed using Mach-Zehnder (MZ) interferometers. The fiber input signal and the detected signal are derived theoretically for SSB modulation with and without an optical carrier. Optical SSB fiber transmission simulations show that the received signal waveform is degraded by harmonic components due to non-linear switching curve of MZ interferometer as a component of SSB modulators even if the Hilbert transformers is ideal for the definition. The optical SSB suppressed carrier is preferred to the SSB with an optical carrier from a viewpoint of waveform degradation.

An essential issue in designing, operating and managing a modern network is to assure end-to-end QoS from users perspective, and in the meantime to optimize a certain average performance objective from the systems perspective. So in the first part of this paper, we address the above issue by using the rerouting approach, where the objective is to minimize the average cross-network packet delay in virtual circuit networks with the consideration of an end-to-end delay constraint (DCR) for each O-D pair. The problem is formulated as a multicommodity network flow problem with integer routing decision variables, where additional end-to-end delay constraints are considered. As the traffic demands increases over time, the rerouting approach may not be applicable, which results in the necessity of capacity augmentation. Henceforth, the second part of this paper is to jointly consider the link capacity assignment and the routing problem (JCR) at the same time where the objective is to minimize the total link installation cost with considering the average and end-to-end delay constraints. Unlike previous research tackling this problem with a two-phase approach, we propose an integrated approach to considering the routing and capacity assignment at the same time. The difficulties of DCR and JCR result from the integrality nature and particularly the nonconvexity property associated with the end-to-end delay constraints. We propose novel Lagrangean relaxation based algorithms to solve the DCR and the JCR problems. Through computational experiments, we show that the proposed algorithms calculate near-optimal solutions for the DCR problem and outperform previous two-phase approach for the JCR problem under all tested cases.

Multi-Protocol Label Switching (MPLS) can efficiently support the explicit routes setup by the use of Label Switched Paths (LSPs) between an ingress Label Switched Router (LSR) and an egress LSR. Hence it is possible to distribute the network traffic among several paths to achieve load balancing, thus improving the network utilization, and minimizing the congestion. The packet-level traffic characteristics in the Internet is so complex that it is natural to do traffic engineering (TE) and control at the flow level. The emerging Multi-Protocol Label Switching (MPLS) has introduced an attractive solution to TE in IP networks. The main objective of this paper is to balance traffic at the flow level among the parallel Label Switched Paths (LSPs) in MPLS networks. We introduce a multipath load-balancing model at the flow level. In this model, each LSP is modeled as an M/G/1 processor-sharing queue. The load-balancing problem is then considered as an optimization problem. Based on the analysis of the model, we propose a heuristic but efficient mechanism that can make good use of the traffic characteristics at the flow level. Packet disorder is avoided effectively by dispatching packets belonging to one flow to the same path. This mechanism only need to be implemented in the ingress LSRs and the egress LSRs, while the intermediate LSRs only forward the packets. Apart from discussing the traffic allocation granularity, and the implementation issues in details, we have also performed extensive simulations using NS-2 with MPLS modules. The simulation results show that the load through the network is well balanced so that the network throughput is improved and the delay is decreased efficiently.

Among recent trends in Quality of Service (QoS) provisioning in the Internet is the Differentiated Services Architecture, termed DiffServ. The successful deployment of Diffserv to provide a premium QoS guarantees to network traffic requires an effective admission control mechanism, which needs to be scalable and relatively simple to implement. In this paper we present a QoS network framework with novel and effective measurement-based resource management and admission control mechanisms. The mechanism is based on the characteristics of measured arrival and departure traffic. Those characteristics are captured via a passive monitoring. We implement the mechanism at the edge routers of a DiffServ Domain. The admission control mechanism is only executed at the edge routers and doesn't require any signaling between inner routers. The mechanism does not depend on the underlying network topology or any specifications of the cross traffic present in the domain. Therefore the mechanism is scalable. In addition, the proposed approach does not require any traffic policing mechanism at the entrance of the network. This approach can provide the statistical QoS guarantees to a variety of service classes within a DiffServ domain. We show that the proposed framework can provide a high degree of network resource sharing among multiple traffic classes while satisfying their QoS requirements. To evaluate the effectiveness of the proposed framework, we perform a set of simulations on a number of bursty video traffic sources.

Due to the pruning and joining of members, multicast groups are dynamic. Both the topology and the total number of links change during multicast sessions, and the multicast performance, measured in terms of the bandwidth consumption, will change accordingly. In this paper, we investigate the dynamic performance of multicast communication with homogeneous packet loss probability; indeed, we evaluate the effects of the pruning of receivers and of subnets, after which we find the optimal placements of repair servers. A new 3-phase algorithm for adapting the optimal repair server placements to the dynamic changes of network topologies is presented and analyzed.

One of the important problems in overlay multicast is how to deal with node failures and ungraceful leavings. When a non-leaf end host fails or leaves the multicast session, all downstream nodes will be affected. In this paper, we adopt the proactive approach, which pre-calculates a candidate node (called parent-to-be) for each node to connect to in case its current parent dies. The goal is to recover the overlay multicast tree quickly so that the disruption of service to those affected nodes is minimized. We combine the local parent-to-be locating and global parent-to-be locating schemes together, in order to take advantage of less interference in the local scheme and the flexibility of the global scheme. The quality of the recovered tree is improved while the responsiveness of the proactive approach is maintained.

We have developed an experimental approach that allows us to estimate the performance of a large-scale enterprise network to update routing information. This approach was applied to the integration of the UFJ Bank network system on January 15, 2002. The main characteristic of this approach is the application of a formula that represents the delays in updating routing information that accompany reductions in CPU resources. This procedure consists of two steps: one is to estimate the reduction in the availability of CPU resources caused by forwarding of data packets at a router, and the other is to estimate the levels of CPU resources required for replying to a query about a new route and subsequently updating the routing information. These steps were applied to estimate the performance of the network in terms of routing information convergence. The results of our experiments on the network showed that updating the routing information was possible as long as the average level of CPU utilization during any five-minute period at the routers was less than 40%. We were able to apply this guideline and thus confirm the stability of the UFJ Bank network.

Micro/picocellular architectures for wireless networks have been proposed to provide higher capacity under limited radio spectrum. With smaller cell size, the frequency of hand-off events will increase. This will in turn increase the overheads for processing hand-off events. To reduce the overheads due to frequent hand-off, a cell-cluster concept has been proposed in [1]. In this paper, we propose a call admission control policy for cluster-based micro/picocellular wireless networks, that employs two levels of admission thresholds: one at the cell level and the other at the cluster level. An analytical method is developed to analyze the performance of the proposed policy. The analytical method is then applied to find the values of the admission thresholds such that the throughput of the network is maximized under the condition that a predetermined bound on the call hand-off dropping probability is guaranteed. Compared with call admission policies that employ a single threshold either at the cell level or at the cluster level under the condition that the policies provide the same predetermined maximum level of call hand-off dropping probability, the proposed call admission policy provides significantly better performance.

A space-time RAKE (ST-RAKE) receiver with a blind interference-blocking (IB) pre-processor, termed as the IB-RAKE receiver, is proposed for spread spectrum communications systems. The design of the proposed architecture consists of three components. A blind IB transformer is first constructed based on the received data, and then applied on the undespread data for the suppression of strong interference. After despreading, optimal beamforming is then performed on the IB despread data to extract the signals of interest (SOIs) from the desired user. Finally, a RAKE receiver with a maximum ratio combining technique is employed to constructively collect all the SOI energies. Since strong interference has been removed in the first stage, the RAKE receiver combines only those SOIs plus negligible interference, leading to robustness against strong interference. Numerical results have shown that substantial improvement can be obtained from the proposed ST-RAKE receiver with the blind IB pre-processing scheme.

In the cellular mobile communication systems, co-channel interference and Rayleigh fading degrade the transmission performance. Adaptive Array Antenna (AAA) can suppress interference and, at the same time, can cope with multi-path fading by using a wide antenna spacing resulting in low correlation of received signals in each antenna element. A feedback-type AAA was proposed for frequency division duplexed (FDD) systems, where mobile station measures channel characteristics and feed-backs them to the base station. In this paper, we extend the system by introducing 2-branch diversity reception at a mobile station, and study the influence of antenna element spacing at the base station and control delay time on bit error rate performance under a realistic propagation model.

In CDMA system, the RAKE receiver is commonly used to attain diversity gain by taking advantage of the good correlation properties of the spreading codes. However, at low spreading gains the good correlation properties of the spreading codes are lost and the RAKE receiver performance is severely degraded by intersymbol interference (ISI) due to the interpath interference (IPI). In case of multi-code CDMA system, there are exist multi-code interference (MCI). In order to suppress ISI and MCI, a novel receiver based on soft-output viterbi algorithm (SOVA) equalization is proposed in this paper. The SOVA equalization is applied to symbol sequences after RAKE combining and MCI cancellation to effectively eliminate the ISI during transmission of high rate data in wideband DS-CDMA systems. Simulation results show that the proposed RAKE-SOVA receiver significantly outperform the traditional RAKE and RAKE-VA receivers.

By using multiple transmit antennas, wireless systems have a large capacity in time-varying multipath fading channels. Space-time block code (STBC), space-frequency block code (SFBC), and space-time-frequency (STF) block code are well-known techniques in transmitter diversity schemes. While the SFBC (or the STF block coded) system gives full diversity at frequency-nonselective channels, it breaks down when used in a frequency-selective environment. This is because the SFBC (or the STF block code) scheme disregards frequency selectivity of the channel by assuming that channel frequency responses (CFRs) at adjacent subcarriers are the same. In this paper, we propose efficient channel estimation and symbol decoding methods, which consider the difference between CFRs at the adjacent subcarriers of the SFBC (or the STF block coded) orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. The proposed method gives initial channel information by designing a simple training symbol, and the CFRs at all the subcarriers and the differences between the CFRs are easily calculated by using an interpolation method or a discrete Fourier transform (DFT) operation.

In wideband code division multiaccess (W-CDMA) uplink, immediate accommodation of high data rate packet causes power control error and makes active users' signal quality deteriorate in a beginning of a frame. To avoid the deterioration, we propose a new radio resource management (RRM) which accommodates high data rate traffic gradually in several frames. The proposed RRM reduces the signal quality deterioration in the beginning of the frame. We also propose an effective power control scheme, where a power increase command is sent to all users before a new high data rate packet is transmitted. Simulation results show that joint utilization of the proposed two methods is effective to keep signal quality good for all users.

This paper aims to improve the performance of the soft canceller followed by simplified minimum mean-square error (SC/S-MMSE) turbo receiver for multiple-input and multiple-output space-division multiplexing/orthogonal frequency division multiplexing (MIMO-SDM/OFDM) transmission; it performs iterative parallel soft interference cancellation and MMSE filtering, and stream-wise soft-input and soft-output decoding. For this aim, we newly introduce two detection techniques: 1) serial interference cancellation, and 2) cyclic redundancy check (CRC)-assisted interference cancellation and MMSE filter tap computation. Various computer simulations are conducted to evaluate the performance enhancement obtained via the use of the two detection techniques. The computer simulation results show that this paper's proposed serial SC/S-MMSE turbo receiver with CRC achieves frame error rate (FER) performance gain over existing MIMO receivers (MMSE receiver, V-BLAST receiver, parallel SC/MMSE-matched filter (MF) turbo receiver, and parallel SC/S-MMSE turbo receiver) for QPSK, 16QAM and 64QAM modulation while keeping the comparable complexity order.

In this paper, a new 2-antenna transmit diversity, called orthogonal space-time spreading transmit diversity (OSTSTD) combined with delay transmission, is proposed. At the transmitter, N data symbols to be transmitted are spread using N different orthogonal space-time spreading codes (each represented by NN matrix) and are transmitted from two transmit antennas after adding different time delays. At the receiver, 2-step space-time despreading is carried out to recover the N transmitted data symbols. The first step recovers the N orthogonal spatial channels by taking the correlation between the received space-time spread signal and the time-domain spreading codes. The second step recovers the N transmitted data symbols using minimum mean square error (MMSE) despreading. The average bit error rate (BER) performance in a Rayleigh fading channel is evaluated by computer simulation. It is confirmed that the OSTSTD provides better BER performance than the Alamouti's space-time transmit diversity (STTD) at the cost of transmission time delay.

As a blind linear-interference-canceller for DS-CDMA mobile communications, the orthogonal matched filter (OMF) minimizes the power of the output while maintaining constant power of the desired signal in the output. This paper studies the extension of OMF to an RAKE receiver (OMF-RAKE), which adaptively controls the steering vectors that determine the constraint. It also applies the QR-RLS algorithm to estimate the OMF-RAKE parameters and investigates a hardware implementation that employs a systolic array. Computer simulations show that OMF-RAKE with the QR-RLS algorithm and the systolic array structure can reduce the computational complexity to about a half that of the conventional RLS-type algorithm without degrading the BER.

This paper presents a closed form expression of an exact average bit error rate (BER) for a time-division duplex (TDD) transmit diversity scheme employing maximal ratio combining (MRC) over time selective flat Rayleigh fading channels. In the proposed analysis, the feed back delay which degrades the BER performance is taken into account. The results are generally applicable to an arbitrary modulation scheme, as well as an arbitrary number of transmitting branches. To confirm the validity of the proposed analysis, the theoretical results are compared with the simulated ones.

This paper proposes a new angular measurement system to a moving target in the presence of clutter. We apply MUSIC (MUltiple SIgnal Classification) to the outputs of a Doppler filter bank consisting of quadrature mirror filter (QMF). The comparison between QMF and the short time Fourier transform (STFT) as a preprocessor of MUSIC is also discussed. DOA estimation performance by QMF-MUSIC is nearly equal to that of STFT-MUSIC. On the other hand, QMF-MUSIC overcomes STFT-MUSIC in the aspect of computational cost. In a specific example in this paper, the proposal QMF bank by Daubechies (4th order) wavelet requires 80% fewer the number of multiplications and 25% fewer the number of additions than the FFT-based STFT filter bank.

This paper presents three new circuits for the realisation of grounded inductors of lossy and lossless types. The active element used is the recently proposed current differencing buffered amplifier which is proven to be useful for the realisation of different current mode circuits. Applications of the proposed circuits are shown. Simulation results are included to verify theory.

This paper discusses several practical issues related to the provision of video-on-demand (VOD) services, focusing on retrieval of video data from disk on the server. First, with regard to system design, the pros and cons of cycle-based scheduling algorithms for VOD servers are compared, and an adequate policy according to system configuration is presented. Second, we present a way to tune the cycle-based scheduling algorithm so that it maximizes profit. Third, a method to overcome the cons of cycle-based scheduling algorithms is proposed, and its cost is analyzed.

Recently, Das et al. proposed a dynamic ID-based verifier-free password authentication scheme using smart cards. To resist the ID-theft attack, the user's login ID is dynamically generated and one-time used. Herein, we demonstrate that Das et al.'s scheme is vulnerable to an impersonation attack, in which the adversary can easily impersonate any user to login the server at any time. Furthermore, we also show several minor weaknesses of Das et al.'s scheme.

The widespread use of the Internet raises issues regarding intellectual property. After content is downloaded, no further protection is provided on that content. DRM (Digital Rights Management) technologies were developed to ensure secure management of digital processes and information. In this paper, we present a multilevel content distribution model of which we present formal descriptions.

In 1998, Tseng and Jan proposed a lightweight interactive user identification protocol based on ID-based cryptography. Recently, Hwang et al. modified their protocol to reduce the responding and waiting time for wireless network applications. In this letter, we show that their scheme is vulnerable to impersonation attacks.

When a fixed free-running crystal is used for sampling time generation at a DMT receiver, Inter-Symbol Interference (ISI) and Inter-Carrier Interference (ICI) are introduced by sampling time error. The ICI becomes more serious as the DMT symbol length increases. In this letter, the effects of sampling clock offset are investigated in the time domain using a new notion of Inter-sample Interference (IsI) instead of ISI and ICI. Based on the IsI analysis, we propose a new frequency domain timing error correction scheme.

The frequent and time-independent packet loss due to signal noise in the wireless network has been a major obstacle in providing a persistent end-to-end bandwidth in the integrated environment of wired and wireless networks. One approach to cope with this is to develop an efficient transport mechanism which appropriately adapts to the dynamics of the wireless part of the network so that the end-to-end throughput is maximised. The success of new transport mechanisms depends on the quality of information obtained, in particular, from the wireless network. This paper presents a novel mechanism to assess accurately the transmission quality of the wireless part of the integrated CDMA2000 1X networks using the NAK rate obtained from the underlying RLP protocol stack. The experiment results show that the proposed mechanism correctly measures the wireless transmission quality of the CDMA2000 1X network.

The fairness algorithm of the Resilient Packet Ring IEEE 802.17 standard suffers from throughput degradation under an unbalanced overload. This letter proposes an enhanced fairness algorithm using a valuable piece of information, represented by the transit buffer length, about congestion alleviation on a congested node, under which the throughput degradation can be completely improved.

In this paper, we describe a development of a Bluetooth Access Point for the WAN connection of home network devices. Especially, users can access the PSTN at home instead of expensive CDMA network through the AP, using the 'one-phone,' which is the Bluetooth enabled cellular phone. The one-phone service becomes a convergence of wired and wireless communication through the AP.

The playout delay for voice over IP applications is adjusted on every talkspurt. The parameter β that controls the delay/packet loss ratio is usually fixed, based on high jitter conditions. In this letter, a β-adaptive playout algorithm is presented, where the β is adjusted. The buffering delays and lateness rates are compared against the existing algorithm with the fixed β. We show that the β-adaptive system improves the lateness loss performance, especially for low jitter conditions, while maintaining almost identical buffering delay/lateness loss performance when jitter is high.

Since Ultra Wideband Impulse Radio (UWB-IR) system can resolve many paths and is thus rich in multipath diversity, the use of Rake diversity combining is very effective. In the Rake diversity combining, the bit error rate (BER) is improved with the increase of the number of fingers. The Pre-Rake diversity combining is known as another technique to achieve the performance equivalent to the Rake diversity combining without increasing the receiver complexity. In the Pre-Rake diversity combining, the transmitted signals are scaled and delayed according to the delay and strength of the multipath. In this paper, we propose Pre-Rake diversity combining techniques for UWB systems, All-Pre-Rake (A-Pre-Rake) diversity combining using perfect channel information, Selective-Pre-Rake (S-Pre-Rake) diversity combining using the information on the L strongest paths, and Partial-Pre-Rake (P-Pre-Rake) diversity combining using the information on the first L paths. From the results of our computer simulation for UWB-IR systems in IEEE 802.15 UWB multipath channel model, we show that the proposed Pre-Rake diversity combining techniques are effective for the UWB-IR systems to achieve good error rate performance, while keeping the complexity of the receiver low. We also show that the S-Pre-Rake diversity combining is effective to achieve good error rate performance with less channel information.

This paper proposes a novel frequency-domain channel estimator which mitigates the effects of ICI by jointly finding the frequency offset and channel frequency response (CFR). A binary search algorithm is used to find the present frequency offset and CFR jointly. The variance of the jointly estimated frequency offset is found to be very close to the Cràmer-Rao lower bound.

Single cell reuse of the same frequency, which is possible in DS-CDMA cellular systems, yields the option of site diversity to increase link capacity. In this letter, a generalized case of site diversity transmission is considered where multiple base stations (BS's) are involved in weighted transmissions with constant total transmit power to a target mobile station (MS). A general equation of conditional bit error rate (BER) is derived based on the model of weighted transmissions combined with antenna diversity reception and rake combining. It turns out theoretically that the optimum set of weights to maximize forward link capacity makes site selection diversity transmission (SSDT) the best performer. This theoretical analysis is confirmed by performance evaluation based on the Monte-Carlo simulation.

Wavelet based OFDM V-BLAST system design and its simulation results are briefly discussed in this article. The orthonormal wavelet bases are generated from Haar and Daubechies Quadrature Mirror Filter (QMF) bank. The BER performance of this system as compared to Fourier based OFDM V-BLAST system shows significant improvement.

System capacity of a wireless system can be improved greatly by using variable rate transmission. Assuming a low-rate and wide-coverage signaling-only wireless network, in this paper we evaluate, analytically and numerically, the extent of this improvement for various schemes with variable transmission rates. We considered log-normal shadowing as well as the effect of Rayleigh fading. Simulation results show close proximity with the analytical predictions.

In this letter, a new blind anti-jammer pre-processor is proposed for GPS receivers to alleviate performance degradation due to strong jammers. Since strong jammers have been successfully removed before despreading, the proposed scheme can effectively extract the signals-of-interest, leading to significant performance enhancement as compared with conventional methods.

Convergence of the iterative method based on the successive overrelaxation (SOR) method is investigated to solve the matrix equation in the moment analysis of array antennas. It is found this method can be applied to the sub domain method of moments with fast convergence if the grouping technique is applied and the over-relaxation parameter is properly selected, and the computation time for solving the matrix equation can be reduced to be almost proportional to the second power of the number of unknowns.