Multilayered linear dispersion codes for flat fading multiple-input multiple-output channels

The authors investigate the design of linear dispersion (LD) codes, aiming at flexible encoding schemes that allow various rate-performance tradeoffs under a common coding structure. First, the capacity of LD codes is studied. It is shown that the maximum attainable multiplexing gain of a linear dispersion code is the number of symbols per channel use of the code (i.e. coding rate in symbols). In addition, conditions on the construction of linear dispersion matrices for various multiplexing gains are established. A general multilayered linear dispersion coding scheme that allows various multiplexing gains is then proposed. In the proposed scheme, coding rate can be adapted by employing different numbers of dispersion matrices. Furthermore, phase shifting among input symbols is applied to optimise the error performance without loss of multiplexing gain. The construction of dispersion matrices and the optimisation of the phase shifts together constitute a structured approach for the design of linear dispersion codes. Simulation results demonstrate that the new codes outperform conventional LD codes at various data rates.     

Coding techniques for link adaptation in multicarrier systems

A novel technique for improving coding and diversity gains in orthogonal frequency division multiplexing (OFDM) systems is proposed. Multidimensional symbol design based on complex field codes with interleaving across frequency has been known for some time now. However, such symbols cannot be concatenated to convolutional codes owing to the prohibitive complexity of decoding. A novel way of designing multidimensional symbols that allow to concatenate them to convolutional codes while maintaining a low decoding complexity is shown. The proposed multidimensional symbols are based on tailbiting convolutional codes and the design of codes is discussed with desirable properties. Also the design of bit interleaved coded modulation-type and trellis-coded modulation-type codes over these multidimensional symbols is shown. Simulations show that the proposed coding scheme provides significant performance and/or complexity improvements over existing alternatives and also provides more degrees of freedom for channel-based link adaptation.     

DC-free trellis-based error-control codes

Trellis-based error-control (EC) codes, such as convolutional or turbo codes, are integrated with guided scrambling (GS) multimode coding to generate DC-free GS-convolutional/ turbo codes. On the basis of the generators of the convolutional/turbo code, we employ puncturing or flipping to ensure that the EC-coded sequences are DC-free. At the receiver, convolutional/turbo decoding is performed before GS decoding to circumvent the performance degradation that can occur when GS decoding is performed prior to EC decoding. Performance of the new DC-free GS-convolutional/turbo codes is evaluated in terms of both spectral suppression and bit error rate (BER). It is shown that the new codes can provide superior BER performance and approximately the same suppression of low frequencies as the conventional concatenation of convolutional/turbo codes and DC-free GS codes.     

Error-detecting unit-distance code

A particular kind of unit-distance code is proposed. Unit-distance codes are applied especially to absolute encoders (linear or rotary). The various positions of the encoder are represented by the various code words of the code. In contrast to conventional unit-distance codes, this code offers the possibility of detecting all single-bit errors except the two single-bit errors that cause a code word which represents the adjacent position. Unit-distance codes are characterized by a Hamming distance of 1. Thus, Hamming distance is not a unit of measurement for the code's error-detection ability. Therefore, a Hamming distance is defined especially for unit-distance codes excluding the adjacent code words from the calculation of distances. An application shows the utility of the code in the field of instrumentation and measurement     

Super-orthogonal space-time-frequency trellis coded OFDM

Super-orthogonal space-time trellis codes (SOSTTCs) given in the literature are full rate and provide full spatial diversity with high coding gain in narrowband quasistatic fading channels. The high number of parallel transitions in their trellis structure restricts their performance in wideband channels where the code performance suffers from multipath. Code design criteria are derived and a computer search based method is proposed to design full-rate optimised SOSTTCs exploiting full spatial and multipath diversity for multiple-input multiple-output orthogonal frequency division multiplexing systems. The proposed codes have codewords defined in space, time, and frequency. We evaluate the codeword error rates of the new 16, 32 and 64-state super-orthogonal space-time-frequency trellis codes for quadrature phase shift keying by computer simulation and show that they provide significant error performance improvement compared to their counterparts with equivalent delay length     

一种利用正交码扩频技术的数字图像水印算法

