Orthogonal Codes-Based Dynamic Spectrum Access in Cognitive Radio Networks

Dynamic spectrum access(DSA) in cognitive radio(CR) networks became a challenging research area recently. In CR technology, the DSA between primary users(PUs) and secondary users(SUs) simultaneously can be achieved without degrading the performance of the PUs by SUs interference. This can be achieved by donating incentive power to the PUs in order to compensate the interference caused by the SUs. Consequently, PUs allow SUs to share the spectrum. In this paper, orthogonal codes-based dynamic spectrum access(OC-DSA) technique is proposed. OC-DSA technique employs orthogonality between PUs and SUs transmitted data symbols in addition to the incentive power donation. Compared to other techniques, the proposed technique uses a simple encoder at the SU network for the same PU network infrastructure. By applying orthogonal codes, the interference caused by SUs is canceled and hence the donated power to incentivize the PUs is reduced. Also, the SU packet rate is increased significantly. The simulation results show that the proposed technique provides effective improvements over other existing techniques in the signal strength and the bit error rate performance of both the PU network and the SU network at the receiver side. Moreover, the proposed technique requires less donated power to incentivize the PU and has higher packet rate.

Performance Analysis of Narrowband Interference Suppression in Orthogonal Code Modulation Spread Spectrum System

This paper analyzes the performance of both in-band and outband narrowband interference suppression in orthogonal code modulation spread spectrum system, and compares with conventional spread spectrum system at the same information transmission rate and spread spectrum bandwidth. Simulation results indicate that the antijamming (narrowband interference) performance obtained from orthogonal code modulation spread spectrum system is much better than that from conventional spread spectrum system.

An Approach to a Method of Construction of (F, K, 1) Optical Orthogonal Codes from Block Design

F, K, 1) Optical orthogonal codes (OOC) are the best address codes applied to optical code division multiple access (OCDMA) communication systems, but the construction of the codes is very complex. In this paper, a method of construction of the OOC from block design is discussed and a method of computer aid design is presented, by which we can construct desired (F, K, 1) OOC easily.

Linear Dispersion Orthogonal Space-Time Block Codes

A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.

Performance of MIMO Systems Using Space Time Block Codes (STBC)

Digital Communications, in relation to wireless networks, have taken off in recent years due to the expanding need to communicate faster and more efficiently. A popular way to achieve this is by using wireless Multiple Input Multiple Output (MIMO) communication systems. MIMO systems utilize Space Time Block Codes (STBC) as one of the leading ways to obtain higher data rates with limited bandwidth and power. With several STBC methods currently available, this paper analyzes simulations using Orthogonal Space Time Block Codes (OSTBC) in Rayleigh fading channels to evaluate the performance of MIMO systems. The selection to use a Rayleigh fading channel as a model for a non-line-of-sight (nLOS) environment is selected to mimic installations where a large number of signal paths and reflections are expected. All simulations are coded, generated and plotted using MATLAB resulting in graphical data representing the bit-error rate (BER) to signal-to-noise ratio (Eb/N0) or SNR. Each simulation captures how different configurations of key variables including code rate, diversity and antenna count can impact system performance. Four modulation schemes (BPSK, QPSK, 16-QAM and 64-QAM) are included in each simulation. Conclusive evidence based upon these simulations suggests higher diversity gains were achieved with a greater number of antennas. The most significant factor for increasing system performance was using a lower count of transmit antennas with a higher count of receive antennas.

Security in Multicast Over α-μ Fading Channels with Orthogonal Frequency Division Multiplexing

The orthogonal space-frequency block coding (OSFBC) with orthogonal frequency division multiplexing (OFDM) system reduces complexity in the receiver which improves the system performance significantly. Motivated by these advantages of OSFBC-OFDM system, this paper considers a secure wireless multicasting scenario through multiple-input multiple-output (MIMO) OFDM system employing OSFBC over frequency selective α-μ fading channels. The authors are interested to protect the desired signals from eavesdropping considering the impact of the number of multicast users and eavesdroppers, and the fading parameters α and μ. A mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multi-casting (SOPM) to ensure the security in the presence of multiple eaves-droppers. The results show that the security in MIMO OSFBC OFDM system over α-μ fading is more sensitive to the magnitude of α and μ and this effect increases in the high signal-to-noise ratio (SNR) region of the main channel.

