RS-MPSK编码调制在传输压缩图像的Rayleigh衰落信道中的性能

本文研究了两种结构的ＲＳ－ＭＰＳＫ编码调制方案在传输压缩图像的Ｒａｙｌｅｉｇｈ衰落信道中的性能。采用计算机仿真的方法得到了该方案在Ｒａｙｌｅｉｇｈ衰落信道中的误比特率,并与理论上限进行了比较,将方案用于传输压缩图像时,可大大提高系统的性能,具有较高的理论意义和衫价值。     

Applications of algebraic soft-decision decoding of Reed-Solomon codes

Efficient soft-decision decoding of Reed-Solomon (RS) codes is made possible by the Koetter-Vardy (KV) algorithm which consists of a front-end to the interpolation-based Guruswami-Sudan (GS) list decoding algorithm. This paper approaches the soft-decision KV algorithm from the point of view of a communications systems designer who wants to know what benefits the algorithm can give, and how the extra complexity introduced by soft decoding can be managed at the systems level. We show how to reduce the computational complexity and memory requirements of the soft-decision front-end. Applications to wireless communications over Rayleigh fading channels and magnetic recording channels are proposed. For a high-rate RS(255,239) code, 2-3 dB of soft-decision gain is possible over a Rayleigh fading channel using 16-quadrature amplitude modulation. For shorter codes and at lower rates, the gain can be as large as 9 dB. To lower the complexity of decoding on the systems level, the redecoding architecture is explored, which uses only the appropriate amount of complexity to decode each packet. An error-detection criterion based on the properties of the KV decoder is proposed for the redecoding architecture. Queueing analysis verifies the practicality of the redecoding architecture by showing that only a modestly sized RAM buffer is required.     

Some block- and trellis-coded modulations for the Rayleigh fadingchannel

The error performance of a modulation code over a channel depends on several distance parameters and the path multiplicity of the code. For the AWGN channel, the error performance of a modulation code depends mainly on its minimum squared Euclidean distance and path multiplicity. For the Rayleigh fading channel, however, the error performance of a modulation code depends strongly on its minimum symbol distance, minimum product distance, and path multiplicity. It depends on the minimum squared Euclidean distance in a lesser degree. This paper is concerned with the construction of block and trellis MPSK modulation codes for the Rayleigh fading channel. In each construction, the distance parameters are chosen to achieve good error performance with reduced decoding complexity     

GF(2p)LDPC编码的相位调制OFDM系统在瑞利衰落信道的性能

OFDM是一项能有效对抗高速无线通信中多径衰落的关键技术，为了进一步提高OFDM系统的误码性能，许多信道编码技术已被应用于OFDM系统中，二元域LDPC码以其近香农限的误码性能和较低的译码复杂度成为研究的热点。在AWGN信道下，多元域LDPC码比等效码长的二元域LDPC码有更好的纠错性能。本文提出了一种将多元域LDPC码经过MPSK调制后用于OFDM系统的新方法。仿真结果表明，在多径衰落信道下，通过合理选择多元LDPC码域的阶数和调制的方法，多元域LDPC编码的高阶调制OFDM系统比等效码长的二元域LDPC编码OFDM系统具有更好的性能，并且由于采用了多元域LDPC的快速BP译码，译码复杂度只是稍有增加。     

Multilevel trellis MPSK modulation codes for the Rayleigh fadingchannel

The multilevel coding technique is used for constructing multilevel trellis M-ary phase-shift-keying (MPSK) modulation codes for the Rayleigh fading channel. In the construction of a code, all the factors which affect the code performance and its decoding complexity are considered. The error performance of some of these codes based on both one-stage optimum decoding and multistage suboptimum decoding has been simulated. The simulation results show that these codes achieve good error performance with small decoding complexity     

Errors and erasures decoding of BCH and Reed-Solomon codes for reduced M-ary orthogonal signaling

The paper presents a comparison of communication systems using different signal constellation sizes and Reed-Solomon or Bose-Chaudhuri-Hocquengem codes with different rates so that the overall required bandwidth is the same for each system. In these comparisons, the channel symbol size is smaller than the code symbol size, so that a code symbol contains parts of multiple channel symbols. Thus, the normal assumption of independent code symbols does not apply. Instead, consideration must be taken to obtain the best arrangement of channel symbols in each code symbol. Analytical expressions are developed to compare the bit error probability performance of comparable systems, based on individual codewords using errors-only decoding and errors and erasures decoding with transmission over a Rayleigh fading channel.     

Applications of Algebraic Soft-Decision Decoding of Reed–Solomon Codes