本文提出一种利用正交码扩频技术的数字图像水印算法。该方法在发送端先分别用两个相互正交的Walsh序列对同一水印进行扩频，再将扩频信号嵌入到载体图像的DCT变换域的中频和低频系数中；在接收端先将调制信号从频域中提取出来，然后采用相关检测技术解扩。实验结果表明，该方法能有效地抵抗噪声、剪切口EG压缩等攻击，对中值滤波也具有一定的鲁棒性。     

Binary code design for high-frequency ultrasound

This paper proposes an approach to designing binary codes suitable for high-frequency applications of coded excitation in medical ultrasound. For a high-frequency ultrasound system, transmitting well-designed binary codes with a low sampling ratio (i.e., the bit rate divided by the transducer center frequency) is a practical way to improve the signal-to-noise ratio (SNR) because the challenge of implementing arbitrary-waveform generators for transmitting nonbinary codes increases with the frequency and the switching speed of square-wave pulsers are limited. One conventional approach designs codes using a base sequence that modulates wideband sequences up to the transducer passband. Because a major portion of codes is excluded as a candidate, codes designed using this approach typically need long compression filters for restoring the axial resolution, and they do not improve the SNR efficiently. In contrast, the approach proposed here searches all the codes that match the transducer passband; hence, the resultant codes exhibit better performance. The technique was tested using a bit rate of 50 MHz and a sampling ratio of 2. For a transducer with an ideal Gaussian frequency response with a center frequency of 25 MHz and a -6 dB bandwidth of 15 MHz, the SNR for the same side-lobe extent was 1 to 6 dB higher for the codes designed using the proposed approach compared with those designed using the conventional approach. When a real transducer response with a center frequency of 26.4 MHz and a one-way -6 dB bandwidth of 20.7 MHz was considered, the codes designed using the proposed approach were superior by 0.5 to 5 dB. Therefore, our approach is better than the conventional approach for designing binary codes for high-frequency ultrasound, with the results indicating that the moderate bit rate of 50 MHz will suffice when the ultrasonic center frequency is 25 MHz.     

一种利用正交码扩频技术的数字图像水印算法

本文提出一种利用正交码扩频技术的数字图像水印算法。该方法在发送端先分别用两个相互正交的 Walsh序列对同一水印进行扩频,再将扩频信号嵌入到载体图像的DCT变换域的中频和低频系数中;在接收端先将调制信号从频域中提取出来,然后采用相关检测技术解扩。实验结果表明,该方法能有效地抵抗噪声、剪切、JPEG压缩等攻击,对中值滤波也具有一定的鲁棒性。     

Construction and performance analysis of 2-D codes for M-ary OFFH?CDMA systems

A new family of two-dimensional (2-D) codes constructed by combining frequency-hop and time-spreading codes is presented. The proposed codes are designed to overcome the limitation imposed on the maximum permissible number of simultaneous users in optical code-division multiple-access (OCDMA) systems. To increase the data transmission rate, the 2-D codes employ a M-ary signalling scheme. The proposed family of codes has the favourable characteristics of a zero autocorrelation constraint and a cross-correlation constraint of one. The performance of the 2-D code is analysed in terms of the bit error rate (BER) and is compared with that of a conventional OCDMA system using optical orthogonal code (OOC). The numerical and simulation results reveal that the proposed system outperforms conventional OCDMA systems both in terms of the BER and the data transmission rate. In addition, the system capacity is sufficient to ensure reliable communication (BERles10^-9) in local area networks     

Codes for spread spectrum applications generated using chaotic dynamical systems

An approach to finding codes for use in direct sequence spread spectrum communications systems is described. It is based upon an analogy between codes having auto-and cross-correlation properties desirable for spread spectrum systems, and certain dynamical systems encountered in ergodic theory called systems with 'Lebesgue spectrum'. Such systems are associated with collections of orthogonal functions and these functions can be used to generate collections of time series with zero cross-correlation functions. To generate codewords we must use truncated versions of these time series, for which the cross-correlations are no longer precisely zero: these truncated sequences correspond to periodic orbits of the dynamical system. The method for finding a code from a suitable periodic orbit is described, and an example, using a simple dynamical system known as the doubling map, is worked through in some detail.     

码率嵌入式高码率差分空时编码

