This paper shows the recent standardization activities on Ethernet OAM functions. First, it briefly introduces recent carrier class Ethernet services indicating their characteristics and operational issues. Then, it explains current standardization status on Ethernet OAM functions. Finally it shows the requirements for Ethernet OAM functions and details of the OAM mechanisms currently being standardized by ITU-T SG13, SG15 and IEEE 802.1 WG.

This paper describes an overview of overall carrier-grade Ethernet technologies for next generation wide area Ethernet. In recent years, from access network to metro and core network, we can find many areas where communication services are provided by Ethernet technologies. This comes from the fact that operational efficiency and economical efficiency of Ethernet are far better than that of conventional wide area communication technologies such as SONET and ATM. On the other hand, carrier-grade reliability, operations-administration-maintenance (OAM) and quality of service (QoS) are inferior to SONET and ATM. Various standard schemes in IEEE 802 and ITU-T and vendors' proprietary schemes can leave various approaches to solve these problems. In this paper, the author explains a basic architecture of wide area Ethernet service (Q-in-Q tagging for metro network and Mac-in-Mac encapsulation for core network) at first. Various switch control technologies are then discussed which are deployed or are under evaluation in order to improve (i) reliability (i.e., resiliency) to protect subscribers against network failures, (ii) OAM for providers to perform fault and performance management, and (iii) QoS to guarantee subscriber's service level agreement between a carrier and a subscriber. Finally, a new switching architecture, Global Open Ethernet (GOE), is also introduced as one of promising approaches to realize a next generation carrier-grade Ethernet.

A significant growth in FTTH access rates has been seen in the last year. This paper overviews the deployed FTTH access systems and the recent application of Ethernet technologies. The standardization activities and further study issues are also discussed.

The Ethernet network is widely used and adopted to the access portion or metro area for the reason of new applications for native Ethernet services or its economical advantage. Apart from these applications for native Ethernet, an encapsulation technology to transport legacy services over Ethernet, i.e. TDM over Ethernet, is focused on. In order to apply it to the carrier networks, it is necessary to meet Quality of Service (QoS) requirements, and the consideration of operation, administration and maintenance (OAM) aspects are indispensable. Furthermore, in order for higher reliability, it is required to apply protection function to the networks. We have studied the encapsulation method of TDM signals applied to circuit emulator accommodating TDM signals over Ethernet. In addition, the OAM mechanism and the protection function are studied. This paper shows the frame format, the detail of the OAM mechanism and the protection function, and introduces a developed circuit for adaptation of TDM over Ethernet.

In this paper, authors present new schemes of our proposed Global Open Ethernet (GOE) technology from a viewpoint of improving reliability in metro-area Ethernet environment and show the numerical evidence on their performance results. Although several standardized or vendor proprietary technologies are proposed to improve Ethernet reliability, they still have reliability problems in terms of long failure recovery time (due to forwarding database (FDB) flush and recovery from a root bridge failure on spanning tree protocol), broadcast storm, and packet loss in network reconfiguration. To solve these problems, we introduce three schemes, a Per Destination - Multiple Rapid Spanning Tree Protocol (PD-MRSTP), a GOE Virtual Switch Redundancy Protocol (GVSRP), and an In-Service Reconfiguration (ISR) schemes. PD-MRSTP scheme reduces the failure recovery time by eliminating the need to flush the FDB and to recover from root bridge failures. GVSRP scheme ensures the reliability of connections between a GOE domain and a legacy Ethernet domain. Combined with PD-MRSTP, GVSRP prevents broadcast storm problems due to loops in the inter-domain area. ISR scheme enables in-service bridge replacement and upgrade without packet loss. Evaluating our prototype system, we obtained the following remarkable performance results. The GOE network using PD-MRSTP scheme delivered a fast failure recovery performance (4 ms) independent of the number of MAC address entries, whereas the legacy Ethernet network took 522 ms when a bridge had 6000 MAC address entries. Since we found that the failure recovery time increased in proportion to the number of MAC address entries, the one in large carrier network having one million of MAC address entries would take several tens of seconds. Thus using PD-MRSTP can reduce failure recovery time one ten-thousandth comparing with that of legacy Ethernet. In addition, evaluation of the ISR scheme demonstrated that a network can be upgraded with zero packet loss. Therefore, a GOE-based VPN is a promising alternative to other Ethernet VPNs for its reliability and stability.

