二维光码分多址的地址码及干扰估计接收机

阐述了自相关旁瓣为0，互相关值小于等于1的二维光正交码(2D-OOC)的新构造方法及非同步频域跳频时域扩频二维光码分多址(2D-OCDMA)系统中的干扰估计接收机模型。二维光正交码的新构造方法以两个单极性码分别作为频域跳频模式和时域扩频模式。用作频域跳频模式的地址码是自相关旁瓣及互相关值小于等于1的一维光正交码(1D-OOC)，用作时域扩频模式的地址码其码长为素数或码长与码中任意两个非零码元的位置差值互质。将一个没有分配给任何用户并且和接收用户地址码正交的地址码用作干扰估计码来得到多用户干扰(MUI)估计值，从而得到最佳的判决门限。系统误码率(BER)的分析显示干扰估计接收机系统的性能要优于传统的接收机系统。     

A New Family of Wavelength-Time Optical CDMA Codes Utilizing Programmable Arrayed Waveguide Gratings

A two-dimensional, so-called wavelength-hopping time-spreading, optical code-division multiple-access coding scheme has recently been studied for supporting more subscribers and simultaneous users than conventional one-dimensional techniques. To further improve the numbers of subscribers and simultaneous users without sacrificing performance, a new code, which utilizes the unipolar version of bipolar codes (for wavelength hopping) and optical unipolar codes (for time spreading), is studied and analyzed in this paper. A programmable and integratable coding hardware based on arrayed waveguide gratings is designed for this coding scheme.     

双极性光码分复用系统的研究

对光码分多址（OCDMA）系统中的地址码，包括单极性码和双极性码的容量和性能进行了分析比较，给出了4种双极性编码方案。单极性系统无论是在确定误码率条件和同时传输用户数方面，还是在系统总用户数方面，都远不及双极性系统，双极性系统是OCDMA系统实现大容量的有效途径之一。     

Proposal of Novel Optical Polarity-Reversing Correlator for Optical CDMA Radio Highway Network

This paper proposes a new optical polarity-reversing correlator for opticalCDMA radio highway network. We theoretically analyze thecarrier-to-interference-plus-noise power ratio of regenerated radio signal atthe control station. Analysis results clarify that optical CDMA using bipolarcode sequences can be applied to the fiber-optic link of radio highway and wecan assign more distinct code sequences to radio base stations compared withthe unipolar type correlator using prime codes. By the proposed opticalpolarity-reversing correlator using Gold codes, thecarrier-to-interference-plus-noise ratio can be more improved than theunipolar type correlator using prime codes. It is also found that for smalltransmitted optical peak power, the proposed optical polarity-reversingcorrelator using Gold codes can improve the number of maximum connected radiobase stations much more compared with the unipolar type correlator using primecodes.     

An OCDMA Scheme to Reduce Multiple Access Interference and Enhance Performance for Optical Subscriber Access Networks

We propose a new optical code division multiple access (OCDMA) scheme for reducing multiple access interference (MAI) and enhancing performance for optical subscriber access networks using modified pseudorandom noise (PN)‐coded fiber Bragg gratings with bipolar OCDMA decoders. Through the bipolar OCDMA decoder and the modified PN codes, MAI among users is effectively depressed. As the data are encoded either by a unipolar signature sequence of the modified PN code or its complement according to whether the data bit is 1 or 0, the bit error ratio (BER) can be more improved with the same signal to interference plus noise ratio over the conventional on‐off shift keying‐based OCDMA system. We prove by numerical analysis that the BER of the proposed bipolar OCDMA system is better than the conventional unipolar OCDMA system. We also analyze the spectral power distortion effects of the broadband light source.     

On efficient code acquisition of optical orthogonal codes in optical CDMA systems

This letter presents an efficient method for optical code division multiple access (OCDMA) code acquisition based on unipolar optical orthogonal codes. We propose a two-dwell acquisition procedure and provide closed form expressions to analyze the system?s error probabilities. Our results match the Multiple Shift (MS) algorithm, recently introduced in the literature, and show that our procedure can achieve the same system performance with a lower computational complexity.     

