A cost-effective ultra-dense WDM PON system with speed of 12.5 Gbit/s and channel spacing of 12.5 GHz

In this paper, an experimental scheme for cordwood color division multiplexing（CDM） visible light communication（VLC） system is proposed. The principle and structure of the experimental scheme are described. Right angle prisms and band-pass filter are used to make the unit of the optical collector and splitter. We can add or subtract the unit as we need. The cordwood CDM-VLC system can also be effectively used as a model to accomplish color shift keying and color division duplexing. The experimental system provides a new way for researching VLC.     

ITERATIVE RECEIVER FOR OFDM SYSTEMS BASED ON SEMI-BLIND CHANNEL ESTIMATION

In this paper we propose two iterative algorithms of joint channel estimation and symbol detection for Orthogonal Frequency Division Multiplexing （OFDM） systems. In which, superimposed pilot scheme is adopted and an initial Channel State Information （CSI） is obtained by employing a first-order statistic. In each subsequent iteration, we propose two algorithms to update the CSI. The Mean Square Error （MSE） of channel estimation and Bit Error Rate （BER） performance are given and simulation results demonstrate that the iterative algorithm using method B has good performance approaching the ideal condition.     

A Mixed Real-time Algorithm for the Forward Kinematics of Stewart Parallel Manipulator

Aimed at the real-time forward kinematics solving problem of Stewart parallel manipulator in the control course, a mixed algorithm combining immune evolutionary algorithm and numerical iterative scheme is proposed. Firstly taking advantage of simpleness of inverse kinematics, the forward kinematics is transformed to an optimal problem. Immune evolutionary algorithm is employed to find approximate solution of this optimal problem in manipulator＇s workspace. Then using above solution as iterative initialization, a speedy numerical iterative scheme is proposed to get more precise solution. In the manipulator running course, the iteration initialization can be selected as the last period position and orientation. Because the initialization is closed to correct solution, solving precision is high and speed is rapid enough to satisfy real-time requirement. This mixed forward kinematics algorithm is applied to real Stewart parallel manipulator in the real-time control course. The examination result shows that the algorithm is very efficient and practical.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

An Arrangement of Channels and Transceivers in Optical Packet Switching Networks

Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.     

BER Modified Decode-and-Forward Protocol for OFDM-Based Linear Multihop Networks

In orthogonal frequency division multiplexing （OFDM） based multihop communications, the conventional decodeand-forward （DF） relay scheme severely suffers from the error propagation problem. This drawback is serious in multihop networks as errors made by any relay node may fail the decoder at the destination in great chance. In this paper, we propose a bit error rate （BER） modified DF protocol （BMDF） which can be applied to systems where error correction channel coding and M-ary modulation are used. By modeling all links except the last one as a binary symmetric channel （BSC）, we derive a log likelihood ratio （LLR） modification function relying only on the accumulated BER of all previous links to be applied to the output of the soft demapper. Furthermore, to reduce the computational complexity and signaling overhead, the modification function is simplified from its original exponential expression and less BERs are delivered between nodes by making successive subcarriers share the same BER. In addition, for situations where the channel state information （CSI） of forward link is available, the proposed BMDF can be further enhanced by combining with subcarrier pairing （SP） and power allocation （PA）, where a sorted-channel gain SP scheme and a greedy PA algorithm are proposed. The simulation results verify thesignificant performance improvement to the conventional DF.     

面向无缝拼接的并行反向光刻技术

Inverse lithography technology （ILT）, a promising resolution enhancement technology （RET） used in next generations of IC manufacture, has the capability to push lithography to its limit. However, the existing methods of ILT are either time-consuming due to the large layout in a single process, or not accurate enough due to simply block merging in the parallel process. The seamless-merging-oriented parallel ILT method proposed in this paper is fast because of the parallel process; and most importantly, convergence enhancement penalty terms （CEPT） introduced in the parallel ILT optimization process take the environment into consideration as well as environmental change through target updating. This method increases the similarity of the overlapped area between guard-bands and work units, makes the merging process approach seamless and hence reduces hot-spots. The experimental results show that seamless-merging-oriented parallel ILT not only accelerates the optimization process, but also significantly improves the quality of ILT.     

Network Virtualization Based Seamless Networking Scheme for Fiber-Wireless （FiWi） Networks

