In this letter, we propose combinatorial and search construction methods of 2-D multi-weight optical orthogonal codes (OOCs) with autocorrelation 0 and crosscorrelation 1, called multi-weight single or no pulse per row (MSNPR) codes. An upper bound on the size of MSNPR codes is derived and the performance of MSNPR codes is compared to those of other OOCs in terms of the bit error rate (BER) and evaluated using blocking probability. It is also demonstrated that the MSNPR codes can be flexibly constructed for different applications, providing the scalability to optical CDMA networks.

Many selected mapping (SLM) schemes have been proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signal sequences. In this paper, an efficient selection (ES) method of the OFDM signal sequence with minimum PAPR among many alternative OFDM signal sequences is proposed; it supports various SLM schemes. Utilizing the fact that OFDM signal components can be sequentially generated in many SLM schemes, the generation and PAPR observation of the OFDM signal sequence are processed concurrently. While the u-th alternative OFDM signal components are being generated, by applying the proposed ES method, the generation of that alternative OFDM signal components can be interrupted (or stopped) according to the selection criteria of the best OFDM signal sequence in the considered SLM scheme. Such interruption substantially reduces the average computational complexity of SLM schemes without degradation of PAPR reduction performance, which is confirmed by analytical and numerical results. Note that the proposed method is not an isolated SLM scheme but a subsidiary method which can be easily adopted in many SLM schemes in order to further reduce the computational complexity of considered SLM schemes.

It is known that in the selected mapping (SLM) scheme for orthogonal frequency division multiplexing (OFDM), correlation (CORR) metric outperforms the peak-to-average power ratio (PAPR) metric in terms of bit error rate (BER) performance. It is also well known that four times oversampling is used for estimating the PAPR performance of continuous OFDM signal. In this paper, the oversampling effect of OFDM signal is analyzed when CORR metric is used for the SLM scheme in the presence of nonlinear high power amplifier. An analysis based on the correlation coefficients of the oversampled OFDM signals shows that CORR metric of two times oversampling in the SLM scheme is good enough to achieve the same BER performance as four times and 16 times oversampling cases. Simulation results confirm that for the SLM scheme using CORR metric, the BER performance for two times oversampling case is almost the same as that for four and 16 times oversampling cases.

In this letter, we analyze the convergence speed of layered decoding of block-type low-density parity-check codes and verify that the layered decoding gives faster convergence speed than the sequential decoding with randomly selected check node subsets. Also, it is shown that using more subsets than the maximum variable node degree does not improve the convergence speed.

In this paper, the cross-correlation distribution between a p-ary m-sequence s(t) and its p + 1 distinct decimated sequences s(dt + l) is derived. For an odd prime p, an even integer n, and d = pk +1 with gcd(n, k) = 1, there are p + 1 distinct decimated sequences s(dt + l), 0 ≤ l < p + 1, for a p-ary m-sequence s(t) of period pn -1 because gcd(d, pn - 1) = p + 1. The maximum magnitude of their cross-correlation values is 1 + p if l ≡ 0 mod p + 1 for n ≡ 0 mod 4 or l ≡ (p + 1)/2 mod p + 1 for n ≡ 2 mod 4 and otherwise, 1 + . Also by using s(t) and s(dt + l), a new family of p-ary sequences of period pn -1 is constructed, whose family size is pn and Cmax is 1 + p.

The probability of making mistakes on the decoded signals at the relay has been used for the maximum-likelihood (ML) decision at the receiver in the decode-and-forward (DF) relay network. It is well known that deriving the probability is relatively easy for the uncoded single-antenna transmission with M-pulse amplitude modulation (PAM). However, in the multiplexing multiple-input multiple-output (MIMO) transmission, the multi-dimensional decision region is getting too complicated to derive the probability. In this paper, a high-performance near-ML decoder is devised by applying a well-known pairwise error probability (PEP) of two paired-signals at the relay in the MIMO DF relay network. It also proves that the near-ML decoder can achieve the maximum diversity of MSMD+MR min (MS,MD), where MS, MR, and MD are the number of antennas at the source, relay, and destination, respectively. The simulation results show that 1) the near-ML decoder achieves the diversity we derived and 2) the bit error probability of the near-ML decoder is almost the same as that of the ML decoder.