优化LDPC编码OFDM系统中PTS降PAPR的分区策略

167 浏览量更新于2024-08-28 收藏 884KB PDF 举报

本文主要探讨了在低密度奇偶校验码(LDPC-coded)正交频分复用(OFDM)系统中，采用部分调制技术(Phase-Trellis Shifting, PTS)进行峰均功率比(Power Amplifier Nonlinearities, PAPR)降低时的分区优化策略。PAPR是OFDM信号的一个关键挑战，因为它可能导致功放非线性效应，影响系统的效率和可靠性。首先，参考文献[17]提到的串行连接的树型结构编码(Trellis Coded Modulation, TCM)配合率-1的内编码，提供了一种有效降低PAPR的技术。这种编码方法在[17]的全球通信会议(GLOBECOM)上被提出，并通过调整编码结构来改善信号性能。 M. Tüchler在[18]的研究中，对根据块长度设计的串行联合系统进行了深入探讨，这与LDPC编码的OFDM系统中的数据流组织密切相关。他的工作可能对如何优化系统架构以适应不同长度的数据块，同时兼顾PAPR减少有着重要作用。 [19]的《近容量多功能MIMO系统》一书由L. Hanzo等人编撰，介绍了利用Sphere-Packing、迭代检测和合作技术来提升系统性能，这些技术在MIMO系统中也有助于降低OFDM的PAPR，通过空间和时间上的复用提高信号质量。 S. Sugiura在[20]和[21]的工作中聚焦于空间-时间键控(STSK)和相干/非相干STSK技术在MIMO系统中的应用，特别是对于降低PAPR和提升信号抗干扰能力。他的研究强调了信号处理算法和调制方式选择对PAPR控制的重要性，尤其是在分布式MIMO系统中。此外，[22]中M. Jiang和L. Hanzo的合作研究讨论了多用户MIMO-OFDM技术在下一代无线系统中的潜力，该技术通过多用户的协同工作，进一步优化了PAPR性能。最后，R. H. Clarke的论文提出了移动通信接收理论，虽然并未直接针对LDPC-Coded OFDM系统，但其基本原理如信道统计模型可能会为理解无线系统中PAPR问题提供基础，帮助优化设计。本研究论文旨在通过优化LDPC编码的OFDM系统中PTS的分区策略，实现PAPR的有效管理，结合上述多种先进的编码和多天线技术，以提升系统的性能和鲁棒性，适用于高速、高容量的无线通信环境。

4108 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 63, NO. 8, OCTOBER 2014

[17] D. Divsalar, S. Dolinar, and F. Pollara, “Serial concatenated trellis

coded modulation with rate-1 inner code,” in Proc. IEEE GLOBECOM,

Dec. 2000, vol. 2, pp. 777–782.

[18] M. Tüchler, “Design of serially concatenated systems depending on

the block length,” IEEE Trans. Commun., vol. 52, no. 2, pp. 209–218,

Feb. 2004.

[19] L. Hanzo, O. Alamri, M. El-Hajjar, and N. Wu, Near-Capacity Multi-

Functional MIMO Systems (Sphere-Packing, Iterative Detection and

Cooperation). New York, NY, USA: Wiley, 2009.

[20] S. Sugiura, “Dispersion matrix optimization for space–time shift keying,”

IEEE Commun. Lett., vol. 15, no. 11, pp. 1152–1155, Nov. 2011.

[21] S. Sugiura, “Coherent versus non-coherent space–time shift keying for

co-located and distributed MIMO systems,” Ph.D. dissertation, Univ.

Southampton, Southampton, U.K., 2010.

[22] M. Jiang and L. Hanzo, “Multiuser MIMO-OFDM for next-generation

wireless systems,” Proc. IEEE, vol. 95, no. 7, pp. 1430–1469,

Jul. 2007.

[23] R. H. Clarke, “A statistical theory of mobile radio reception,” Bell Syst.

Tech. J. , vol. 47, no. 6, pp. 957–1000, Jul. 1968.

[24] V. Pauli and L. Lampe, “Tree-search multiple-symbol differential decod-

ing for unitary space–time modulation,” IEEE Trans. Commun., vol. 55,

no. 8, pp. 1567–1576, Aug. 2007.

[25] E. Chiavaccini and G. Vitetta, “Further results on differential space–time

modulations,” IEEE Trans. Commun., vol. 51, no. 7, pp. 1093–1101,

Jul. 2003.

[26] R. Schober and L. H.-J. Lampe, “Noncoherent receivers for differential

space–time modulation,” IEEE Trans. Commun., vol. 50, no. 5, pp. 768–

777, May 2002.

[27] B. L. Hughes, “Differential space–time modulation,” IEEE Trans. Inf.

Theory, vol. 46, no. 7, pp. 2567–2578, Nov. 2000.

[28] A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner, and

H. Bolcskei, “VLSI implementation of MIMO detection using the

sphere decoding algorithm,” IEEE J. Solid-State Circuits, vol. 40, no. 7,

pp. 1566–1577, Jul. 2005.

[29] N. Seshadri and P. Hoeher, “On post-decision symbol-reliability genera-

tion,” in Proc. IEEE ICC, May 1993, vol. 2, pp. 741–745.