In order to reduce cost and complexity,fiber-wireless（FiWi） networks emerge,combining the huge amount of available bandwidth of fiber networks and the flexibility,mobility of wireless networks.However,there is still a long way to go before taking fiber and wireless systems as fully integrated networks.In this paper,we propose a network visualization based seamless networking scheme for FiWi networks,including hierarchical model,service model,service implementation and dynamic bandwidth assignment（DBA）.Then,we evaluate the performance changes after network virtualization is introduced.Throughput for nodes,bandwidth for links and overheads leaded by network virtualization are analyzed.The performance of our proposed networking scheme is evaluated by simulation and real implementations,respectively.The results show that,compared to traditional networking scheme,our scheme has a better performance.     

Relay Scheme Based on Distributed Luby Transform Codes for InterPlaNetary Internet

Distributed Luby Transform （DLT） codes have been proposed to improve the robustness and system throughputs for multisource single-sink networks by exploiting the benefits of Network Coding （NC） at a single relay. All the proposed schemes such as the DLT and Soliton-Like Rateless Coding （SLRC） have attempted to maintain Robust Soliton Distribution （RSD） or Soliton-Like Distribution （SLD） for the output data at the relay. This rzsult in some source symbols to be discarded, thereby degrading the throughput. In this paper, we have proposed a novel method called the Full DLT （FDLT） coding scheme to be applied in the InterPlaNetary （IPN） Internet scenario comprising two sources and one relay The aim of the proposed scheme is to fully utilise the source symbols so as to reduce the overheads and improve energy efficiencies at the sources while maintaining low overhead at the relay. In addition, almost no buffer is needed in the proposed scheme so the relay can have limited storage space, and the proposed scheme is resilient to the churn rates of the nodes. The simulation results have shown that the proposed scheme outperforms the aforementioned schemes with respect to source overheads and total overhead in addition to preserving the benefits of NC and LT codes.     

Rotation, scaling and translation invariant image watermarking using feature points

In this article, a novel robust image watermarking scheme is presented to resist rotation, scaling, and translation （RST）. Initially, the original image is scale normalized, and the feature points are then extracted. Furthermore, the locally most stable feature points are used to generate several nonoverlapped circular regions. These regions are then rotation normalized to generate the invariant regions. Watermark embedding and extraction are implemented in the invariant regions in discrete cosine transform domain. In the decoder, the watermark can be extracted without the original image. Simulation results show that the proposed scheme is robust to traditional signal processing attacks, RST attacks, as well as some combined attacks.     

OFDM系统在循环前缀不足时的两种高效迭代均衡方法

本文提出两种新的用于循环前缀(CP)不足时正交频分复用(OFDM)系统的迭代均衡方法。首先,我们提出并行迭代均衡(PIE)方法,该方法分别使用时域判决反馈方法和频域并行迭代方法来消除符号间干扰(ISI)和子载频间干扰(ICI)。为了改进PIE的性能,提出基于高斯-塞德尔迭代的串行迭代均衡(SIE)方法。在不增加计算复杂度的情况下,SIE具有比PIE更快的收敛速度。仿真结果表明,新方法可以在几次迭代后得到接近CP足够情况下的系统性能,PIE的性能与传统的迭代干扰消除方法相同,而SIE则提供好得多的收敛性能。     

Iterative packet combining schemes for intersymbol interferencechannels

We study packet combining techniques for retransmission schemes over intersymbol interference (ISI) channels. Two types of combining schemes are investigated, namely, maximum-likelihood combining (MLC) and iterative combining (IC). By first employing a precoding technique and then by interpreting the ISI channel as a trellis code, the transmissions of the same data packet at different times through the channel can be treated as the parallel concatenation of recursive trellis codes. If interleavers are used in between retransmissions, "turbo" coding gains can be achieved by iterative equalization. It is shown that IC provides excellent performance and outperforms other forms of combining in terms of frame error rate performance both analytically and through simulations     

Turbo-like iterative least-squares decoding of analogue codes

A turbo-like iterative decoding scheme for analogue product codes is described. It is proved that the iterative decoding method is an iterative projection in Euclidean space and converges to the least-squares solution. Using this geometric point of view, any block analogue codes can be decoded by a similar iterative method. The described procedure may serve as a step towards a more intuitive understanding of turbo decoding.     

A soft-input soft-output APP module for iterative decoding ofconcatenated codes

Concatenated coding schemes consist of the combination of two or more simple constituent encoders and interleavers. The parallel concatenation known as “turbo code” has been shown to yield remarkable coding gains close to theoretical limits, yet admitting a relatively simple iterative decoding technique. The recently proposed serial concatenation of interleaved codes may offer superior performance to that of turbo codes. In both coding schemes, the core of the iterative decoding structure is a soft-input soft-output (SISO) a posteriori probability (APP) module. In this letter, we describe the SISO APP module that updates the APP's corresponding to the input and the output bits, of a code, and show how to embed it into an iterative decoder for a new hybrid concatenation of three codes, to fully exploit the benefits of the proposed SISO APP module     

