Among the wireless personal area networks, much attention has been placed on the HomeRF system due to the simple hardware complexity. In this letter, we propose several techniques for the HomeRF system. First, a DC-offset compensation technique is considered for HomeRF system. In addition, a decision directed channel estimation technique is proposed. The proposed techniques require no additional training sequence and a little additional hardware. And finally, a turbo coding technique is considered as a improved coding scheme. It is shown that the performance of the proposed algorithm is significantly improved in comparison with the conventional HomeRF system.

This letter derives low-complexity frame and coarse frequency-offset synchronization techniques for orthogonal frequency division multiplexing (OFDM)-based HIPERLAN (HIgh PErformance Radio LAN) system. We first propose a frame detector structure directly based on the correlation method and a reduced complexity structure having the similar performance compared with conventional correlation method. We then propose a coarse frequency-offset synchronization technique and show the performance of the proposed techniques by simulation.

Differentiated Service (DiffServ) is a technology designed to provide Quality of Service (QoS) in the Internet, and is superior to Integrated Service (IntServ) technology with respect to the simplicity of its architecture and the scalability of networks. Although various simulation studies and estimations over testbeds have investigated the QoS that is offered via the DiffServ framework, almost all of them focused on the characteristics in a single DiffServ domain. However, the Internet is actually composed of a large number of AS domains, and thus packets are very likely to arrive at their destinations after going through many different domains. Therefore, we have analyzed the QoS performance in a model consisting of multiple DiffServ domains, and focused especially on the quality provided by Assured Forwarding Service (AF) to achieve statistical bandwidth allocation with AF-PHB. Our simulation results show some throughput characteristics of flows over multiple Diffserv domains, which clarify how network configurations impact the QoS over multiple DiffServ domains.

Quality of service (QoS) technology has been implemented and started to be applied to new applications on the next-generation Internet. However, as new applications have many kinds of features and requirements, some additional features should be added to current QoS control technology. For example, they require a definition of a single policy to operate QoS control in the management domain consistently and efficiently. Policy definition for transport layer in a domain and among domains is being discussed at IETF to set a standard process, however detailed policy corresponding to the application or contents information according to the application semantics has not been discussed. Therefore we developed QoS policy control mechanism using metadata which is defined as a structured data according to the application semantics. Though metadata and transport mechanism can be located into quite different positions in the concept of network layers, we made them successfully collaborated by defining meta policy. In this paper, we describe our approach to define a meta policy based on the requirements and information contents from the application as a high level layer concept to be able to classify the network behavior. Our approach enables to multiple QoS control and collaboration among domains. We also report of the activities in IETF and ITU-T.

We design a four-reflector offset antenna satisfying the cross-polarization elimination condition and the broadband characteristics condition which consists of one primary horn, three subreflectors and one main reflector. The cross-polarization elimination condition for the four-reflector offset antennas is expressed by the equations of hyperbolas with the coordinate axes of the reciprocal of equivalent focal lengths. The configurations of the reflector system are derived simply from the graphical representation because four-reflector offset antennas satisfying these relationships exist on the hyperbolas with the coordinate axes of the reciprocal of equivalent focal lengths. Furthermore, we clarified that the derived condition for having planar phase front applying the broadband characteristics condition is independent of frequency. An actual design example for the four-reflector offset antennas satisfying the cross-polarization elimination condition and the condition for having planar phase front, both of which are independent of frequency is shown. The design method using the graphical representation is simpler than that of the tri-reflector offset antennas.

In this paper, a novel method of clock feedthrough reduction in CMOS autozeroed operational amplifiers with three-phase clock operation is presented. The operational amplifiers in the method are configured by two autozeroed-gain stages. The differential input stage and the second output gain stage are autozeroed individually by a three-phase clock for autozeroing. The three-phase clock is provided so as to finish the compensation period of the input stage earlier than the end of the second stage compensation period. This operation makes it possible to absorb affection of clock feedthrough in the input stage with the second stage. As a result, residual error of offset compensation is much reduced by the voltage gain of the first stage. The effect of the two-stage autozeroing has been confirmed with SPICE simulation and fabricated CMOS circuit. The results of SPICE simulation showed that the two-stage autozeroed operational amplifier has significant advantage as compared to conventional configuration. Affection of clock feedthrough is reduced to about 1/50 in the two-stage configuration. Fabricated CMOS circuit also showed high potential of the two-stage autozeroed operational amplifier for feedthrough reduction. It has been proven experimentally that the two-stage autozeroing is an effective design approach to reduce clock feedthrough error in CMOS autozeroed operational amplifiers.

Methods that precisely compensate for propagation distortion using pilot symbols are widely used in mobile communications. We describe such a pilot-symbol-assisted technique for precise compensation of flat fading and frequency offset. This technique provides a wide range of offset compensation. Conventional methods using fast Fourier transform (FFT) compensate for both slow and fast fading, but their tolerable range of frequency offset is very limited. By composing a system with an approximate frequency estimator, we can estimate and compensate for fading and a large frequency offset at the same time. The estimation and compensation are carried out by periodic pilot symbols and no other index sequences are needed. This method enables high-data-rate transmission. We describe the method and provide a theoretical analysis for the compensable range of fading and frequency offset for a transmission frame structure with pilot symbols. Then, we evaluate the method by computer simulation.