为了提高传输码率,将具有高码率的全分集全码率(FDFR)空时码嵌入到低码率的传统差分空时编码中,提出了一种码率嵌入式的差分空时编码方法,该编码方案具有编码增益高,误码性能好等优点.仿真结果表明,与传统的差分空时编码方案(酉差分空时编码和差分空时分组编码)相比,新编码方法具有很好的误码性能,特别是在高传输码率和接收天线较多情况下,其误码性能优势越明显.     

Fast acquisition implementation for high sensitivity global positioning systems receivers based on joint and reduced space search

In Global Positioning Systems (GPS), unique pseudorandom codes allow different satellites to share available frequency spectra without interference. In receivers, the locally generated codes (replicas) are correlated with received signals to extract a particular satellite?s signal and wipe-off its pseudorandom code. The signals received are generally misaligned with replicas. As a result, receivers search for signals using different codes, code phases, and additional residual sinusoidal demodulations at several possible frequencies. This search is called acquisition and it is computationally challenging for receivers operating under weak signal conditions. Software GPS receivers have been developed over the past several years and continue to be an area of extensive research. Faster, less complex, and more efficient algorithms are required for software GPS receivers. We present a fast algorithm for accelerating acquisition. Several frequency domain approaches proposed by authors earlier are combined to reduce computational complexity. These are (i) joint code, code delay and frequency search; (ii) limited code-phase search; and (iii) a shifting replica approach. Significant gains in arithmetic complexity are achieved. A novel method for restoring correlation degradation introduced by limited code phase search is also presented in this paper. Overall performance of the acquisition is illustrated on different platforms.     

Full-rate full-diversity space-time block codes for any odd number of transmit antennas

The authors propose a new class of space-time block codes (STBCs) achieving full-rate and full spatial diversity for general quadrature amplitude modulation (QAM) when using any odd number of transmit antennas under quasi-static Rayleigh fading channels. These codes are the extended works of the conventional Alamouti-ST constellation-rotating (CR) codes which are designed by serially concatenating CR precoders with the Alamouti scheme for an even number of transmit antennas. From the computer simulation results, it is observed that the best code in this class outperforms the existing ST-CR code and also exhibits error performance within only about 1-dB of the maximal ratio combining receiver. The codes possessing quasi-orthogonal (QO) characteristic are also included in this class, allowing simple maximum likelihood (ML) decoding with almost the same error performance as the best code in this class and the conventional QO-STBCs with full diveristy. These codes have identical or much lowered ML decoding complexity compared with the conventional QO-STBCs.     

Block spreading CDMA system: a simplified scheme using despreading before equalisation for broadband uplink transmission

A block-spreading code division multiple access (BS-CDMA) system is proposed for broadband uplink transmission, giving rise to a significantly improved multiuser performance without using complex multiuser detection techniques. This is because the code orthogonality is easily maintained when channel variation across the consecutive blocks, in a block-by-block high-speed transmission, is negligible. The proposed system uses frequency domain equalisation at the receiver to combat multipath interference efficiently over frequency selective fading channels. We propose despreading before equalisation, which reduces the frequency domain process to symbol-wise operation. A cell-specific scrambling code is employed to suppress other-cell interference for uplink transmission in a multicell system. Our analytical and simulation studies show that the proposed BS-CDMA system has superior multiuser performance over the conventional direct sequence CDMA and cyclic prefix CDMA systems for uplink transmission.     

List decoding of repeated codes

Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters, we show that they have a good performance with this algorithm. We compare, by computer simulations, our algorithm for the repeated code of a Reed–Solomon code against a decoding algorithm of a Reed–Solomon code. Finally, we estimate the decoding capability of the algorithm for Reed–Solomon codes and show that performance is somewhat better than our estimates.     

二维条码在仓储上的应用

随着条码技术的不断发展，二维条码逐渐登上历史的舞台。由于其信息容量大，可脱离数据库支持等与一维条码不同的特性，应用前景广阔。设计者在研究一维条码和二维条码的发展与应用的基础上，结合我国条码技术的应用现状，突出条码技术在物流、仓储领域的应用，自行设计了一种物流码。这种物流码集中了一维条码和二维条码的特点，为方便物品仓储管理起到很大的作用。     

Indirect decoding edges for one-shot shape acquisition

