Medium access protocol design for delay-guaranteed multicode CDMA multimedia networks

To enable multimedia real-time applications over next-generation wireless code-division multiple access (CDMA) packet-switching networks, previous efforts show a proper scheduling policy is the key to provide delay-guaranteed access services to various traffic types with different bit error rate (BER) requirements. Considering the support of the prevailing Internet protocol (IP) with variable-length packets in future mobile networks, we develop a mathematically delay-optimal medium access control (MAC) protocol over multicode CDMA (MC-CDMA) environments under the continuous-time assumption. From our investigations, we suggest that a good MAC protocol should be designed by using a proper single-server scheduling policy to guarantee packet-delay, and controlling the maximal number of simultaneous spreading-code transmissions to maintain the required BER. We further evaluate the performance of some MC-CDMA MAC protocols supporting QoS on BER and packet-delay, and show that MAC schemes conforming to our design rules give better performance on packet-delay when maintaining acceptable BER of various traffic types.     

Efficient OVSF code assignment and reassignment strategies in UMTS

This paper presents an integrated solution for code management, assignment, and reassignment problems in UMTS. We propose a new architecture for code management and, based upon this new architecture, a code assignment strategy, referred to as "crowded-group first strategy". Our system architecture and code assignment strategy represent significant improvements both in the time complexity and the maintenance complexity. Moreover, the code blocking probability of the crowded-group first strategy is competitive to that of the other strategies. In this paper, we also propose a new code reassignment strategy, called the "crowded-branch first strategy". The main objective of this reassignment strategy is to reduce reassigned call probability with low computation overhead and extend this strategy for the general case. In order to systematically analyze the performances of the code assignment strategy, we implement a simulator to analyze the code selection behavior and code blocking probability of each strategy. Moreover, we propose some new performance metrics, named "weighted code blocking", "reassigned call probability", and "ratio of actual code reassignments", in order to precisely measure the performance obtained by different strategies. From the simulation results, we show that our proposed strategies efficiently utilize the OVSF codes with low computation overhead.     

Courtesy piggybacking: supporting differentiated services in multihop mobile ad hoc networks

Due to the salient characteristics such as the time-varying and error-prone wireless links, the dynamic and limited bandwidth, the time-varying traffic pattern and user locations, and the energy constraints, it is a challenging task to efficiently support heterogeneous traffic with different quality of service (CoS) requirements in multihop mobile ad hoc networks. In the last few years, many channel-dependent mechanisms are proposed to address this issue based on the cross-layer design philosophy. However, a lot of problems remain before more efficient solutions are found. One of the problems is how to alleviate the conflict between throughput and fairness for different prioritized traffic, especially how to avoid the bandwidth starvation problem for low-priority traffic when the high-priority traffic load is very high. In this paper, we propose a novel scheme named Courtesy Piggybacking to address this problem. With the recognition of interlayer coupling, our Courtesy Piggybacking scheme exploits the channel dynamics and stochastic traffic features to alleviate the conflict. The basic idea is to let the high-priority traffic help the low-priority traffic by sharing unused residual bandwidth with courtesy. Another noteworthy feature of the proposed scheme is its implementation simplicity: The scheme is easy to implement and is applicable in networks using either reservation-based or contention-based MAC protocols.     

Programmable group-delay module using binary polarization switching

We demonstrate the first programmable group-delay module based on polarization switching. With a unique binary tuning mechanism, the device can generate any differential group delay value from -45 to +45 ps with a resolution of 1.40 ps, or any true-time-delay value from 0 to 45 ps with a resolution of 0.7 ps. The delay varying speeds for both applications are under 1 ms and can be as fast as 0.1 ms. We evaluate both the dynamic and static performances of the device while paying special attention to its dynamic figures of merit for polarization-mode dispersion emulation and compensation applications. Our experiment shows that the device exhibits a negligible transient-effect induced power penalty (<0.2 dB) in a 10-Gb/s nonreturn-to-zero system.     

STUDY ON PHASE PERCEPTION IN SPEECH

The perceptual effect of the phase information in speech has been studied by auditory subjective tests. On the condition that the phase spectrum in speech is changed while amplitude spectrum is unchanged, the tests show that: (1) If the envelop of the reconstructed speech signal is unchanged, there is indistinctive auditory perception between the original speech and the reconstructed speech; (2) The auditory perception effect of the reconstructed speech mainly lies on the amplitude of the derivative of the additive phase; (3) td is the maximum relative time shift between different frequency components of the reconstructed speech signal. The speech quality is excellent while td <10ms; good while 10ms< td <20ms; common while 20ms< td <35ms, and poor while td >35ms.     

Positively Thermo‐Sensitive Monodisperse Core–Shell Microspheres

In this paper, we report on a novel family of monodisperse thermo‐sensitive core–shell hydrogel microspheres that is featured with high monodispersity and positively thermo‐responsive volume phase transition characteristics with tunable swelling kinetics, i.e., the particle swelling is induced by an increase rather than a decrease in temperature. The microspheres were fabricated in a three‐step process. In the first step, monodisperse poly(acrylamide‐co‐styrene) seeds were prepared by emulsifier‐free emulsion polymerization. In the second step, poly(acrylamide) or poly[acrylamide‐co‐(butyl methacrylate)] shells were fabricated on the microsphere seeds by free radical polymerization. In the third step, the core–shell microspheres with poly‐ (acrylamide)/poly(acrylic acid) based interpenetrating polymer network (IPN) shells were finished by a method of sequential IPN synthesis. The proposed monodisperse core–shell microspheres provide a new mode of the phase transition behavior for thermo‐sensitive “smart” or “intelligent” monodisperse micro‐actuators that is highly attractive for targeting drug delivery systems, chemical separations, sensors, and so on.     

一种快速CRC 算法①的硬件实现方法

介绍了CRC校验算法的硬件电路实现方法。CRC校验广泛应用于通信、存储系统，在串行CRC实现的基础上，对电路结构提出了改进的方案，并实现了CRC的并行计算，由此进一步可以适用于任意位数据宽度的数据输入情况。