An LMS adaptive digital filter using distributed arithmetic (DA-ADF) has been proposed. Cowan and others proposed the DA adaptive algorithm with offset binary coding for the simple derivation of an algorithm and the use of an odd-symmetry property of adaptive function space (AFS). However, we indicated that a convergence speed of this DA adaptive algorithm degraded extremely by our computer simulations. To overcome these problems, we have proposed the DA adaptive algorithm generalized with two's complement representation and effective architectures. Our DA-ADF has performances of a high speed, small output latency, a good convergence speed, small-scale hardware and lower power dissipation for higher order, simultaneously. In this paper, we analyze a convergence condition of DA adaptive algorithm that has never been considered theoretically. From this analysis, we indicate that the convergence speed is depended on a distribution of eigenvalues of an auto-correlation matrix of an extended input signal vector . Furthermore, we obtain the eigenvalues theoretically. As a result, we clearly show that our DA-ADF has an advantage of the conventional DA-ADF in the convergence speed.

This paper proposes three-phased traffic conditioner (3PTC) to be installed at edge routers in Differentiated Services (DiffServ) networks. 3PTC ensures that Assured Service (AS) flows are supplied with the throughput assurance, which stems from alleviating the impact of the size of TCP reserved rate, UDP/TCP interaction, Round Trip Time (RTT) and number of microflows. 3PTC is composed of token bucket phase, writing probability (WP) calculation phase and queue management phase. Computer simulation results show that 3PTC guarantees throughput assurance and provides end users with expected service levels.

Most applications can adapt their coding techniques and sending rates according to the network congestion and the resource needed can be provided at the beginning of the transmission. So traditional Differentiated Services (DiffServ) model is too rigid to them. In this paper, we are seeking a balance between the relative DiffServ and the absolute DiffServ and propose a new Diffserv model, a relative Differentiated Service model with admission control, which suits the adaptive application. By providing the proportional differentiated services in core routers and loss-rate based CAC control in edge routers, we can make both the network and the users adaptive: the network is adaptive to the traffic load and the users is adaptive to the network congestion. This model is promising to the elastic but unpredictable traffic, such as IP telephony or other multimedia applications.

The Quality of Service (QoS) reservations in Differentiated Service (DiffServ) networks can be classified into two sets: Book-ahead (BA) requests and Instantaneous Requests (IRs). When an admitted BA request becomes active, some ongoing IRs is dropped when the bandwidth is insufficient for supporting both IRs and BA requests. The admission control should predict the lifetime, i.e. look-ahead time, of the IRs to prevent the admitted IRs from being dropped. The control should then check whether the available bandwidth during the look-ahead time is sufficient for the incoming IRs. We propose an application-aware look-ahead admission control for IRs, which determines the look-ahead time for specific types of IR applications. An admitted BA request might block subsequent ones that could bring more effective revenue. Thus, we propose the deferrable model of the admission control for BA requests. Simulation results indicate that the application-aware look-ahead admission control successfully reduces the dropping probability and wasted revenue of IRs by up to 10 times and 30%, respectively. Besides, the deferrable model indeed results in more BA effective revenue.

In recent years, the concept of Quality of Service (QoS) has gained attention in the network research community and its extension towards delivering QoS level assurance to sensitive applications has generally been agreed to be crucial for the longevity and usability of the Internet. On the Internet, the Differentiated Services (DiffServ) architecture is a general framework for the differentiated treatment of traffic aggregates in the core network. However, DiffServ does not extend to end-to-end QoS assurance. In this paper, we propose a simple resource-brokering scheme operating over a hierarchically connected internetwork of administratively-independent DiffServ-capable domains that is a simplified model of the Internet. The proposed asynchronous, multi-agent resource-brokering scheme operates locally but avoids conflicts globally. In this way, the traffic control reflects the underlying structure of the internetwork, introduces only a localized complexity thus scaling up well, and permits independent policies between the interconnected domains.

A digital noncoherent demodulation scheme is presented for reception of Gaussian frequency shift keying (GFSK) signals with small modulation index. The proposed differential demodulator utilizes oversampled signals to estimate the symbol timing and to compensate the frequency offset. The performance of the proposed receiver is evaluated in terms of the bit-error rate (BER). Numerical results show that the proposed demodulator provides performance comparable to that of conventional baseband differential demodulator, while significantly reducing the implementation complexity suitable for single chip integration with direct conversion radio frequency module. Finally the performance of the proposed receiver is improved by adding a simple decision feedback module.