Time synchronization is indispensable for wide area distributed systems including sensor networks, automation systems, and measurement/control systems. Another application is clock distribution, which is indispensable to support continuous information transfer. Because of the increasing demand for more sophisticated applications, it is essential to establish a time synchronization technique that offers higher accuracy and reliability. Particularly, the accuracy of time synchronization for Ethernet must be enhanced since Ethernet is becoming more important in telecommunication networks. This paper investigates a precise time synchronization technique that supports Gb/s Ethernet. To obtain accurate time synchronization, delay variation in message transfer and processing must be minimized. For this purpose, the paper first describes the implementation of preemptive priority queuing, which decreases the message delay variation of Ethernet. Through experiments, it is shown that preemptive priority queuing effectively achieves very low delay variation. The paper then proposes a method to synchronize the time signal of a slave node to that of the master node. The proposed time synchronization method is performed in the lower protocol layer and implemented on FPGA-based hardware. The method achieves superior time accuracy through the low message transfer/processing delay variation provided by preemptive priority, lower layer execution, and hardware implementation. The effectiveness of the method is confirmed through experiments. The experiments show that the time variation achieved by the method is smaller than 0.1 µsec. This performance is better than those obtained by existing synchronization methods.

This paper describes a novel adaptive clock recovery method that uses proportional-integral-derivative (PID) control. The adaptive clock method is a clock recovery technique that synchronizes connected terminals via packet networks, and will be indispensable for circuit emulation services in the next generation Ethernet. Our adaptive clock method simultaneously achieves a short starting-time, accuracy, stable recovery clock frequency, and few buffer delays using the PID control technique. We explain the numerical simulations, experimental results, and circuit designs.

A high-speed physical-layer architecture for Ethernet is described that supports 100-Gb/s throughput and 40-km transmission, making it well suited for next-generation metro-area and intrabuilding networks. Its links comprise 1210-Gb/s synchronized parallel optical lanes. Ethernet data frames are transmitted by coarse wavelength division multiplexing link and bundled optical fibers. Ten of the lanes convey 640-bit data synchronously (64 bits10 lanes). One conveys forward error correction code ((132 b, 140 b) Hamming code), providing highly reliable (BER < 10^-12) data transmission, and the other conveys parity data, enabling fault-lane recovery. A newly developed 64B/66B code-sequence-based deskewing mechanism is used that provides low-latency compensation for the lane-to-lane skew, which is less than 88 ns. Testing of this physical-layer architecture in a field programmable gate array circuit demonstrated that it can provide 100-Gb/s data communication with a 590 k gate circuit, which is small enough for implementation in a single LSI circuit.

To simultaneously support guaranteed real-time services and best-effort service, a Priority-based Scheduling Architecture (PSA) designed for high-speed switches is proposed. PSA divides packet scheduling into high-priority phase and low-priority phase. In the high-priority phase, an improved sorted-priority algorithm is presented. It introduces a new constraint into the scheduling discipline to overcome bandwidth preemption. Meanwhile, the virtual time function with a control factor α is employed. Both computer simulation results and theoretic analysis show that the PSA mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.

The changes in fiber strain and fiber loss with temperature are quantitatively evaluated for 0.5 mm UV-coated fiber and three kind of fiber-optic access cables, for dropping and indoor wiring, employing 0.5 mm UV-coated fiber. Measurements of the fiber strain and loss increase are conducted using a quasi-heterodyne interferometer method and a photon-counting optical-time-domain-reflectmeter, respectively, at 1.3 and 1.55 µ m. From the strain characteristics, the following observations are made: (a) In the temperature range from -40 to 20 the fiber strain followed the cable strain quite closely, thus maintaining a tight cable structure and (b) from 20 to 80, the fiber exhibited a lower strain than the cable strain. Furthermore, no loss increase due to temperature change was observed for the 0.5-mm diameter coated fiber and the three type of optical cables.

We have clarified both theoretically and experimentally the basic performance of distributed Raman amplification (DRA) transmission systems in trunk networks with DSF or SMF spans with limited pump power where the pump power is limited by practical considerations. The gain and noise characteristics of a fiber span with splice loss are accurately determined by employing three approximation models. A novel pumping scheme called band enhanced pumping (BEP) is proposed that improves the DRA gain and optical SNR (OSNR) by 1.5 and 0.55 dB, respectively, compared with those of a conventional pumping scheme, under typical system conditions. We show that a DRA system with a DSF span has OSNRs that are 2.1 and 2.9 dB higher than those of a system with an SMF span at limited pump powers of 200 and 400 mW, respectively, as typical examples.

This paper proposes a new optical access network architecture that differs from those of conventional Point-to-Point (PP) and Passive Optical Networks (PON). The proposed architecture, Optical Switched Access Network (OSAN), uses Optical Switching Modules (OSMs) that connect an Optical Line Terminal (OLT) to Optical Network Units (ONUs) in a virtual point to point configuration so that it offers the merits of both PP and PON while overcoming their demerits. Each OSM optically switches packets of variable length one by one under electrical control. To allow the elimination of optical buffers from OSM, OSAN uses the Multi-Point Control Protocol (MPCP) defined in IEEE 802.3ah. We evaluate the transmission distances between OLT and ONUs, and consider a network synchronization scheme and discovery mechanism that supports MPCP.