Mapping interleaving laws to parallel turbo decoder architectures

For high data rate applications, the implementation of iterative turbo-like decoders requires the use of parallel architectures posing some collision-free constraints to the reading/writing process in the soft-input soft-output (SISO) decoders. Contrary to the literature belief, we prove in this paper that the parallelism constraints can be met by any permutation law employed by the turbo-interleaver, and we give a constructive method to satisfy those constraints.     

Convergence rates comparison of sum-product decoding of RA codes under different message-passing schedules

In iterative decoding of turbo-like codes, serial schedule generally provides a much faster convergence rate compared with parallel schedule. With the aid of extrinsic information transfer (EXIT) charts, sum-product decoding of repeat accumulate (RA) codes under both message passing schedules is investigated as an example for verifying the above statement.     

迭代译码的级联Reed-Solomon乘积码与卷积码

该文提出用Reed Solomon(RS)乘积码作为外码,卷积码作为内码的级联码方案并且内外码间用Congruential向量生成的交织图案对RS码符号进行重排列。对此级联码采用的迭代译码基于成员码的软译码算法。当迭代次数达到最大后,通过计算RS码的校正子,提出一种纠正残余错误的方法,进一步提高了系统的误比特性能。仿真结果表明,在AWGN信道中与迭代译码的级联RS/卷积码相比,当误比特率为1e-5时,新系统的编码增益大约有0.4 dB。     

Coded modulation in the block-fading channel: coding theorems and code construction

We consider coded modulation schemes for the block-fading channel. In the setting where a codeword spans a finite number N of fading degrees of freedom, we show that coded modulations of rate R bit per complex dimension, over a finite signal set /spl chi//spl sube//spl Copf/ of size 2/sup M/, achieve the optimal rate-diversity tradeoff given by the Singleton bound /spl delta/(N,M,R)=1+/spl lfloor/N(1-R/M)/spl rfloor/, for R/spl isin/(0,M/spl rfloor/. Furthermore, we show also that the popular bit-interleaved coded modulation achieves the same optimal rate-diversity tradeoff. We present a novel coded modulation construction based on blockwise concatenation that systematically yields Singleton-bound achieving turbo-like codes defined over an arbitrary signal set /spl chi//spl sub//spl Copf/. The proposed blockwise concatenation significantly outperforms conventional serial and parallel turbo codes in the block-fading channel. We analyze the ensemble average performance under maximum-likelihood (ML) decoding of the proposed codes by means of upper bounds and tight approximations. We show that, differently from the additive white Gaussian noise (AWGN) and fully interleaved fading cases, belief-propagation iterative decoding performs very close to ML on the block-fading channel for any signal-to-noise ratio (SNR) and even for relatively short block lengths. We also show that, at constant decoding complexity per information bit, the proposed codes perform close to the information outage probability for any block length, while standard block codes (e.g., obtained by trellis termination of convolutional codes) have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called "interleaving gain" of turbo codes.     

Efficient SIC-MMSE MIMO detection with three iterative loops

In this paper, we propose an efficient joint iterative detection and decoding (JIDD) scheme with a soft interference cancellation minimum mean squared error (SIC-MMSE) based method for a turbo coded multiple-input multiple-output (MIMO) system. In the proposed method, we activate a loop inside the SIC-MMSE based MIMO detection process in addition to the iterative loop between the MIMO detector and turbo decoder, so that the iteration inside the SIC-MMSE detection can be performed in parallel to the iterations inside the turbo decoder. Subsequently, soft outputs from each loop is exchanged for next further iteration, and this makes three iterative loops in total. In comparison with the conventional JIDD schemes, employing additional loop inside the MIMO detection process largely contributes to enhance the performance. In addition, the additional loop speeds up the performance convergence and eventually requires smaller overall computational complexity at the same performance.     

Mapping interleaving laws to parallel turbo and LDPC decoder architectures

For high-data-rate applications, the implementation of iterative turbo-like decoders requires the use of parallel architectures posing some collision-free constraints to the reading/writing process from/into the memory. This consideration applies to the two main classes of turbo-like codes, i.e., turbo codes and low-density parity-check (LDPC) codes. Contrary to the literature belief, we prove in this paper that there is no need for an ad hoc code design to meet the parallelism requirement, because, for any code and any choice of the scheduling of the reading/writing operations, there is a suitable mapping of the variables in the memory that grants a collision-free access. The proof is constructive, i.e., it gives an algorithm that obtains the desired collision-free mapping. The algorithm is applied to two simple examples, one for turbo codes and one for LDPC codes, to illustrate how the algorithm works.