[30] “Digital land mobile radio communications, ﬁnal report,” Ofﬁce for Ofﬁ-

cial Publications of the European Communities, Luxembourg, Tech. Rep.,

1989.

[31] M. Patzold, Mobile Fading Channels. New York, NY, USA: Wiley,

2003.

[32] M. El-Hajjar and L. Hanzo, “EXITcharts for system design and analysis,”

IEEE Commun. Surveys Tuts., vol. 16, no. 1, pp. 127–153, First Quarter,

2014.

[33] J. Hagenauer, “The EXIT chart-Introduction to extrinsic information

transfer in iterative processing,” in Proc. Eur. Signal Process. Conf.,

Vienna, Austria, Sep. 2004, pp. 1541–1548.

Partition Optimization in LDPC-Coded OFDM

Systems With PTS PAPR Reduction

Li Li, Daiming Qu, and Tao Jiang

Abstract—A joint decoding scheme was proposed by Li and Qu to

recover low-density parity-check (LDPC) codeword and partial transmit

sequence (PTS) phase factors, for OFDM systems with a low peak-to-

average power ratio (PAPR). However, the error-correcting performance

of the joint decoding scheme heavily relies on how the OFDM subcarriers

are partitioned into groups in the PTS scheme. With a pseudorandom

partition, the joint decoding scheme provides satisfactory error-correcting

performance only when the number of PTS groups is very small. In this

paper, we formulate an optimization problem to improve the joint decoding

performance by optimizing the partition. Furthermore, two greedy-based

algorithms are proposed to solve the problem. Simulation results show

that the joint decoding scheme with the proposed partition algorithms

provides satisfactory error-correcting performance for a larger number

of PTS groups than it does with the pseudorandom partition. With the

improved performance, better PAPR performance can be supported.

Index Terms—Greedy algorithm, low-density parity-check (LDPC),

orthogonal frequency-division multiplexing (OFDM), partial transmit

sequence (PTS), peak-to-average power ratio (PAPR).

I. INTRODUCTION

Orthogonal frequency-division multiplexing (OFDM) has been wide-

ly adopted in various wireless communication standards due to its abili-

ty to efﬁciently cope with frequency-selective channels. However, one

major drawback of OFDM systems is a high peak-to-average power

ratio (PAPR). Among a variety of PAPR reduction techniques [2], the

partial transmit sequence (PTS) scheme has attracted a lot of attention

since it introduces no distortion in the transmitted signal and achieves

signiﬁcant PAPR reduction [3], [4]. However, the PTS phase factor

information is required at the receiver as side information, which de-

creases the transmission efﬁciency or complicates the system design.

In [1], a joint decoding scheme was proposed for recovering low-

density parity-check (LDPC) [9]–[11] codeword and the PTS phase

factors, which avoid the transmission of PTS side information. In

particular, the PTS processing is viewed as a stage of coding, and the

parity-check matrix and the Tanner graph of the concatenated LDPC-

PTS code are derived in [1]. With the derived parity-check matrix and

the Tanner graph, the LDPC codeword and the PTS phase factors are

jointly decoded using a standard LDPC decoder. Compared with the

other schemes for recovering the phase factors, such as [5]–[8], the

joint decoding scheme simpliﬁes the system design since it does not

require the detection of phase factors before decoding.

In this paper, it is pointed out that the error-correcting performance

of the joint decoding scheme heavily relies on how the OFDM

subcarriers are partitioned into groups in the PTS scheme. With a

Manuscript received July 7, 2013; revised November 10, 2013; accepted

February 1, 2014. Date of publication February 7, 2014; date of current version

October 14, 2014. This work was supported in part by the National Natural

Science Foundation of China under Grant 61271228, Grant 61172052, and

Grant 60872008, and in part the National and Major Project of China under

Grant 2013ZX03003016. (Corresponding author: D. Qu.)

The authors are with Wuhan National Laboratory for Optoelectronics, De-

partment of Electronics and Information Engineering, Huazhong University

of Science and Technology, Wuhan 430074, China (e-mail: qudaiming@mail.

hust.edu.cn).

Color versions of one or more of the ﬁgures in this paper are available online

at http://ieeexplore.ieee.org.

Digital Object Identiﬁer 10.1109/TVT.2014.2305153

IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.

See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.

下载后可阅读完整内容，剩余5页未读，立即下载

weixin_38529397

粉丝: 5
资源: 938

优化LDPC编码OFDM系统中PTS降PAPR的分区策略

使用 SLM 和 PTS 的 OFDM PAPR 减少GUI

论文研究-Tissue P systems with cell separation: attacking the partition problem.pdf

GNOME Partition Editor：gparted-live-1.5.0-1-amd64.iso

An Energy-Efficient Partition-Based Framework With Continuous Ant Colony Optimization for Target Tracking in Mobile Sensor Networks

c语言-leetcode题解之0416-partition-equal-subset-sum

Partition-Copy-开源

partition-single-img.py

mariadb-sequential-partition-manager-py:根据自动增量ID管理MariaDB分区

How to Partition a Billion-Node Graph - Microsoft Research (2016)-计算机科学

partition-refinement-iterator:逐步细化有限集的分区

最新资源