Hierarchical Mobile IPv6 (HMIPv6) was proposed by the Internet Engineering Task Force (IETF) for efficient mobility management. HMIPv6 reduces the amount of signaling in the wired network link that exists in Mobile IPv6. But, HMIPv6 cannot reduce the signaling cost in the wireless link. In mobile networks, the wireless link has far less available bandwidth resources and limited scalability compared with the wired network link. Therefore, the signaling overhead associated with mobility management severely degrades the wireless link. In this paper, we propose virtual-IP (VIP) allocation scheme with dynamic VIP zone to reduce the wireless signaling cost in mobile networks. The performance of the proposed scheme is compared with HMIPv6. Based on the numerical analysis and simulation, we show that VIP allocation scheme reduces the wireless signaling cost under various system conditions.

In 3G CDMA mobile communication systems, high data rate services are essential for many key applications. When an MS approaches the cell border, link performance is degraded and more power should be allocated to maintain the link performance. Since the maximum available signal power is limited, the link adaptation mechanism may diminish the data rate to maintain link performance. This implies that the valid coverage shrinks when the data rate increases. The shrinking of valid coverage under a predetermined data rate will strongly impact on the reliability of high data rate services. In this work, the encoded bit error probabilities of 3G CDMA mobile communication systems, over large-scale and large-small-scale fading channels, were analyzed based on SGA and SIGA methods. Analytic methods were also proposed to investigate the issues of coverage shrinking and service data rate variations. Furthermore, the outage probability, cell coverage percentage and the staying probabilities of available data rates were well examined. The proposed analytic methods can be applied, as a preliminary research, to the design of cellular-system-related techniques, such as QoS control, available data rate prediction, power reservation, and service adaptation.

We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-division- multiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants' foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P.

In this paper, we propose simple but effective modifications of 802.11 MAC (media access control) to resolve efficiency and fairness issues, in wireless ad-hoc networks [2]. Our proposal, based on the flow concept, incorporated faster end-to-end forwarding by assigning higher priority to a node that has packets to relay than others. After completion of end-to-end transmission, the node will be assigned a lower priority level to yield to other nodes. Simulation results show that the proposed scheme (F-MAC) significantly enhances the throughput of ad-hoc networks, while keeping fair sharing of bandwidth among mobile nodes.

Random Early Detection (RED), an active queue management scheme, has been recommended by the Internet Engineering Task Force (IETF) for the next generation routers. RED suffers from a number of performance problems, such as low throughput, large delay/jitter, and induces instability in networks. Many of the previous attempts to improve the performance of RED have been based on optimizing the values of the RED parameters. However, results have shown that such optimizations resulted in limited improvement in the performance. In this paper, we propose Double Slope RED (DSRED), a new active queue management scheme to improve the performance of RED. The proposed scheme is based on dynamically changing the slope of the packet drop probability curve as a function of the level of congestion in the buffer. Results show that our proposed scheme results in better performance than original RED.

As computer hardware components are achieving greater speeds, network link bandwidths are becoming wider. A number of enhancements to TCP have been developed in order to fully exploit these improvements in network infrastructures, including TCP window scale option, SACK option, and HighSpeed TCP (HSTCP) modifications. However, even with these enhancements, TCP cannot provide satisfactory performance in high-speed long-delay networks. As a means addressing this problem, gentle HighSpeed TCP (gHSTCP) has been proposed in [1]. However, its effectiveness has only been demonstrated in simulation experiments. In the present paper, a refined gHSTCP algorithm is proposed for application to real networks. The performance of the refined gHSTCP algorithm is then assessed experimentally. The refined gHSTCP algorithm is based on the original algorithm, which uses two modes (Reno mode and HSTCP mode) in the congestion avoidance phase and switches modes based on RTT increasing trends. The refined gHSTCP algorithm compares two RTT thresholds and judges which mode will be used. The performance of gHSTCP is compared with TCP Reno/HSTCP and parallel TCP mechanisms. The experimental results demonstrate that gHSTCP can provide a better tradeoff in terms of utilization and fairness against co-existing traditional TCP Reno connections, whereas HSTCP and parallel TCP suffer from the trade-off problem.

We propose a novel simplified Viterbi equalizer for high symbol rate FWA (Fixed Wireless Access) systems carrying 64QAM signals. Reduced complexity and improved performance are achieved adopting two approaches. The first one is reducing the number of survival paths, taking advantage of the large D/U common in LOS (line of sight) communications. The second one is using a multi-stage process to generate desired signal replicas based on their likelihoods. Computer simulations confirm that the proposed replica generation method offers a performance improvement of about 1 dB and the proposed Viterbi equalizer offers reduced complexity with no performance penalty compared to full Viterbi equalizer.

