<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">IJCNS</journal-id><journal-title-group><journal-title>International Journal of Communications, Network and System Sciences</journal-title></journal-title-group><issn pub-type="epub">1913-3715</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ijcns.2017.105B015</article-id><article-id pub-id-type="publisher-id">IJCNS-76585</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  LDPC-CPM Scheme and Its Iterative Receiving for MIMO System
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Rui</surname><given-names>Xue</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Xue</surname><given-names>Lv</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Yang</surname><given-names>Cao</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>College of Information and Communication Engineering, Harbin Engineering University, Harbin, China</addr-line></aff><aff id="aff2"><addr-line>Tianjin Key Laboratory of Intelligent Information Processing in Remote Sensing, Tianjin, China</addr-line></aff><pub-date pub-type="epub"><day>26</day><month>05</month><year>2017</year></pub-date><volume>10</volume><issue>05</issue><fpage>154</fpage><lpage>162</lpage><history><date date-type="received"><day>April</day>	<month>5,</month>	<year>2017</year></date><date date-type="rev-recd"><day>Accepted:</day>	<month>May</month>	<year>23,</year>	</date><date date-type="accepted"><day>May</day>	<month>26,</month>	<year>2017</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
   
   One of the advantages of Multiple-Input Multiple-Output (MIMO) techniques is that they can provide link throughput, but the reliability of them remains to be improved. In order to improve the performance of bit error, based on the decomposed model of continuous phase modulation (CPM), combined with LDPC code and random interweaver, a scheme of joint coded modulation is introduced. In this paper, the model of LDPC-CPM iterative MIMO system is established firstly, then scheme of receiver by iterative detection realized and the decoding is proposed, finally the effect of main parameters on the performance of the system is studied, which can provide the reference basis for practical application. The research results show that the proposed scheme can improve channel capacity and BER performance in the background of extremely low SNR effectively, and give attention to both high-speed transmission and reliable transmission. 
  
 