一种新的无人机数据链抗干扰技术研究(英文)

Based on the M-ary spread spectrum （M-ary-SS）, direct sequence spread spectrum （DS-SS）, and orthogonal frequency division multiplex （OFDM）, a novel anti-jamming scheme, named orthogonal code time division multi-subchannels spread spectrum modulation （OC-TDMSCSSM）, is proposed to enhance the anti-jamming ability of the unmanned aerial vehicle （UAV） data link. The anti-jamming system with its mathematical model is presented first, and then the signal formats of transmitter and receiver are derived. The receiver＇s bit error rate （BER） is demonstrated and anti-jamming performance analysis is carded out in an additive white Ganssian noise （AWGN） channel. Theoretical research and simulation results show the anti-jamming performance of the proposed scheme better than that of the hybrid direct sequence frequency hopping spread spectrum （DS/FH SS） system. The jamming margin of the OC-TDMSCSSM system is 5 dB higher than that of DS/FH SS system under the condition of Rician channel and full-band jamming, and 6 dB higher under the condition of Rician channel environment and partial-band jamming.

Maximum two-dimensional (u×v,4,1,3)-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.

Synchronization of MIMO OFDM systems by perfect complete generalized complementary orthogonal loosely synchronous code groups

This article proposes a time/frequency synchronization algorithm in the multiple input multiple output （MIMO） systems, in which the perfect complete generalized complementary orthogonal loosely synchronous code groups are used as the synchronization sequence. The synchronization algorithm is divided into four stages： 1） synchronization in time domain by signal autocorrelation; 2） synchronization in frequency domain by fast Fourier transform （FFT）; 3） multipath dissociation using coherent detection and fine time synchronization; 4） fine frequency offset estimation by phase rotation. As per the perfect complete generalized complementary orthogonal loosely synchronous code groups, the cross-correlation and out-of-phase auto-correlation for any relative shift between any two codes is always zero. This ideal property makes the time/frequency synchronization algorithm simple and efficient. The simulation results show that even in the multipath fast fading channel with low signal noise ratio （SNR）, the MIMO system can get synchronized both in the time domain and frequency domain with high stability and reliability.

Construction of deterministic sensing matrix and its application to DOA estimation

Compressive sensing（CS） has emerged as a novel sampling framework which enables sparse signal acquisition and reconstruction with fewer measurements below the Nyquist rate.An important issue for CS is the construction of measurement matrix or sensing matrix.A new deterministic sensing matrix,named as OOC-B,is proposed by exploiting optical orthogonal codes（OOCs）,Bernoulli matrix and Singer structure,which has the entries of 0,＋1 and-1 before normalization.We have proven that the designed deterministic matrix is asymptotically optimal.In addition,the proposed deterministic sensing matrix is applied to direction of arrival（DOA） estimation of narrowband signals by CS arrays（CSA）processing and CS recovery.Theoretical analysis and simulation results show that the proposed sensing matrix has good performance for DOA estimation.It is very effective for simplifying hardware structure and decreasing computational complexity in DOA estimation by CSA processing.Besides,lower root mean square error（RMSE） and bias are obtained in DOA estimation by CS recovery.

MIMO-DCSK communication scheme and its performance analysis over multipath fading channels

The differential chaotic shift keying （DCSK） communication in multiple input multiple output （MIMO） multipath fading chan- nels is considered. A simple MIMO-DCSK communication scheme based on orthogonal multi-codes （OMCs） and equal gain combination （EGC） is proposed, in which OMCs are used to spread the same information bit at each transmitting antenna and the infor- mation bit is detected by EGC at receiving antenna. The OMCs are constructed from one chaotic sequence by means of othogo- nal space-time block coding （OSTBC）. The output signal-to-noise ratio （SNR） after EGC is given based on central limit theory （CLT）, and it can effectively exploit the spatial diversity of the underlying MIMO system. Simulation results show that the full spatial diversity gain is achieved without channel estimation in the MIMO-DCSK communication scheme and it performs better than MC-EGC for a large number of transmitting antennas.

Prove the Minimal Delay of Complex Orthogonal Space-Time Block Code by Hadamard Matrix