In closed-loop multiple-input and multiple-output space-division multiplexing (MIMO-SDM) systems, allocating power among multiple transmit data streams improves the channel capacity. However, the optimum power allocation values are not always available in closed-form. For instance, when we use transmission and reception schemes that do not transfer the MIMO channel into parallel orthogonal channels (e.g., eigen-mode SDM), the signal to interference plus noise ratio (SINR) of each data stream at the output of the receiver is not proportional to its corresponding transmit power. This feature makes it difficult to obtain the optimal closed-form power allocation value for each data stream. Thus, in this paper, we propose an iterative power allocation scheme for MIMO-SDM systems where the SINR is not proportional to the transmit power. Furthermore, we incorporate a transmit antenna selection scheme into the proposed power allocation scheme in order to attain further capacity enhancement. Computer simulation results are provided to show the effectiveness of the proposed power allocation schemes.

This paper describes a novel pilot symbol aided up-link channel estimation scheme for a multi-user MIMO-OFDM system. A novel pilot-symbol pattern is proposed in order to overcome the interference from the multiple antennas of each user. Based on these periodically inserted pilot symbols, the channel state information (CSI) for each entire OFDM data sequence is reconstructed by using the maximum a-posteriori probability (MAP) estimation algorithm. The MAP estimation algorithm exploits channel correlations in time, frequency and space domains, which are obtained from a frequency-selective and time-variant Rayleigh fading channel model with multiple clusters and a defined complex direction of arrival (DOA). Simulation results demonstrate that it achieves almost the same performance as the ideal case by using the MAP-based estimation scheme with the well designed pilot-symbol pattern. Moreover, this model-based estimation scheme is also robust to errors in the estimation of its parameters. It will become one of the strong candidates for use in next generation mobile communication systems.

Recently, a novel detector was proposed by the authors for code acquisition in non-Gaussian impulsive channels [3], which dramatically outperforms the conventional squared-sum detector; however, it requires exact knowledge of the non-Gaussian noise dispersion. In this paper, a robust detector is proposed, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The acquisition performance of the proposed detector is compared with that of the detector of [3] in terms of the mean acquisition time. The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of [3] using exact knowledge of the non-Gaussian noise dispersion.

In this paper the development of the control plane for the frame decoding functionality of an IEEE 802.16 Wireless MAN system is described. It is implemented in two ways. The first implementation is based on a general-purpose microprocessor, and specifically the one provided in the TMS320C64xx Texas family devices. The second implementation is based on an Intel's IXP2400 Network Processor chip and the preceding functions are implemented by writing embedded software for that part. The two implementations are compared and the comparison leads to some very useful results. The development of time critical tasks of a MAC protocol stack in software and mainly based on a Network Processor opens paths for very effective system architectures, where the Network Processor runs full the networking and the MAC/DLC processing of such telecom systems. The main question is: Can lower MAC be executed on a Network Processor or not? This manuscript attempts to give an answer to this question.

An LDPC-coded FH-OFDMA system is proposed for the uplink of a packet-based cellular system, where the frequency hopping (FH) is based on a resource block (RB) for coherent demodulation. For the system, different RB types are employed either for better intercell interference (ICI) averaging capability or for better channel estimation performance. For the receiver, practical iterative channel estimation and decoding methods are proposed to improve the channel estimation performance without boosting the pilot power and to mitigate the adverse effects of the ICI. Extensive simulation results are provided to show the effect of the RB size on the channel estimation and ICI averaging performance as well as possible application of the proposed receiver in harsh mobile environments with dynamic packet allocation.

This paper addresses the downlink transmission strategies with dynamic resource allocation for multiuser MIMO-OFDM systems. The ultimate objective is to maximize the sum rate capacity subject to average power constraints. Considering that the performance of conventional Orthogonal Frequency Division Multiple Access (OFDMA) is limited by users' exclusive use to subcarrier, while Dirty Paper Coding (DPC) is capable of supporting multiple users, we propose joint subcarrier and power allocation and precoding schemes based on OFDMA combined with DPC, which is called DPC-OFDMA. The analysis is considered in two stages with channel state information (CSI) at transmitter. The first stage applies water-filling method to address subcarriers allocation, in which users are allowable to share subcarriers. The second stage employs DPC combined with precoding to deal with simultaneous transmissions of the users sharing the same subcarriers. An efficient algorithm to choose the best possible ordering of users for DPC and the optimal precoding design of each user are also involved. To reduce the complexity for practice, two simplified strategies are proposed. One is called suboptimal DPC-OFDMA, where the number of users using the same subcarrier is restricted. Another employs beamforming (BF) at every subcarrier referred as BF-DPC-OFDMA. Simulation results show that the proposed simplified strategies can approach the optimal performance for most cases, and have higher spectral efficiency than conventional time-sharing OFDMA.