</p></abstract><kwd-group><kwd>Communication Technology</kwd><kwd> Continuous Phase Modulation</kwd><kwd> Multiple-Input Multiple-Output (MIMO)</kwd><kwd> Iterative Detection and Decoding</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>MIMO technology has been attractive in wireless communications [<xref ref-type="bibr" rid="scirp.76585-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.76585-ref2">2</xref>], compared with conventional communication systems, which are called Single-Input Single-Output (SISO) systems, the use of multiple antennas provides means for simultaneous transmissions and spatial redundancy to the transmitted signals that helps to improve the throughput performance of MIMO over SISO [<xref ref-type="bibr" rid="scirp.76585-ref3">3</xref>].</p><p>It becomes particularly appealing when the MIMO scheme is concatenated with LDPC code. In the MIMO-LDPC system, based on the iterative detection decoding algorithm of Turbo code can be soft information exchange to further improve the receiver performance. There are many researches such as [<xref ref-type="bibr" rid="scirp.76585-ref4">4</xref>]-[<xref ref-type="bibr" rid="scirp.76585-ref6">6</xref>] detecting based on iterative decoding algorithm of LDPC coded MIMO system performance theory and simulation analysis, and verifying the excellent performance of the system. So far, the linear modulation schemes have been investigated in many MIMO architectures; however, the constant envelope modulation formats such as CPM [<xref ref-type="bibr" rid="scirp.76585-ref7">7</xref>] are more suitable for implementation in wireless system due to their high power amplifiers. Indeed, it has been focused especially on that extend the advantage of CPM signals to MIMO system and show high data rates performance [<xref ref-type="bibr" rid="scirp.76585-ref8">8</xref>]. In the corresponding references have studied CPM signal processing based on MLSD joint symbol sequence detection and the Laurent decomposition in MIMO system [<xref ref-type="bibr" rid="scirp.76585-ref9">9</xref>], and others introduced the blind signal separation at the frontend of a frequency discriminator based CPM demodulator [<xref ref-type="bibr" rid="scirp.76585-ref10">10</xref>]. However, the use of advanced channel coding joint efficient modulation system is poorly studied. In this work, consider memory and recursive nature of highly efficient CPM technique, combined with external LDPC codes and random interweaver to build a new MIMO system based on a joint coded modulation scheme, moreover an iterative detection and decoding receiver is proposed. Finally, simulation experiments verify the performance of the designed system.</p></sec><sec id="s2"><title>2. Decomposition of CPM</title><p>The transmitted baseband CPM signal is expressed as</p><disp-formula id="scirp.76585-formula161"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x2.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.76585-formula162"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x3.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x4.png" xlink:type="simple"/></inline-formula> denotes the symbol period, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x5.png" xlink:type="simple"/></inline-formula>is the transmitted energy per symbol and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x6.png" xlink:type="simple"/></inline-formula> denotes actually the transmitted symbol at the mth signal period, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x7.png" xlink:type="simple"/></inline-formula>is data length, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x8.png" xlink:type="simple"/></inline-formula>is the modulation index, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x9.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x10.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x11.png" xlink:type="simple"/></inline-formula> are relatively prime. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x12.png" xlink:type="simple"/></inline-formula>is</p><disp-formula id="scirp.76585-formula163"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x13.png"  xlink:type="simple"/></disp-formula><p>where we assumed <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x14.png" xlink:type="simple"/></inline-formula> for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x15.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x16.png" xlink:type="simple"/></inline-formula>for <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x17.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x18.png" xlink:type="simple"/></inline-formula>. Then (2) can be written as</p><disp-formula id="scirp.76585-formula164"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x19.png"  xlink:type="simple"/></disp-formula><p>The CPM modulation is said to be full- response if <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x20.png" xlink:type="simple"/></inline-formula> and of partial response if<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x21.png" xlink:type="simple"/></inline-formula>. Given as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x22.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x23.png" xlink:type="simple"/></inline-formula> after simplifying and modulus <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x24.png" xlink:type="simple"/></inline-formula> operation,</p><disp-formula id="scirp.76585-formula165"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x25.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x26.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x27.png" xlink:type="simple"/></inline-formula>is irrelevant item. Then (1) can be written</p><disp-formula id="scirp.76585-formula166"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x28.png"  xlink:type="simple"/></disp-formula><p>It can be seen that CPM signals can be determined by the current input <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x29.png" xlink:type="simple"/></inline-formula> and previous <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x30.png" xlink:type="simple"/></inline-formula> input <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x31.png" xlink:type="simple"/></inline-formula> as well as their accumulation</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x32.png" xlink:type="simple"/></inline-formula>completely, so any CPM scheme can be divided into a</p><p>continuous phase encoder (CPE) and a memoryless modulator (MM) [<xref ref-type="bibr" rid="scirp.76585-ref11">11</xref>].</p></sec><sec id="s3"><title>3. System Model</title><p>We consider a generic transmitter block diagram of MIMO system is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> with two transmitting antennas. The space-time coding process multiplexes the coded data stream into two parallel sub-streams. And then each stream coded using LDPC code, the interleaving is next step. Finally, the space-time bits are mapped into CPM symbols. It should be note that the modulated signal cannot be interleaved because interleaving destroys the continuous phase property of the modulated signal. The symbols transmitted per frame can be represented by a matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x33.png" xlink:type="simple"/></inline-formula> and the element <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x34.png" xlink:type="simple"/></inline-formula> is the transmitting symbol on the antenna <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x35.png" xlink:type="simple"/></inline-formula> during the symbol period<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x36.png" xlink:type="simple"/></inline-formula>.</p><p>The channel is assumed to be invariant within a frame and change independently from frame to frame, and ideal power control is considered here result in the received signal power is equal for all antennas. Thus the received symbols during a frame can be written as</p><disp-formula id="scirp.76585-formula167"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x37.png"  xlink:type="simple"/></disp-formula><p>where channel matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x38.png" xlink:type="simple"/></inline-formula> is composed by independent and identically distributed Rayleigh fading coefficients, its elements <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x39.png" xlink:type="simple"/></inline-formula> denote the fading factors of the sub-channels, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x40.png" xlink:type="simple"/></inline-formula>is the zero-mean complex Gaussian noise.</p></sec><sec id="s4"><title>4. Iterative Detection and Decoding</title><p>The joint iterative CPM decoding and LDPC decoding algorithm can improve</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Transmitter block diagram</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x41.png"/></fig><p>the BER performance through exchange the soft information. We apply this algorithm to the MIMO system and get a scheme which is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. It can be seen that the receiver includes two iterative processes: the inner loop is responsible for the demodulation and decoding, outer loop provides a better estimation of transmitted signal for the interference canceller in each a iteration.</p><p>MIMO detector uses a Minimum Mean Square Error (MMSE) detection technique, so the problem is to determine weighting matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x42.png" xlink:type="simple"/></inline-formula> in order to minimize<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x43.png" xlink:type="simple"/></inline-formula>, we have</p><disp-formula id="scirp.76585-formula168"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x44.png"  xlink:type="simple"/></disp-formula><p>In other words, the function of the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x45.png" xlink:type="simple"/></inline-formula> is to reverse channel, assume that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x46.png" xlink:type="simple"/></inline-formula> is the estimation of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x47.png" xlink:type="simple"/></inline-formula> and write</p><disp-formula id="scirp.76585-formula169"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x48.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x49.png" xlink:type="simple"/></inline-formula>. Based on singular value decomposition (SVD) of the type, the noise power through detector written as</p><disp-formula id="scirp.76585-formula170"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/76585x50.png"  xlink:type="simple"/></disp-formula><p>According to the</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x51.png" xlink:type="simple"/></inline-formula>and times a unitary matrix will not change vector norm<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x52.png" xlink:type="simple"/></inline-formula>, after a series of transformation, the expectations of Equation (10) is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x53.png" xlink:type="simple"/></inline-formula> (11)At this point, the output of MMSE detector can be equivalent to each CPM signals from transmitting antennas through the white Gaussian noise channel</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Receiver block diagram</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x54.png"/></fig><p>which have increased the noise gain than before. We use the matched filter group to obtain the code word information probabilities <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x55.png" xlink:type="simple"/></inline-formula> for inner loop which is shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p><p>Contain LDPC code, interweaver and CPE as this inner loop, which CPM- SISO makes use of Log-MAP algorithm and LDPC-SISO adopts Log-FFT-BP iterative decoding algorithm. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula> respectively denote code word and the information probability sequence of input for CPM-SISO, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula> as output probability sequence. In the same way, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula> denote code word and the information probability sequence of input for LDPC-SISO, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x62.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x63.png" xlink:type="simple"/></inline-formula> as output probability sequence. The probability of the sequence <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x64.png" xlink:type="simple"/></inline-formula> from sub-system CPM-SISO, after de-interweaving, is fed to the LDPC-SISO decoder as input information probability<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x65.png" xlink:type="simple"/></inline-formula>, then <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x66.png" xlink:type="simple"/></inline-formula> from sub-system LDPC-SISO after de-interweaving, obtain information probability to input CPM-SISO. After some iteration of inner make loop hard decision according to the last iteration of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x67.png" xlink:type="simple"/></inline-formula>.</p><p>For the last iteration <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/76585x68.png" xlink:type="simple"/></inline-formula> of CPM-SISO, make a hard decision and no de-interweaving to secondary modulation, feedback secondary modulation signal to the interference canceller. In the next iteration of the outer loop, interference canceller provides the better input for inner loop.</p></sec><sec id="s5"><title>5. Simulation Results</title><p>According to the previous sections, we have established a MMO system model at Rayleigh flat fading channel and assumed that perfectly known at the receiver. The length of each unencoded substream is equal to LDPC information bits, interweavers are chosen randomly. The other parameters are illustrated in figures below.</p><p><xref ref-type="fig" rid="fig4">Figure 4</xref> show that the system channel capacity increase with the number of antenna linearly, this paper takes the scenario which sending antenna is equal to receiving. In <xref ref-type="fig" rid="fig5">Figure 5</xref> we compare the performance of the system for different numbers of receiving and transmitting antennas number. Where LDPC code length is 1536 bits, rate 1/2, CPM Signal form is OM2RC. We see that the performance of the system improved by increasing the number of transmitting and receiving antennas in the background of low SNR. From the two figures, we can give attention to both high-speed transmission and reliable transmission.</p><p><xref ref-type="fig" rid="fig6">Figure 6</xref> shows the BER trend along with the change of LDPC length when</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Block diagram of the iterative decoder</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x69.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> The channel capacity with different number of antenna</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x70.png"/></fig><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> BER with different number of antenna</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x71.png"/></fig><p>2 * 2 MIMO system easy to extend to more antennas. LDPC rate are employed 1/2. Modulation method is same as above OM2RC. As it may be seen, with the increase of code length, BER performance of the system is gradually improved. Therefore, the longer the LDPC code length, the better the performance of the system.</p><p>With the method of iterative decoding to optimize system performance, the performance impact of iteration times and must be considered. <xref ref-type="fig" rid="fig7">Figure 7</xref> for the number of iteration affect the performance of the system. In simulation, 2*2 MIMO system with LDPC information bits is 512 bits, rate 1/2, the interior of</p><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Performance of system with different LDPC length when 2*2</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x72.png"/></fig><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Performance of the system at different iteration times</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/76585x73.png"/></fig><p>the LDPC code iteration for 5 times. The same goes for CPM. It can be seen that with the increase of the number of iterations, and decrease of the system BER curve tends to convergence, and with the increase of signal-to-noise ratio, number of iterations the impact on the BER is more and more obvious.</p></sec><sec id="s6"><title>6. Conclusion</title><p>In this paper, we analyze and derive the decomposition of CPM modulation signal, and applied a joint coded modulation with LDPC to MIMO architecture. Through simple MMSE-based detection and low-complexity iterative decoding with cancellation, both BER and channel capacity of improvements are achieved. We compared the effect of the number of antenna, code length and iteration times on the combined code modulation in the 2 * 2 MIMO system emphatically. The result shows that: The system has better performance for different code length and iteration times than SISO, which meets the requirements for real- time communication channel. At last, this algorithm is complete by software, so it costs lower equipment, and can be simple and practical.</p></sec><sec id="s7"><title>Acknowledgements</title><p>This paper is funded by the International Exchange Program of Harbin Engineering University for Innovation-oriented Talents Cultivation, the Open Research Fund of State Key Laboratory of Tianjin Key Laboratory of Intelligent Information Processing in Remote Sensing (Grant No. 2016-ZW-KFJJ-01), the National Natural Science Foundation of China (Grant No. 61403093), the Assisted Project by Heilongjiang Province of China Postdoctoral Funds for Scientific Research Initiation (Grant No. LBH-Q14048), and the Fundamental Research Funds for the Central Universities (Grant No. HEUCF160813).</p></sec><sec id="s8"><title>Cite this paper</title><p>Xue, R., Lv, X. and Cao, Y. (2017) LDPC-CPM Scheme and Its Iterative Receiving for MIMO System. Int. J. Communications, Network and System Sciences, 10, 154-162. https://doi.org/10.4236/ijcns.2017.105B015</p></sec></body><back><ref-list><title>References</title><ref id="scirp.76585-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Fox, N., Wampler, J., Lai, H.Q. and Morris, D. (2010) Communication Advantages with Mobile Network Multiple-Input Mul-tiple-Output (MIMO) (MNM) Technology. Proc. Military Communications Conf. (MILCOM 2010), San Diego.</mixed-citation></ref><ref id="scirp.76585-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Soltani, M.D., Aghaeinia, H. and Alimadadi, M. (2014) A Low Complexity Suboptimal Energy-Based Detection Method for Siso/Mimo Channels. Wireless Personal Communications, 7, 2857-2869. https://doi.org/10.1007/s11277-014-1672-8</mixed-citation></ref><ref id="scirp.76585-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Lai, H.Q., et al. (2010) Mea-surements of Multiple-Input Multiple-Output (MIMO) Performance under Army Operational Conditions. IEEE Military Communi-cations Conference, 2119-2124. https://doi.org/10.1109/milcom.2010.5680479</mixed-citation></ref><ref id="scirp.76585-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Suthisopapan, P. and Kasai, K. (2013) Achieving Near Capacity of Non-Binary LDPC Coded Large MIMO Systems with a Novel Ultra Low-Complexity Soft- Output Detector. IEEE Transactions on Wireless Communications, 12, 5185-5199. https://doi.org/10.1109/TWC.2013.090513.122056</mixed-citation></ref><ref id="scirp.76585-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Raghuwansi, M. and Sharma, A. (2015) Designing of Efficient LDPC Based MIMO-OFDM Using 4-PSK Scheme. IEEE International Conference on Computer, Communication and Control. https://doi.org/10.1109/ic4.2015.7375653</mixed-citation></ref><ref id="scirp.76585-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Uchoa, A.G.D., De Lamare, R.C., Healy, C., et al. (2016) Iterative Detection and Decoding Algorithms using LDPC Codes for MIMO Systems in Block-Fading Channels. IEEE Transactions on Vehicular Technology. 
https://doi.org/10.1109/TVT.2015.2432099</mixed-citation></ref><ref id="scirp.76585-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Narayanan, K.R. and Stuber, G.L. (2001) Performance of Trellis-Coded CPM with Iterative Demodulation and Decoding. IEEE Trans. on communications, 4, 49. 
https://doi.org/10.1109/26.917774</mixed-citation></ref><ref id="scirp.76585-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, X. and Fitz, M.P. (2003) Symmetric Information Rate for Continuous Phase Channel and BLAST Architecture with CPM MIMO System. IEEE International Conference on Communications.</mixed-citation></ref><ref id="scirp.76585-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Zhao, W. and Gian-nakis, G.B. (2005) Reduced Complexity Receivers for Layered Space-Time CPM. IEEE Trans. Wireless Commune., 4, 574-582 
https://doi.org/10.1109/TWC.2004.843051</mixed-citation></ref><ref id="scirp.76585-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Wert, O. and Zolzer, U. (2007) A Layered MIMO CPM System with Incoherent Demodulation. IEEE International Conference on Signal Processing and Communications (ICSPC2007), Dubai, November 2007. 
https://doi.org/10.1109/ICSPC.2007.4728346</mixed-citation></ref><ref id="scirp.76585-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Rimoldi, B.E. (1988) A Decomposition Approach to CPM. IEEE Trans on Inform Theory, 34, 260-270. https://doi.org/10.1109/18.2634</mixed-citation></ref></ref-list></back></article>