A modified topology achieved in OFDM/SAC-OCDMA-based multi-diagonal code for enhancing spectral efficiency

In this paper, a modified topology-based orthogonal frequency division multiplexing–spectral amplitude coding in optical code division multiple access (OFDM–SAC-OCDMA) has been introduced. Such analysis aims to explain the effect of spectral efficiency with respect to multi-diagonal (MD) code. The new proposed technique introduces a fusion system between the two-code keying scheme and the forward error correction (FEC). The introduced analysis has targeted the effect of signal-to-noise ratio, bit error rate, and spectral efficiency with the presence of beat noise, phase incoherent intensity noise, and thermal noise. Numerical simulations have been utilized and tested in order to illustrate the validation of the (MD) code method to eliminate dominant noise. The calculation results show the following; the SNR and BER for MD under the presence of the previous discussed signal degradation is equal 161 and 1.2?×?10^?10, respectively, according to a predefined number of users 150 comparing with some existing codes such as: modified frequency hopping code, Hadamard (HD) code, modified quadratic congruence code. The proposed unipolar encoding with direct detection technique-based OFDM/SAC-OCDMA scheme achieves an enhancement in the performance of SE over the unipolar encoding with direct detection technique-based SAC-OCDMA technique by 3.455 dB. The proposed two keying scheme-based OFDM/SAC-OCDMA introduces an enhancement in the performance of the SE over the unipolar encoding with direct detection technique-based OFDM/SAC-OCDMA technique by 2.8859 dB. FEC has been applied in order to increase the spectral efficiency for different BERs, which the numerical results show that FEC provides 1.7457 dB. Finally, the total enhancement for SE was about 8.0866 dB.

     

一种新的二相码旁瓣抑制滤波器

二相编码是一种在雷达脉冲压缩中得到广泛应用的波形,但是一般的二相码波形的旁瓣抑制算法只适用于短码(如Barker码等),且设计得到的滤波器阶数比较高。本文提出了一种新的基于时域综合的二相码旁瓣抑制滤波器,能适用于各种长度的二相码,包括m序列等。文中给出了m序列和Barker码旁瓣抑制滤波器结果,并与现有的滤波器性能进行了比较。     

Optical domain service differentiation using spectral-amplitude-coding

We have implemented a new service differentiation technique in the optical domain using a spectral-amplitude-coding (SAC) variant of optical code division multiple access (OCDMA). The newly developed code, named KS (Khazani–Syed) is compared mathematically with other codes which use similar techniques. In our proposal, multiple weights are used to support ‘triple-play’ services (audio, video and data) with different quality-of-service (QoS) requirements. The results characterizing the bit-error-rate (BER) with respect to the total number of active users show that KS offers a significantly improved performance over the previous reported techniques by accommodating additional 30 users with shorter code length and smaller code weight at BER of 10^?9. In variable weight system, we have shown that KS codes with larger weight always have the best performance when other users of different weights are present in the system.     

A rank criterion for QAM space-time codes

Space-time coding has been studied extensively as a powerful error correction coding for systems with multiple transmit antennas. An important design goal is to maximize the level of space diversity that a code can achieve. Toward this goal, the only systematic algebraic coding theory so far is binary rank theory by Hammons and El Gamal (see ibid. vol. 46, p.524-42, 2000) for binary phase-shift keying (BPSK) modulated codes defined over binary field and quaternary phase-shift keying (QPSK) modulated codes defined over modulo four finite ring. To design codes with higher bandwidth efficiency, we develop an algebraic rank theory to ensure full space diversity for 2/sup 2k/ quadrature and amplitude modulated (QAM) codes for any positive integer k. The theory provides the most general sufficient condition of full space diversity so far. It includes the BPSK binary rank theory as a special case. Since the condition is over the same domain that a code is defined, the full space diversity code design is greatly simplified. The usefulness of the theory is illustrated in examples, such as analyses of existing codes, constructions of new space-time codes with better performance, including the full diversity space-time turbo codes.     