A dual-offset microstrip-fed slot antenna having large bandwidth studied in this paper. The proposed antenna is analyzed by the Finite Difference Time Domain (FDTD) method. In this case, two offsets and other design parameters of the antenna lead to the good impedance matching over a wide frequency band. The experimental bandwidth is approximately 1.587 octave (-10 dB S11). And the experimented data for the impedance loci, the radiation patterns, and gain of the antenna are also described. The measured results are relatively in good agreement with the FDTD results.

The IETF Differentiated Services (DiffServ) framework achieves scalability by (1) aggregating traffic flows with coarse grain QoS on the data plane, and (2) allocating network resources with a bandwidth broker (BB) on the control plane. However, there are many issues that need to be addressed under such framework. First, it has been shown that the concatenation of strict priority (SP) scheduler of class-based queues (CBQ) can cause delay jitter unbounded under certain utilization, which is not acceptable to support the premium service (PS). Furthermore, it is not clear how such a DiffServ network can support traffic flows requiring the guaranteed service (GS), which is a desirable feature of the future Internet. This paper presents architecture and mechanisms to support multiple QoS under the DiffServ paradigm. On the data plane, we present a node architecture based on the virtual time reference system (VTRS). The key building block of our node architecture is the core-stateless virtual clock (CSVC) scheduling algorithm, which, in terms of providing delay guarantee, has the same expressive power as a stateful weighted fair queueing (WFQ) scheduler. With the CSVC scheduler as our building block, we design a node architecture that is capable of supporting integrated transport of the GS, the PS, the assured service (AS), and the traditional best effort (BE) service. On the control plane, we present a BB architecture to provide flexible resource allocation and QoS provisioning. Simulation results demonstrate that our architecture and mechanisms can provide scalable and flexible transport of integrated traffic of the GS, the PS, the AS, and the BE services.

This study investigates the problem of unfairness when QoS routing does not consider the mix of traffic classes. Unfairness is mainly caused by routing different traffic flows of the same class through paths with extremely different traffic mixtures, involving various service classes. Next, a new routing scheme--Service-sensitive Routing (SSR), which takes the state of traffic mixture of the various service classes into account, is proposed. To determine the QoS route for a flow request, SSR not only considers the available bandwidth and delay of the candidate paths, but also considers the mix of traffic classes on the paths. Additionally, the hybrid granularity routing decision in SSR scheme is scalable and suitable for the Differentiated Services and MPLS networks. Extensive simulations show that SSR can effectively reduce the variance of the average of queuing delays, for example by approximately 20% to 35% for a moderate offered load, compared to the shortest path routing. Furthermore, this routing scheme reduces the fractional reward loss and bandwidth blocking probability.

Improvements of Internet technology during the last decade have shifted the technical focus from reachability to the quality of communication. There are many technical frameworks, such as Integrated Service and Differentiated Services, which have been standardized to assure the quality of communication. QoS routing is also one of such frameworks. It changes or fixes a route that IP datagrams take, and is also indispensable to put a variety of services into practice. Nevertheless, experiment reports of QoS routing on operational network are quite few, especially with dynamic SLA. Therefore, we still do not know much about the important factors for QoS-enabled network to be realized, such as users' behavior, suitable services to offer, and configuration parameters. In this paper, we carried out field-trial with pseudo QoS routing and dynamic SLA in an actual network built at the WIDE retreat in autumn 2000. In this field-trial, we provided two different types of links to attendees. Attendees chose one of the links, through which their flows go, with our dynamic SLA. We describe the details and the results of this experiment. Our results could help to understand the customers' behavior for differentiated services, and therefore be useful for designing and deploying various QoS technologies.

In this letter, we present a coarse frequency-offset synchronization technique for Eureka-147 DAB receiver. The proposed frequency-offset synchronization algorithm using two defined correlation functions is shown to have high robustness against a large range of symbol timing offset with a moderate implementational complexity.

We have developed a new scheme to provide Diffserv-based QoS over ATM access networks. Well-known Diffserv over ATM scheme requires some extension for conventional routers with ATM interfaces. The routers must map their Diffserv classes of services into ATM QoS classes and forward IP packets into prioritized VCs based on DSCP (DiffServ Code Point). The purpose of this work is to provide Diffserv-based QoS over ATM network using conventional IP over ATM interfaces on routers. We propose DSCP snooping at ATM edge nodes, which differentiates services over a single VC between two IP domains. A prototype circuit was used to evaluate this scheme.

Differentiated services (Diffserv) model is one of the possible solutions for providing quality of service (QoS) on the Internet. Most existing approaches assume that the packet loss is an indication of network congestion and thus reduce the sending rates of sources. For wireless networks, the assumption is not proper since packet losses may be caused by other reasons, such as fading and interference of the signal. Therefore, these approaches do not work well in wireless networks. In this paper, we propose an approach which is able to provide service differentiation in wireless environments. In our approach, the rate share of a connection is determined by the associated weight. By keeping a proper amount of extra data in the network, the proposed approach can achieve weighted proportional fairness, which can provide selective QoS without any particular support from the network. We use the ns simulator to evaluate our approach. Simulation results show the validity of the proposed approach.