We developed two types of practical maximum-likelihood detectors (MLD) for multiple-input multiple-output (MIMO) systems, using a field programmable gate array (FPGA) device. For implementations, we introduced two simplified metrics called a Manhattan metric and a correlation metric. Using the Manhattan metric, the detector needs no multiplication operations, at the cost of a slight performance degradation within 1 dB. Using the correlation metric, the MIMO-MLD can significantly reduce the complexity in both multiplications and additions without any performance degradation. This paper demonstrates the bit-error-rate performance of these MLD prototypes at a 1 Gbps-order real-time processing speed, through the use of an all-digital baseband 44 MIMO testbed integrated on the same FPGA chip.

Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have received considerable interest recently. On space-time coding, some algorithms with perfect channel state information (CSI) have been proposed. In certain fast varying situation, however, it may be difficult to estimate the channel accurately and it is natural to study the blind detection algorithm without CSI. In this paper, based on subspace, a new blind detection algorithm without CSI is proposed. Using singular value decomposition (SVD) on output signal, noise subspace and signal subspace, which keep orthogonal to each other, are obtained. By searching the intersection of the signal subspace and the limited symbol vector set, symbol detection is achieved. The simulations illustrate that the proposed algorithm significantly improves system performance by receiving more output signals relative to transmit symbols. Furthermore, the presented algorithm is robust to the fading channel that changes between two successive blocks.

In this paper, we propose an ICI mitigation method for MIMO OFDM using turbo detection technique. In order to reduce the computational complexity, we present a method for dividing the received frequency-domain signals into subbands and the manner of division varies with each iteration, joint soft ICI cancellation and decoding is then performed on each subband. To perform iterative ICI mitigation, the estimation of the time-variant channel using a great quantity of pilot tones is needed, which results in poor spectral efficiency. We then propose a method to reduce the required scatter pilot tones, which is differentially-modulated-pilot scheme. Moreover, the estimation can be constructed based on EM-type algorithms to further reduce the computational complexity. Finally, the results of computer simulations demonstrate that the proposal can provide significant performance improvement.

In wired networks, broadcast and multicast transmissions can be easily achieved by data link layer (layer 2). Nevertheless, it is a big challenge to safely transfer broadcast or multicast data frames over multihop mobile ad hoc networks (MANETs) due to the high bit error rate, the high collision probability and the lack of acknowledgment. Additionally, most of MANET's routing protocols rely on the broadcast function to exchange essential routing packets between mobile nodes and need the multicast function to make more efficient use of network bandwidth for some particular multimedia applications. From our observations, the efficiency of the unicast/multicast routing protocol of finding the path/tree is highly dependent on supported broadcast schemes of the underlying media access control (MAC) protocol. Therefore, in this paper, we illustrate the uncertain broadcast problem due to no replying acknowledgment from any recipients when mobile nodes deliver broadcast frames in wireless networks. We, then, propose a novel reliable broadcast scheme to solve this problem as well as a reliable multicast scheme to enhance the network utilization in data link layer. Simulation results show that the proposed scheme, which is still compatible with IEEE 802.11 standard, can efficiently minimize the bandwidth consumption as well as propagation delay.

This paper studies the optimization of the effective channel capacity of wideband code division multiple access (WCDMA) systems under Rayleigh fading environments. Firstly, the results for Shannon capacity of fading channels with channel side information are reviewed, where the capacity is achieved by using an optimal power control scheme. Secondly, an optimal interference threshold is set for a given system outage probability P_out to minimize total interference. Finally, the effective channel capacity of WCDMA is defined and a target SIR level γ^* is derived with the Lagrangian multiplier method to maximize the effective channel capacity. It is shown that is dependent on the power control interference ratio (PCIR) ρ, the number of diversity paths identified by the receiver M, and the outage probability of the system. Simulation results are provided to validate the theoretical deductions. We conclude that the total effective channel capacity will be maximized as long as M4, and ρ0.5 for a proper value of .

Supporting diversified rates for real-time communications will become possible and essential with the rapidly increasing transmission rates provided by the 4th generation (4G) mobile communication systems. In this paper, a novel wireless Quality of Service (QoS) scheme suitable for broadband CDMA packet cellular systems with adaptive modulation coding is proposed and its characteristics are described. The proposed QoS scheme comprises several control factors laid on the MAC and RRC layers, and can be harmonized with IP-QoS. Two important control factors are proposed: radio-condition-aware admission control and resource allocation reflected multistage scheduling. Computer simulations and testbed experiments indicate that by using the radio-condition-aware admission control, stable and guaranteed service can be provided to real-time users regardless of the interference and the variation in the location of the mobile station. Moreover, resource allocation reflected multistage scheduling maintains guaranteed rates for real-time users and provides high resource utilization efficiency for best-effort users. Consequently, by using the proposed wireless QoS scheme, it is possible to provide users with high quality and diversified real-time services, on a packet based radio network for enhanced 3G and beyond.

There are many system proposals for satellite-based broadband communications that promise high capacity and ease of access. Many of these proposals require advanced switching technology and signal processing on-board the satellite(s). One solution is based on a geo-synchronous (GEO) satellite system equipped with on-board processing and on-board switching. An important feature of this system is allowing for a maximum number of simultaneous users, hence, requiring effective medium access control (MAC) layer protocols for connection admission control (CAC) and bandwidth on demand (BoD) algorithms. In this paper, an integrated CAC and BoD algorithm is proposed for a broadband satellite communication system with heterogeneous traffic. A detailed modeling and simulation approach is presented for performance evaluation of the integrated CAC and BoD algorithm based on heterogeneous traffic types. The proposed CAC and BoD scheme is shown to be able to efficiently utilize available bandwidth and to gain high throughput, and also to maintain good Grade of Service (GoS) for all the traffic types. The end-to-end delay for real-time traffic in the system falls well within ITU's Quality of Service (QoS) specification for GEO-based satellite systems.