Two-dimensional optical orthogonal codes for fiber-optic CDMA networks

Several constructions of two-dimensional (2-D) codes have been proposed to overcome the drawbacks of nonlinear effects in large spread sequences of one-dimensional (1-D) unipolar codes in fiber-optic code-division multiple-access (FO-CDMA) networks. Wavelength-time (W/T) encoding of the 2-D codes is practical in FO-CDMA networks. W/T codes reported so far can be classified mainly into two types: 1) hybrid codes, where one type of sequence is crossed with another to improve the cardinality and correlation properties and 2) conversion of 1-D sequences to 2-D codes to reduce the "timelike" property. This paper describes the basic principles of a new family of wavelength/time multiple-pulses-per-row (W/T MPR) codes, for incoherent FO-CDMA networks, which have good cardinality, spectral efficiency, and minimal cross correlation values. In addition, an expression for the upper bound on the cardinality of W/T MPR codes is derived. Another feature of the W/T MPR codes is that the aspect ratio can be varied by a tradeoff between wavelength and temporal lengths. The correlation properties of W/T MPR codes are verified by simulation using Matlab. For given wavelength /spl times/ time dimensions, various W/T codes, whose cardinalities are known, are compared, and it is shown that the W/T MPR family of codes have better cardinality and spectral efficiency than the other W/T codes. Performance analysis of the W/T MPR codes and their limiting cases is carried out for various parameter variations such as the dimensions of wavelength, time, and weight of the code.     

A practical method for approaching the channel capacity ofconstrained channels

A new coding technique is proposed that translates user information into a constrained sequence using very long codewords. Huge error propagation resulting from the use of long codewords is avoided by reversing the conventional hierarchy of the error control code and the constrained code. The new technique is exemplified by focusing on (d, k)-constrained codes. A storage-effective enumerative encoding scheme is proposed for translating user data into long dk sequences and vice versa. For dk runlength-limited codes, estimates are given of the relationship between coding efficiency versus encoder and decoder complexity. We show that for most common d, k values, a code rate of less than 0.5% below channel capacity can be obtained by using hardware mainly consisting of a ROM lookup table of size 1 kbyte. For selected values of d and k, the size of the lookup table is much smaller. The paper is concluded by an illustrative numerical example of a rate 256/466, (d=2, k=15) code, which provides a serviceable 10% increase in rate with respect to its traditional rate 1/2, (2, 7) counterpart     

A fast low‐density parity‐check code simulator based on compressed parity‐check matrices

Low‐density parity‐check (LDPC) codes are very powerful error‐correction codes with capabilities approaching the Shannon's limits. In evaluating the error performance of an LDPC code, the computer simulation time taken becomes a primary concern when tens of millions of noise‐corrupted codewords are to be decoded, particularly for codes with very long lengths. In this paper, we propose modeling the parity‐check matrix of an LDPC code with compressed parity‐check matrices in the check‐node domain (CND) and in the bit‐node domain (BND), respectively. Based on the compressed parity‐check matrices, we created two message matrices, one in the CND and another in the BND, and two domain conversion matrices, one from CND to BND and another from BND to CND. With the proposed message matrices, the data used in the iterative LDPC decoding algorithm can be closely packed and stored within a small memory size. Consequently, such data can be mostly stored in the cache memory, reducing the need for the central processing unit to access the random access memory and hence improving the simulation time significantly. Furthermore, the messages in one domain can be easily converted to another domain with the use of the conversion matrices, facilitating the central processing unit to access and update the messages. Copyright © 2011 John Wiley & Sons, Ltd.     

Symbol error probability for guided scrambling over a recording channel