Efficient soft-decision decoding of Reed–Solomon codes is made possible by the Koetter–Vardy (KV) algorithm which consists of a front-end to the interpolation-based Guruswami–Sudan list decoding algorithm. This paper approaches the soft-decision KV algorithm from the point of view of a communications systems designer who wants to know what benefits the algorithm can give, and how the extra complexity introduced by soft decoding can be managed at the systems level. We show how to reduce the computational complexity and memory requirements of the soft-decision front-end. Applications to wireless communications over Rayleigh fading channels and magnetic recording channels are proposed. For a high-rate (RS 9225,239) Reed–Solomon code, 2–3 dB of soft-decision gain is possible over a Rayleigh fading channel using 16-quadrature amplitude modulation. For shorter codes and at lower rates, the gain can be as large as 9 dB. To lower the complexity of decoding on the systems level, the redecoding architecture is explored which uses only the appropriate amount of complexity to decode each packet. An error-detection criterion based on the properties of the KV decoder is proposed for the redecoding architecture. Queuing analysis verifies the practicality of the redecoding architecture by showing that only a modestly sized RAM buffer is required.     

瑞利衰落信道下基于LDPC码USTM的MIMO系统

研究了一种联合低密度校验(LDPC,Low-Density Parity-Check)码和酉空时调制(USTM,Unitary Space-Time Modulation)技术在不相关瑞利平坦衰落(Rayleigh flat fading)下的多输入多输出信道(MIMO,Multiple-Input Multiple-Output)系统的性能.在无信道状态信息下,采用可并行操作的和积译码算法(SPA,Sum-Product Algorithm)的LDPCC-USTM级联系统具有优异的性能,并分析了不同LDPC码集下对系统性能的影响.仿真结果表明LDPCC-USTM级联系统比与未级联的相比有近23dB的编码增益,与基于Turbo码的USTM[6]系统相比有5dB多的编码增益,且基于非规则的LDPC码的级联系统比基于规则码有近1dB的编码增益.     

基于低密度校验码的OFDM编码调制译码算法

低密度校验码(LDPC)具有编码增益高、译码速度快、性能接近Shannon限的优点。LDPC码应用于OFDM，能有效地提高多径环境下OFDM的BER性能。本文首先简单介绍LDPC码及其概率域上的译码算法，在此基础上对译码算法作融合，阐述概率似然比的译码算法。为了把LDPC应用于OFDM系统上，提出了多电平调制下的LDPC译码的算法。仿真结果表明，在AWGN和Rayleigh信道下，此算法正确有效。     

瑞利衰落信道下MPSK信号调制方式识别

调制识别是非协作通信系统接收机设计中的重要研究课题。在实际环境中,噪声和信道衰落是影响信号调制方式识别的重要因素。针对瑞利衰落信道上MPSK较难识别的情况,提了基于似然比的识别算法,并根据最大似然准则对瑞利信道的参数进行了估计完成对2种调制信号的识别。仿真结果表明:在存在高斯白噪声的瑞利衰落信道的环境下,以BPSK和QPSK为例,正确识别率达到90%。     

Rice-Lognormal衰落信道中不同译码度量特性的比较

本文推导出了Ｒｉｃｅ－Ｌｏｇｎｏｒｍａｌ衰落信道中没有信道状态信息和具有信道状态信息两种情况下的最大似然译码度量,并同传统欧氏距离度量的错误概率进行了比较,数值计算结果表明：对于ＴＣ－ＭＰＳＫ方案,信道衰落特征（ｆＤＴ）对度量特性打电话几乎可以忽略。最后,讨论了Ｒｉｃｅ－Ｌｏｇｎｏｒｍａｌ衰落信道中的最小交织深度。     

Multiple-symbol differential sphere decoding

In multiple-symbol differential detection (MSDD) for power-efficient transmission over Rayleigh fading channels without channel state information, blocks of N received symbols are jointly processed to decide on N-1 data symbols. The search space for the maximum-likelihood (ML) estimate is therefore (complex) (N-1)-dimensional, and maximum-likelihood MSDD (ML-MSDD) quickly becomes computationally intractable as N grows. Mackenthun's low-complexity MSDD algorithm finds the ML estimate only for Rayleigh fading channels that are time-invariant over an N symbol period. For the general time-varying fading case, however, low-complexity ML-MSDD is an unsolved problem. In this letter, we solve this problem by applying sphere decoding (SD) to ML-MSDD for time-varying Rayleigh fading channels. The resulting technique is referred to as multiple-symbol differential sphere decoding (MSDSD).     

A Reed-Solomon coded DS-CDMA system using noncoherent M-aryorthogonal modulation over multipath fading channels

The performance of Reed-Solomon (RS) coded direct-sequence code division multiple-access (DS-CDMA) systems using noncoherent M-ary orthogonal modulation is investigated over multipath Rayleigh fading channels. Diversity reception techniques with equal gain combining (EGC) or selection combining (SC) are invoked and the related performance is evaluated for both uncoded and coded DS-CDMA systems. “Errors-and-erasures” decoding is considered, where the erasures are based on Viterbi's (1982) so-called ratio threshold test (RTT). The probability density functions (PDF) of the ratio associated with the RTT conditioned on both the correct detection and erroneous detection of the M-ary signals are derived. These PDFs are then used for computing the codeword decoding error probability of the RS coded DS-CDMA system using “errors-and-erasures” decoding. Furthermore, the performance of the “errors-and-erasures” decoding technique employing the RTT is compared to that of “error-correction-only” decoding refraining from using side-information over multipath Rayleigh fading channels. As expected, the numerical results show that when using “errors-and-erasures” decoding, RS codes of a given code rate can achieve a higher coding gain than without erasure information     

