A multistage polyphase magnitude modulation (MPMM) technique is proposed for single carrier (SC) modulations, to efficiently reduce the peak-to-average power ratio (PAPR) of the bandwidth limited signal resulting from root-raised cosine (RRC) filtering. We show that the application of back-off to the transmitter high-power amplifier (HPA), in order to avoid nonlinear distortion and thus spectral regrowth, can be almost eliminated, even at very low roll-off values, leading to systemiquests high power efficiency. We also show that noise sensitivity due to MPMM is considerably minimized by improving the initial receiver's soft-decoding estimates, based on the average positions of the MPMM constellation symbols.
This paper describes a high capacity blind video watermarking system invariant to geometrical attacks such as shift, rotation, scaling and cropping. A spatial domain reference watermark is used to obtain invariance to geometric attacks by employing image registration techniques to determine and invert the attacks. A second, high capacity watermark, which carries the data payload, is embedded in the wavelet domain according to a human visual system (HVS) model. This is protected by a state-of-the-art error correction code (turbo code). The proposed system is invariant to scaling up to 180%, rotation up to 70/spl deg/ and arbitrary aspect ratio changes up to 200% on both axes. Furthermore, the system is virtually invariant to any shifting, cropping, or combined shifting and cropping.
This paper presents a more efficient algorithm to count codewords of given weights in self-dual double-circulant and formally self-dual quadratic double-circulant codes over GF(2). A method of deducing the modular congruence of the weight distributions of the binary quadratic double-circulant codes is proposed. This method is based on that proposed by Mykkeltveit, Lam and McEliece, JPL. Tech. Rep., 1972, which was applied to the extended quadratic-residue codes. A useful application of this modular congruence method is to provide independent verification of the weight distributions of the extended quadratic-residue and quadratic double-circulant codes. Using this method in conjunction with the proposed efficient codeword counting algorithm, we are able i) to give the previously unpublished weight distributions of the [76, 38,12] and [124, 62, 20] binary quadratic double-circulant codes; ii) to provide corrections to the published results on the weight distributions of the binary extended quadratic-residue code of prime 151, and the number of codewords of weights 30 and 32 of the binary extended quadratic-residue code of prime 137; and iii) to prove that the [168, 84, 24] extended quadratic-residue and quadratic double-circulant codes are inequivalent
An efficient algorithm to count all codewords of given weight and a method to deduce the modular congruence of the weight distributions of the binary quadratic double-circulant codes are presented. Using this algorithm, we give the weight distribution of the quadratic double-circulant code of length 168 and that of the extended quadratic-residue code of the same length. The weight distributions of these two inequivalent codes of length 168, which were previously unknown, are independently verified and proved to be accurate using the modular congruence method
Reed-Solomon (RS) codes C(n, k, n - k + 1) are commonly used error-control codes, because they are Maximum Distance Separable (MDS) codes. Over a Binary Erasure Channel, RS codes perform with optimal results and approach the maximum channel capacity. In this paper, we apply RS codes to packet wireless transmission over the uncorrelated flat Rayleigh fading channel. It is shown that by using an RS code concatenated with BCH codes and using hard decisions, better results are obtained than using bit interleaved LDPC codes, with soft-decision decoding. The BCH code is used to correct small numbers of errors due to noise and also to detect the presence of deep fades, in which case the entire packet is erased. Erased packets are corrected by the RS code. We also discuss the effect of overall code rate on the net performance.
It is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, for some binary linear cyclic codes, the performance of the iterative decoder can be improved by substituting some of the dual code codewords in the parity-check matrix with other dual code codewords formed from linear combinations. This technique can bring the performance of a code closer to its maximum-likelihood performance, which can be derived from the erroneous decoded codeword whose euclidean distance with the respect to the received block is smaller than that of the correct codeword. For (63,37), (93,47) and (105,53) cyclic codes, the maximum-likelihood performance is realised with this technique.