In this paper we propose a novel spatial fading simulator to evaluate the performance of an array antenna and show its spatial stochastic characteristics by computer simulation based on parameters verified by experimental data. We introduce a cavity-excited circular array (CECA) as a fading simulator that can simulate realistic mobile communication environments. To evaluate the antenna array, two stochastic characteristics are necessary. The first one is the fading phenomenon and the second is the angular spread (AS) of the incident wave. The computer simulation results with respect to fading and AS show that CECA works well as a spatial fading simulator for performance evaluation of an antenna array. We first present the basic structure, features and design methodology of CECA, and then show computer simulation results of the spatial stochastic characteristics. The results convince us that CECA is useful to evaluate performance of antenna arrays.

MIMO spatial multiplexing systems are attracting a lot of attention because of their high spectral effiencies. Maximum Likelihood Detection (MLD) is known to be the optimal signal detection method for MIMO spatial multiplexing systems in terms of bit error rate (BER). However, the main drawback of MLD is its high complexity. In this paper, to reduce the computational complexity of MLD and to attain good BER in MIMO spatial multiplexing systems, we propose the minimum mean square error (MMSE)-MLD that combines MMSE detection and MLD according to the estimated SINR from each transmit antenna. We also propose the ordered successive MMSE detection (OSD)-MLD that combines OSD and MLD according to the estimated SINR from the transmit antennas. Simulation results show that the proposed MMSE-MLD and OSD-MLD can attain almost identical BER to that of MLD but with less complexity.

This paper presents method that offers the fast and accurate analysis of large-scale periodic array antennas by conjugate-gradient fast Fourier transform (CG-FFT) combined with an equivalent sub-array preconditioner. Method of moments (MoM) is used to discretize the electric field integral equation (EFIE) and form the impedance matrix equation. By properly dividing a large array into equivalent sub-blocks level by level, the impedance matrix becomes a structure of Three-level Block Toeplitz Matrices. The Three-level Block Toeplitz Matrices are further transformed to Circulant Matrix, whose multiplication with a vector can be rapidly implemented by one-dimension (1-D) fast Fourier transform (FFT). Thus, the conjugate-gradient fast Fourier transform (CG-FFT) is successfully applied to the analysis of a large-scale periodic dipole array by speeding up the matrix-vector multiplication in the iterative solver. Furthermore, an equivalent sub-array preconditioner is proposed to combine with the CG-FFT analysis to reduce iterative steps and the whole CPU-time of the iteration. Some numerical results are given to illustrate the high efficiency and accuracy of the present method.