EM‐based iterative receiver for coded MIMO systems in unknown spatially correlated noise

We present iterative channel estimation and decoding schemes for multi‐input multi‐output (MIMO) Rayleigh block fading channels in spatially correlated noise. An expectation‐maximization (EM) algorithm is utilized to find the maximum likelihood (ML) estimates of the channel and spatial noise covariance matrices, and to compute soft information of coded symbols which is sent to an error‐control decoder. The extrinsic information produced by the decoder is then used to refine channel estimation. Several iterations are performed between the above channel estimation and decoding steps. We derive modified Cramer–Rao Bound (MCRB) for the unknown channel and noise parameters, and show that the proposed EM‐based channel estimation scheme achieves the MCRB at medium and high SNRs. For a bit error rate of 10⁻⁶ and long frame length, there is negligible performance difference between the proposed scheme and the ideal coherent detector that utilizes the true channel and noise covariance matrices. Copyright © 2006 John Wiley & Sons, Ltd.     

A soft decoding scheme for vector quantization over a CDMA channel

The optimal decoding of vector quantization (VQ) over a code-division multiple-access (CDMA) channel is too complicated for systems with a medium-to-large number of users. This paper presents a low-complexity, suboptimal decoder for VQ over a CDMA channel. The proposed decoder is built from a soft-output multiuser detector, a soft bit estimator, and the optimal soft VQ decoding of an individual user. Simulation results obtained over both additive white Gaussian noise and flat Rayleigh fading channels show that with a lower complexity and good performance, the proposed decoding scheme is an attractive alternative to the more complicated optimal decoder.     

平坦慢衰落信道下基于HOS的PSK调制盲信道估计

提出一种基于符号高阶统计量（HOS, high-order statistics）的MPSK调制信道衰落系数盲估计算法。针对平坦慢衰落信道模型,首先分析了MPSK调制符号高阶统计量特征,证明了MPSK调制符号的M次方符号的值是唯一的,而当1≤M′相似文献   

低密度校验码及其在图像传输中的应用

低密度校验(Low-Density Parity-Check,LDPC)码是一种基于图和迭代译码的信道编码方案,性能非常接近Shannon极限且实现复杂度低,具有很强的纠错抗干扰能力。该文深入研究了LDPC码的编码和译码基本原理,并将其应用于移动衰落信道图像的传输中,仿真结果表明LDPC码能为图像传输带来显著的性能提高,且系统复杂度低,译码时延短。     

On acceptance criterion for efficient successiveerrors-and-erasures decoding of Reed-Solomon and BCH codes

We describe an efficient algorithm for successive errors-and-erasures decoding of BCH codes. The decoding algorithm consists of finding all necessary error locator polynomials and errata evaluator polynomials, choosing the most appropriate error locator polynomial and errata evaluator polynomial, using these two polynomials to compute a candidate codeword for the decoder output, and testing the candidate for optimality via an originally developed acceptance criterion. Even in the most stringent case possible, the acceptance criterion is only a little more stringent than Forney's (1966) criterion for generalised minimum distance (GMD) decoding. We present simulation results on the error performance of our decoding algorithm for binary antipodal signals over an AWGN channel and a Rayleigh fading channel. The number of calculations of elements in a finite field that are required by our algorithm is only slightly greater than that required by hard-decision decoding, while the error performance is almost as good as that achieved with GMD decoding. The presented algorithm is also applicable to efficient decoding of product RS codes     

A space-time block-coded OFDM scheme for unknownfrequency-selective fading channels

We introduce a space-time block-coded orthogonal frequency-division multiplexing (STBC-OFDM) selective fading channels which does not require channel knowledge either at the transmitter or at the receiver. The decoding algorithm is based on generalized maximum-likelihood sequence estimation. We investigate the performance of the proposed scheme over two-tap Rayleigh fading channels. Simulation results show the performance to be near optimum     

CHANNEL ESTIMATION FOR ITERATIVE DECODING OVER FADING CHANNELS

A method of coherent detection and channel estimation for punctured convolutional coded binary Quadrature Amplitude Modulation (QAM) signals transmitted over a frequency-flat Rayleigh fading channels used for a digital radio broadcasting transmission is presented.Some known symbols are inserted in the encoded data stream to enhance the channel estimation process.The puilot symbols are used to replace the existing parity symbols so no bandwidth expansion is required.An iterative algorithm that uses decoding information as well as the information contained in the known symbols is used to improve the channel parameter estimate.The scheme complexity grows exponentially with the channel estimation filter length,The performance of the system is compared for a normalized fading rate with both perfect coherent detection(Corresponding to a perfect knowledge of the fading process and noise variance)and differential detection of Differential Amplitude Phase Shift Keying (DAPSK).The tradeoff between simplicity of implementation and bit-error-rate performance of different techniques is also compared.