We derive expressions for the symbol error probabilities for a recording code concatenated with a Reed-Solomon (RS) code. The recording code is structured by a guided scrambling (GS) code for the direct current (DC) suppression in conjunction with a runlength-limited (RLL) code. As for the GS codes, convolutional GS and Galois field (GF) addition GS schemes are examined. As for the RLL codes, two types of RLL codes are investigated. One is a traditional RLL code where a bit length m of an RS symbol is an integer multiple of a bit length p of an RLL source symbol. The other is a new type of high-rate RLL code where p>m. We compute the RS symbol error rates when these RLL codes are combined with the two GS schemes.     

BER performance of turbo-coded PPM CDMA systems on optical fiber

We obtain upper bounds on the bit error rate (BER) for turbo-coded optical code-division multiple-access (CDMA) systems using pulse position modulation (PPM). We use transfer function bounding techniques to obtain these bounds, so our results correspond to the average bound over all interleavers of a given length. We consider parallel concatenated coding (PCC) schemes that use recursive convolutional codes as constituent codes. We consider systems using an avalanche photodiode (APD), and treat APD noise, thermal noise, and multi-user interference using a Gaussian approximation. We compare the performance of turbo-coded systems with that of BCH-coded systems with soft-decision decoding, and that of concatenated coding systems with outer Reed-Solomon (RS) code and inner convolutional code. We show that turbo-coded systems have better performance than BCH-coded systems. We also show that concatenated systems have better performance than turbo-coded systems when the block length is small and the received laser power is somewhat large     

Multiple-shift code acquisition of optical orthogonal codes in optical CDMA systems

In this paper, we introduce a new and advanced algorithm, namely, multiple-shift algorithm for code acquisition in optical code-division multiple access (CDMA) systems using unipolar optical orthogonal codes (OOCs) as signature sequences. We analyze the performance of the newly proposed algorithm and obtain a bound on its performance and show its advantage in reducing the mean time of synchronization when compared with other synchronization methods. The algorithm can be used with many different receiver structures, like active or passive correlator with or without hardlimiter(s). However, in this paper, we only consider the simple active correlator structure for further discussions and analysis.     

On the algebraic structure of quasi-cyclic codes .I. Finite fields

A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese remainder theorem (CRT), or of the discrete Fourier transform (DFT), that ring can be decomposed into a direct product of fields. That ring decomposition in turn yields a code construction from codes of lower lengths which turns out to be in some cases the celebrated squaring and cubing constructions and in other cases the (u+υ|u-υ) and Vandermonde constructions. All binary extended quadratic residue codes of length a multiple of three are shown to be attainable by the cubing construction. Quinting and septing constructions are introduced. Other results made possible by the ring decomposition are a characterization of self-dual quasi-cyclic codes, and a trace representation that generalizes that of cyclic codes     

Expansion of existing EM workbench for multiple computational electromagnetics codes

An "EM workbench" is described. It has a modular, code-independent architecture and a common design environment. The technique for integrating new EM codes is demonstrated with a method-of-moments code specialized for circularly symmetric feed horns, and with a new hybrid DFT-MoM (discrete Fourier transform - method of moments) code for finite-boundary planar phased arrays. The use of a common design environment for all codes takes advantage of common infrastructure and utility software, and minimizes the learning-curve penalty for using a new EM code capability.     

Space–Time Trellis Codes Based on Channel-Phase Feedback

Space-time coding (STC) has been proposed recently for multiple-antenna wireless communication systems. Most of the proposed STC schemes use the assumption that either no channel-state information, or the channel mean/covariance information, is available at the transmitter. In this paper, we propose a new STC scheme for a closed-loop transmission system, where quantized channel-phase information is available at the transmitter. A new performance criterion is derived for the quasi-static fading channel. This design criterion is then used to construct a new class of space-time trellis codes (STTCs). The proposed code construction is based on the concatenation of a standard multiple trellis-coded modulation outer code with an inner code. The inner code is selected from a series of inner codes using the channel-phase feedback. The series of inner codes are constructed based on the systematic set partitioning of several classes of space-time signal designs. Simulation results show significant performance improvement over the other STTCs in the literature. In addition, the proposed coding scheme enjoys low peak-to-average-power ratio, simple decoding, and power-efficient low-cost implementation