The complex orthogonal designs with maximal rates and minimal delays is an open problem for space-time block code. Maximal rate can effectively transmit symbols to the lonest distance in the space dimension ; and minimal delay is the least decoding delay in the time dimension. Many authors have observed that regarding the complex orthogonal designs for space-time block codes with the antennas n = 4k （ k ∈ N ）, its minimal delay is the same as that for n - 4k -1. However none was able to prove it. In this paper, we use the characteristics of Hadamard matrix to prove this property to fulfill this vacancy.

Capacity of orthogonal space-time block codes in MISO fading channels with co-channel interference and noise

Orthogonal space-time block codes （OSTBCs） are an efficient mean in order to exploit the diversity offered by the wireless multiple-input multiple-output （MIMO） channel. This paper considers capacity problems of OSTBCs over spatially correlated multiple-input single-out （MISO） Rayleigh fading channels in the presence of spatially correlated Rayleigh co-channel interference and additive Gaussian noise, and derives exact expressions of the ergodic capacity and outage probability （capacity distribution） for such OSTBCs. Some numerical examples are given to illustrate the effect of co-channel interference on the ergodic and outage capacity of OSTBCs.

Fast determination of meso-level mechanical parameters of PFC models

To solve the problems of blindness and inefficiency existing in the determination of meso-level mechanical parameters of particle flow code (PFC) models, we firstly designed and numerically carried out orthogonal tests on rock samples to investigate the correlations between macro-and meso-level mechanical parameters of rock-like bonded granular materials. Then based on the artificial intelligent technology, the intelligent prediction systems for nine meso-level mechanical parameters of PFC models were obtained by creating, training and testing the prediction models with the set of data got from the orthogonal tests. Lastly the prediction systems were used to predict the meso-level mechanical parameters of one kind of sandy mudstone, and according to the predicted results the macroscopic properties of the rock were obtained by numerical tests. The maximum relative error between the numerical test results and real rock properties is 3.28% which satisfies the precision requirement in engineering. It shows that this paper provides a fast and accurate method for the determination of meso-level mechanical parameters of PFC models.

Evaluations of Novel Waveform Coding Signals Based on Finite Projective Plane

The most popular and representative classic waveform codes are referred to as orthogonal,bi-orthogonal,simplex,and etc,but the choice of waveform codes is essentially identical in error performance and cross correlation characteristic.Though bi-orthogonal coding requires half the bandwidth of the others,such coding scheme is attractive only when large bandwidth is available.In this paper,a novel finite projective plane（FPP） based waveform coding scheme is proposed,which is with similar error performance and cross correlation.Nevertheless,the bandwidth requirement will grow in a quadratic way,but not in an exponential way with the values of message bit numbers（k）.The proposed scheme takes obvious advantages over the bi-orthogonal scheme when k ≥ 6.

A New Performance Analysis Method of Optical Code Division Multiple Access Systems with An Optical Hard-Limiter

A new performance analysis method of Optical Code Division Multiple Access ( OCDMA ) systems with an optical hard limiter is studied. The bit error probability of the OCDMA system is derived, and the numerical results of the system with and without an ideal optical hard limiter are analyzed respectively. The results show that although the derived expression is different from the one derived by J A Salehi , the numerical results are the same as those analyzed by J A Salehi, and the numerical result can be easily achieved in this expression.

Optical PPM-CDMA Communication System with Optical Hard Limiter

An optical PPM CDMA communication system with an optical hard limiter in front of the correlator of a receiver is proposed in order to reduce multi user interference. The performance of the system is evaluated when the effects of both multi user interference and photo detector shot noise are considered. An upper bound on the bit error rate is derived. The comparison of the performance of the above receiver with that of the optical PPM CDMA system without an optical hard limiter is made. Simulation results show that the performance of the system with an optical hard limiter is superior to that of the conventional one.

Constructions of optimal variable-weight OOCs via quadratic residues

Variable-weight optical orthogonal code （OOC） was introduced by G. C. Yang [IEEE Trans. Commun., 1996, 44： 47-55] for multimedia optical CDMA systems with multiple quality of service （QoS） requirements. In this paper, seven new infinite classes of optimal （v, {3,4,6}, 1, Q）-OOCs are constructed.

The Existence of (v,4,1) Disjoint Difference Families with a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.