We propose a progressive transform-based phase unwrapping (PU) technique that employs a recursive structure. Each stage, which is identical with others in the construction, performs PU by FFT method that yields a solution and a residual phase error as well. The residual phase error is then reprocessed by the following stages. This scheme effectively improves the gradient estimate of the noisy wrapped phase image, which is unrecoverable by conventional global PU methods. Additionally, by incorporating computational strength of the transform PU method in a recursive system, we can realize a progressive PU system for prospective near real-time topographic-mapping radar and near real-time medical imaging system (such as MRI thermometry and MRI flow imager). PU performance of the proposed system and the conventional PU methods are evaluated by comparing their residual error quantitatively with a fringe-density-related error metric called FZX (fringe's zero-crossing) number. Experimental results for simulated and real InSAR phase images show significant, progressive improvement over conventional ones of a single-stage system, which demonstrates the high applicability of the proposed method.

Stratospheric platforms have been recently proposed as a new wireless infrastructure for realizing the next generation of communication systems. To provide high quality services, an investigation of the wireless stratospheric platform channel is essential. This paper proposes a definition and describes an analysis of the wireless channel for the link between stratospheric platforms and terrestrial mobile users based on an experiment in a semi-urban environment. Narrowband channel characteristics are presented in terms of Ricean factor (K factor) and local mean received power over a wide range of elevation angles ranging from 10to 90. Finally, we evaluated average bit error probability based on the proposed channel model to examine the channel performance. For the environment in which the measurements were conducted, we find that elevation angles greater than 40yield better performance.

The Virtual Software Token Protocol was proposed by Know as a practical method for secure public key infrastructure roaming. However, he recently found a weakness of the protocol under the original assumption, and proposed two revised versions, namely refinement and improvement, which lost the desirable properties of scalability and efficiency respectively. In this letter, a secure improvement is proposed for better performance in both scalability and efficiency. Unlike the author's improvement, our improvement provides parallel execution as the original protocol did.

Sequences with ear zero correlation zones (EZCZs) are employed to suppress inter-symbol interference (ISI) and inter-user interference (IUI) in wireless communications. Theoretical limits on correlation functions of such sequences are investigated, lower bounds on the relations among length of sequence, width of EZCZs/ELCZs and family size are derived and presented, which play an important role in assessing performance of such sequences.

In this letter, a compact CORDIC algorithm is proposed to efficiently implement a synchronization block for carrier frequency offset (CFO) in OFDM modems. The compact CORDIC algorithm allows us to combine a CFO estimation block and a CFO compensation block into a single CFO synchronization block. It is shown by FPGA implementation results that the compact CORDIC algorithm can achieve a significant reduction in hardware complexity and latency for implementing the synchronization block in OFDM modems.

In this letter, a novel pilot-aided inter-carrier interference (ICI) self-cancellation scheme is proposed for use in orthogonal frequency division multiplexing (OFDM) systems. The proposed scheme maps both modulated data symbols and pre-defined pilot symbols onto non-neighboring sub-carriers with weighting coefficients of +1 and -1. With the aid of pilot symbols, a more accurate estimation of frequency offsets can be obtained, and the ICI self-cancellation demodulation can be operated properly.

In this paper, we present a time-delay estimation algorithm in a closely spaced multipath environment for a direct-sequence code division multiple access (DS-CDMA) systems. The proposed scheme first converts the observed signal to the frequency domain by Fast Fourier Transform (FFT). We then formulate a nonlinear estimation problem, and convert it into a large scale linear least squares problem. We apply conjugate gradients iterations on the resulting normal equations to obtain the solution. Unlike the methods which invoke the criterion of nonlinear least squares, the proposed scheme can achieve higher resolution. The delay estimation is combined with a tracking algorithm based on a FIR prefilter. Simulation results confirm the effectiveness of the proposed algorithm in both AWGN and Rayleigh fading channels.

This letter proposes an orthogonal frequency division multiplexing (OFDM) frame synchronization scheme when the guard interval (GI) consists of a zero-padded (ZP) sequence. The frame synchronization method uses the ZP symbol where nothing is transmitted for GI so that the drop in received power can be detected to find the beginning of the frame. Simulations reveal that this method significantly improves synchronization performance of the ZP-OFDM system in a multipath fading channel.

With the application of optical add-drop multiplexers, wavelength assignment has become an important issue in SONET/WDM design. Among wavelength assignment methods, circle construction is of great importance. In this paper, we propose a novel matrix based circle construction algorithm for all-to-all uniform traffic in a bidirectional SONET/WDM ring.

This letter analyzes the performance of statistical cooperative diversity based on space-time block codes (STBC) (Statistical STBC cooperative diversity) considering the effects of quantization and observation noise. Binary quantization is used. The bit error rate (BER) and average mutual information of the statistical STBC cooperative diversity with Alamouti's STBC and two active nodes are derived in the presence of general observation noise. It is shown that the performance of the statistical STBC cooperative diversity depends on the effects of observation noise and the number of cooperating nodes largely. It is also shown how much the communication between sensor nodes or feedback from the fusion center improves the performance of STBC cooperative diversity.

This letter studies the effect of node mobility on application-level QoS of audio-video multipath streams in wireless ad hoc networks. The audio-video streams are transmitted with the MultiPath streaming scheme with Media Synchronization control (MPMS), which was previously proposed by the authors. We perform computer simulation with a grid topology network of IEEE 802.11b including two mobile nodes. The simulation results show that MPMS is effective in achieving high application-level QoS in mobile networks as well.

A novel mobile assignment method based on transmit power and cell load is proposed for WCDMA base station location planning. Experimental results show that, compared with the currently widely used mobile assignment method based on link attenuation, the proposed mobile assignment method is more reasonable and unnecessary base stations are reduced in the planning results.

Even though various kinds of IPv6 transition mechanisms have been developed for the transition to an IPv6 network, these transition mechanisms take no stance on whether applications support IPv6 or not. This paper describes why the transition period between IPv4 and IPv6 applications may not be straightforward and applications should be ported to support both IPv4 and IPv6; such applications are called "IP version-independent applications." Also, this paper examines and empirically evaluates overhead of the IP version-independent applications, since the performance implication is not well known. The overhead might be very dependent on data sizes and network performance, but it was relatively minimized for general Internet traffic with larger data sizes and lower network latency.

This letter reports laboratory experiments of trellis-coded multiple-antenna systems. We evaluate the effect of spatial interleaving for the vector Viterbi algorithm under several conditions such as line-of-sight (LOS), non-LOS propagation, frequency-flat and frequency-selective channels.

In this letter, we investigate ESPRIT-based approaches for blind frequency offset estimation on MC-CDMA downlink. By analyzing the signal subspace structures of the MC-CDMA signals, the natures of the spreading codes and the number of users determine the feasibility of the ESPRIT-based approaches for the blind estimation task.

High peak-to-average power ratio (PAPR) of the transmit signal is a major drawback of orthogonal frequency division multiplexing (OFDM). Selected mapping (SLM) technique is an efficient PAPR reduction technique for OFDM. In the SLM technique, many data blocks are generated from an OFDM data block using a set of phase sequences, and then the one with the lowest PAPR is chosen and transmitted. In this paper, an SLM technique with magnitude extension is proposed. In the proposed SLM technique, it is not needed to transmit side information from transmitter to receiver. The proposed technique achieves significant reduction in PAPR with only a small increase in transmit signal power.

In this letter, we propose adaptive linear detectors in space-time block coded multiuser systems, by exploiting a particular property of the minimum mean square error multiuser detector. The proposed scheme can provide much faster convergence than the existing adaptive scheme [5] and so lower the system overhead requirements.

In this letter, a hybrid selection combining (SC) and maximal ratio receive combining (MRRC) technique is proposed for orthogonal frequency-division multiplexing (OFDM) systems with multiple receive antennas. The proposed technique still uses multiple receive antennas, but it has just a single RF front-end and a single baseband demodulator. In comparison with the OFDM system with no diversity, we can achieve superior gain irrespective of bandwidth efficiency, and also in comparison with the MRRC OFDM, we can achieve better gain under the bandwidth efficiency of 3 bps/Hz at the bit error rate of 10^-6.

Cooperative transmission among users in multiple access wireless environments is an efficient way to obtain the powerful benefits of multi-antenna systems without the need for physical arrays. Its performance in relay networks were extensively analyzed but most papers only focused on the case of high signal-to-noise ratio (SNR) or loose power constraints. Based on the approximation of total SNR distributions of the propagation paths through relays as the exponential functions, we derive the analytical BER expression in a simple form for general relay networks under strict power restriction. Numerical and simulation results reveal the high accuracy of the distribution estimation as well as the high reliability of the deduced formula, especially at the low SNR.

In this letter, a phase noise reduction algorithm for orthogonal frequency division multiplexing (OFDM) systems with an input of higher-order constellation is proposed to achieve high data rate transmission. The proposed algorithm estimates dominant interchannel interference (ICI) terms, caused by phase noise, using the subcarriers adjacent to pilot subcarriers, and compensates the OFDM signal using these estimates. Also, the length of dominant ICI terms is efficiently determined by estimating 3 dB bandwidth of phase noise. The proposed algorithm is shown to reduce the effect of phase noise on OFDM systems with an input of higher-order modulation and a large amount of phase noise.

In this letter, we propose a new detection method for an OFDM signal distorted by IQ imbalance, and a pilot pattern to estimate the channel associated with IQ imbalance. It is shown by computer simulation that the proposed method can achieve robust detection even when severe IQ imbalance exists in OFDM systems with an input of higher-order constellation.

In this letter, we propose a partial minimum mean-squared error (MMSE) with successive interference cancellation (PMMSESIC) method in frequency domain to mitigate ICI caused by channel variation. Each detection, the proposed method detects the symbol with the largest received signal-to-interference-plus-noise ratio (SINR) among all the undetected symbols, using an MMSE detector that considers only the interference of several neithborhood subcarriers. Analysis and simulations show that it outperforms the MMSE method at relatively high Eb/N0 and its performance is close to the MMSE with successive detection (MMSESD) method in relatively low Doppler frequency region.

In this paper, we propose and analyze a scheme for wireless channels, which is the combination of an automatic repeat request (ARQ) scheme and power ramping. The power ramping is used for more reliable downlink data transmission. This technique gradually increases the transmission power at each retransmission attempt. Simulation results demonstrate that when the power step size is 0.5 dB, the average throughput gain may be as high as 2.3% to 5.4% with properly selected parameters.

In this paper, we derive an analytical result for channel holding time distribution in mobile satellite networks under general call holding time distribution.

The spatial distribution of the electric field in the low to high frequency bands radiated from printed circuit board (PCB) should be estimated continuously from near to far field. The characteristic of the electric field distribution is analyzed by the FDTD-multiple analysis space (FDTD-MAS) method, which can analyze from near to far field continuously, and compared with measured results. Since the analyzed electric field distribution is good agreement with measured results, it is suggested that the continuous distribution for electric field from near to far field can be calculated by the FDTD-MAS method. The electric field at low frequency is larger than that at high frequency within 1 m.

In this letter, a new formula is proposed for calculating the polarization entropy, based on the least square method. There is no need to calculate the eigenvalues of a covariance matrix as well as to use logarithms of values. So the time for computing the polarization entropy is reduced. Using polarimetric SAR data, the authors validate the effectiveness of the new formula.

When the frame size is downscaled for video transcoding, the new motion vector (MV) must be computed. This paper presents an algorithm to utilize the activity measurement by DC value and the number of non-zero quantized DCT coefficients in the residual macroblock to compose the motion vector. It can reduce the complexity for motion estimation and improve the performance of the spatial domain video transcoder.