Determining the correspondence in coded structured light is challenging, but it is very important in one-shot techniques for 3D shape reconstruction. The problem of decoding stripe patterns can be modeled as matching two code sequences. We propose decoding edges indirectly based on the property of the stripe pattern, which can be represented as edge code, color code, or mixed code sequences. While traditional methods match two edge code sequences, indirect decoding matches two color sequences or mixed code sequences. The advantages of the proposed method, including a higher Hamming distance, enforced local coherence, and more code information, make indirect decoding excellent in performance. Previously, the lack of ground truth has prevented direct comparisons of different decoding algorithms. Here we obtain six benchmark datasets using the robust space-time analysis. Five decoding methods are quantitatively evaluated using the ground truth. The comparison results show that our method is robust for complex code situations and that it outperforms the state-of-the-art technique in this area.     

Design and performance analysis of code families for multi-dimensional optical CDMA

A code design algorithm for application in multi-dimensional optical code division multiple access (MD-OCDMA) for asynchronous optical fibre communication is proposed. Two-dimensional (2D) wavelength-time or space-time OCDMA and three-dimensional (3D) space-wavelength-time OCDMA are subsets of MD-OCDMA. Some applications and the performance analysis of the algorithm in 2D multipulse per row codes and 3D multipulse per plane codes are shown. In the applications discussed, this design ensures a maximum cross-correlation of '1' between any two codes. The performance metrics studied are the probability of error due to multiple-access interference for different numbers of active users and optimum temporal length for different values of cardinality. The performance analysis shows that the proposed 2D design offers very low probability of error due to multiple-access interference at lower cardinality when compared with other 2D designs using equivalent code dimension. A comparison of the proposed 3D design with an existing 3D design shows better performance at lower cardinality. The 3D designs show better performance when compared with the 2D designs.     

Bandwidth optimization of optical data links by use of error-control codes

A design approach to optimizing the bandwidth of optical data links while simultaneously decreasing the bit-error rate is proposed. Mathematical analysis indicates that bandwidth gains by factors of 10-60 with power gains of as much as 8.9 dB are possible. To achieve these performance levels requires several innovations. First, conventional forward error-correcting codes cannot be used because of their excessive hardware cost. A reasonably powerful multidimensional parity-based error-control code is proposed and analyzed. These codes offer excellent error detection and moderate error-correction capabilities. Most importantly, they can operate at the fast clock rates that are required. Second, a hybrid automatic-repeat-request protocol is exploited to correct complex error patterns. In thermal-noise-limited systems this unique combination allows the optical clock rate to be increased significantly, thereby resulting in large bandwidth increases. The proposed design approach can be used in optical data links in which propagation delays are moderate and is applicable to fibers that exploit wavelength-division multiplexing or time-division multiplexing, one-dimensional parallel-fiber ribbons, and two-dimensional optical data links that use free space or guided waves. Several design examples are illustrated.     

Design and performance of Huffman sequences in medical ultrasound coded excitation

This paper deals with coded-excitation techniques for ultrasound medical echography. Specifically, linear Huffman coding is proposed as an alternative approach to other widely established techniques, such as complementary Golay coding and linear frequency modulation. The code design is guided by an optimization procedure that boosts the signal-to-noise ratio gain (GSNR) and, interestingly, also makes the code robust in pulsed-Doppler applications. The paper capitalizes on a thorough analytical model that can be used to design any linear coded-excitation system. This model highlights that the performance in frequency-dependent attenuating media mostly depends on the pulse-shaping waveform when the codes are characterized by almost ideal (i.e., Kronecker delta) autocorrelation. In this framework, different pulse shapers and different code lengths are considered to identify coded signals that optimize the contrast resolution at the output of the receiver pulse compression. Computer simulations confirm that the proposed Huffman codes are particularly effective, and that there are scenarios in which they may be preferable to the other established approaches, both in attenuating and non-attenuating media. Specifically, for a single scatterer at 150 mm in a 0.7-dB/(MHz·cm) attenuating medium, the proposed Huffman design achieves a main-to-side lobe ratio (MSR) equal to 65 dB, whereas tapered linear frequency modulation and classical complementary Golay codes achieve 35 and 45 dB, respectively.