<?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">JCC</journal-id><journal-title-group><journal-title>Journal of Computer and Communications</journal-title></journal-title-group><issn pub-type="epub">2327-5219</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jcc.2016.42001</article-id><article-id pub-id-type="publisher-id">JCC-63417</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>
 
 
  Recovery of Image through Alamouti Channel with Incorporation of RSA Algorithm
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>ninda</surname><given-names>Majumder</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mohammad</surname><given-names>Raihan Ruhin</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>Tahsina</surname><given-names>Hashem</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>Md.</surname><given-names>Imdadul Islam</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Computer Science and Engineering, Jahangirnagar University, Dhaka, Bangladesh</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>imdad@juniv.edu(NM)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>15</day><month>02</month><year>2016</year></pub-date><volume>04</volume><issue>02</issue><fpage>1</fpage><lpage>10</lpage><history><date date-type="received"><day>31</day>	<month>December</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>12</month>	<year>February</year>	</date><date date-type="accepted"><day>15</day>	<month>February</month>	<year>2016</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>
 
 
  In many applications, it is necessary to transmit images at a remote station, where wired Internet service is not available. In this case, wireless local loop (WLL) can help in making wireless link between one end node of the internet and remote service center. In such link, the communication is heavily affected by large and small scale fading; hence the received signal experiences huge distortion in case of forward error correction. Otherwise, huge service delay arises due to frequent negative acknowledgements. To combat the situation, we can choose Alamouti channel of full rate and fully orthogonal space-time block code (OSTBC). Our aim is to transmit images through Alamouti channel and to observe the quality of the recovered image, in context of bit error rate (BER). We have also observed the impact of fading and additive white Gaussian noise (AWGN) on the image without application of error correction or detection technique of channel coding. To ensure security, we apply the RSA algorithm on each pixel prior transmitting and decrypt them at the receiving end, where we found no impairment from the algorithm. Finally, we observe that the relative performance of the system changes digital modulation schemes.
 
</p></abstract><kwd-group><kwd>Quotient and Remainder Matrix</kwd><kwd> Alamouti Simulator</kwd><kwd> Multiple-Input Single-Output (MISO)</kwd><kwd> Image Encryption and Decryption</kwd><kwd> BER and Discrete Wavelet Transform (DWT)</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Two most important limitations of wireless communication are: the range or length of link and data rate (related to channel capacity). To overcome these limitations, researchers have given their effort on space diversity and multicarrier parallel transmission called orthogonal frequency division multiplexing (OFDMA) of [<xref ref-type="bibr" rid="scirp.63417-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.63417-ref2">2</xref>] . A number of algorithms are proposed on transmitting side in [<xref ref-type="bibr" rid="scirp.63417-ref2">2</xref>] -[<xref ref-type="bibr" rid="scirp.63417-ref7">7</xref>] for attaining space diversity hence getting high signal-to-noise ratio (SNR) at receiving end. A communication model, where space-time block code (STBC) at the physical layer, with channel coding (linear block code) at the data link layer is shown in [<xref ref-type="bibr" rid="scirp.63417-ref8">8</xref>] - [<xref ref-type="bibr" rid="scirp.63417-ref10">10</xref>] and performances were measured in context of BER. A diversity coding can be used in multiple-input multiple- output (MIMO) to provide high data rate without requiring additional bandwidth and transmit power. It is noted that Alamouti space-time block coding has showed good performance than other techniques comparatively. This motivates us to use Alamouti channel for transmitting different types of images like “medical images”, “secured watermark”, “biometric identification” at a remote station.</p><p>Several digital modulation schemes i.e. binary phase-shift keying (BPSK), quadrature phase-shift keying (QPSK), quadrature amplitude modulation (QAM) are used to measure the performance of the system in [<xref ref-type="bibr" rid="scirp.63417-ref11">11</xref>] [<xref ref-type="bibr" rid="scirp.63417-ref12">12</xref>] . It is observed that a well-known cryptographic algorithm RSA [<xref ref-type="bibr" rid="scirp.63417-ref13">13</xref>] is used by researchers [<xref ref-type="bibr" rid="scirp.63417-ref7">7</xref>] for ensuring security of the transmitted message. Research [<xref ref-type="bibr" rid="scirp.63417-ref14">14</xref>] - [<xref ref-type="bibr" rid="scirp.63417-ref16">16</xref>] on MIMO with maximal ratio combining (MRC), selection combining (SC) and equal gain combining (EGC) diversity reception over several correlated and uncorrelated fading channels is also going on.</p><p>In this research, Alamouti space-time block coding is applied on transmission channel with incorporation of RSA, for successful recovery of an image. We summarize our key contributions as follows:</p><p> We proposed an algorithm to transmit image through Alamouti channel because of its full spatial diversity gain and observe the quality of recovered image by measuring the bit error rate.</p><p> Furthermore, to ensure security we apply the RSA algorithm on each pixel of the image.</p><p> We perform a number of experiments over Rayleigh fading channels by varying SNR and by applying 16-QAM modulation schemes in order to measure the performance of the system.</p><p>The remainder of this paper is organized as follows. Section 2 presents our proposed algorithm of recovering image through Alamouti scheme with incorporation of RSA. In Section 3, we present our experimental results in details with respect to a variety of parameters. Finally, Section 4 concludes the paper with future research directions.</p></sec><sec id="s2"><title>2. System Model</title><p>The space-time block code (STBC) is used to achieve orthogonality among transmitted symbols of individual antenna of the MIMO system [<xref ref-type="bibr" rid="scirp.63417-ref17">17</xref>] [<xref ref-type="bibr" rid="scirp.63417-ref18">18</xref>] . Alamouti scheme is a full rate OSTBC where two transmits and one receive antenna are used provided the receiver has the knowledge of channel gain. When more than two antennas are used, then orthogonality is possible but transmission rate become 1/2 or 3/4, for example, sporadic code.</p><sec id="s2_1"><title>2.1. Full Rate STBC</title><p>Full rate STBC is also possible for the case of transmitted antennas, n<sub>T</sub> = 2<sup>k</sup>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x6.png" xlink:type="simple"/></inline-formula>; but full orthogonality is not possible and the scheme is called QSTBC explained in [<xref ref-type="bibr" rid="scirp.63417-ref19">19</xref>] - [<xref ref-type="bibr" rid="scirp.63417-ref21">21</xref>] . We can apply zero forcing (ZF) on QSTBC to convert its full orthogonal [<xref ref-type="bibr" rid="scirp.63417-ref21">21</xref>] at the expense of noise. In OSTBC the multiplication channel matrix and its conjugate transpose produces a diagonal matrix i.e. the off-diagonal elements are zero. In case of quasi- orthogonal, the result produces a few non-zero off-diagonal elements like below:</p><disp-formula id="scirp.63417-formula8"><graphic  xlink:href="http://html.scirp.org/file/1-1730308x7.png"  xlink:type="simple"/></disp-formula><p>where, each element of the matrix h<sub>i</sub> indicates the channel gain, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x8.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x9.png" xlink:type="simple"/></inline-formula></p><p>In zero forcing decoding technique, the quasi-orthogonal reception is made fully orthogonal. Here we can eliminate interferences at the expense of noise. From MIMO scheme, the received signal vector is</p><disp-formula id="scirp.63417-formula9"><graphic  xlink:href="http://html.scirp.org/file/1-1730308x10.png"  xlink:type="simple"/></disp-formula><p>The estimated received signal vector under ZF is</p><disp-formula id="scirp.63417-formula10"><graphic  xlink:href="http://html.scirp.org/file/1-1730308x11.png"  xlink:type="simple"/></disp-formula><p>Now we have to go for better STBC technique, which provides orthogonality among the received symbols at the same time noise is not enhanced like ZF algorithm of above. In this case, we can choose the simplest possible orthogonal STBC of two antenna systems, called Alamouti scheme discussed in next subsection.</p></sec><sec id="s2_2"><title>2.2. Alamouti Scheme</title><p>Alamouti scheme is a space-time block code under MISO, where the transmitting end uses two antennas and the receiver side has only one antenna, hence the system has no scope of using combining scheme. It is the only full rate orthogonal STBC discussed in [<xref ref-type="bibr" rid="scirp.63417-ref22">22</xref>] . In Alamouti scheme two symbols <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x12.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x13.png" xlink:type="simple"/></inline-formula> are transmitted simultaneously by the antennas at instant t and t + T according to <xref ref-type="table" rid="table1">Table 1</xref>; where T is the duration of a symbol as discussed in [<xref ref-type="bibr" rid="scirp.63417-ref23">23</xref>] .</p><p>The gain of two wireless links or multipath fading factors is complex expressed as: <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x14.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x15.png" xlink:type="simple"/></inline-formula>. The entire scenario of Alamouti scheme is visualized from <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>The complex received signal at time <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x16.png" xlink:type="simple"/></inline-formula> is expressed as</p><disp-formula id="scirp.63417-formula11"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1730308x17.png"  xlink:type="simple"/></disp-formula><p>The corresponding received signal at time <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x18.png" xlink:type="simple"/></inline-formula> is</p><disp-formula id="scirp.63417-formula12"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1730308x19.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x20.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x21.png" xlink:type="simple"/></inline-formula> are the AWGN noise.</p><p>From (1) and (2),</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Alamuoti scheme in simplest form</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x22.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Symbol sequence of two antenna elements</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Time</th><th align="center" valign="middle" >T<sub>x</sub><sub>1</sub></th><th align="center" valign="middle" >T<sub>x</sub><sub>2</sub></th></tr></thead><tr><td align="center" valign="middle" >t</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x23.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x24.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >t+T</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x25.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x26.png" xlink:type="simple"/></inline-formula></td></tr></tbody></table></table-wrap><disp-formula id="scirp.63417-formula13"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1730308x27.png"  xlink:type="simple"/></disp-formula><p>Now, the output of the linear combiner using the concept of channel knowledge of [<xref ref-type="bibr" rid="scirp.63417-ref24">24</xref>] [<xref ref-type="bibr" rid="scirp.63417-ref25">25</xref>] ,</p><disp-formula id="scirp.63417-formula14"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1730308x28.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.63417-formula15"><graphic  xlink:href="http://html.scirp.org/file/1-1730308x29.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.63417-formula16"><graphic  xlink:href="http://html.scirp.org/file/1-1730308x30.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.63417-formula17"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1730308x31.png"  xlink:type="simple"/></disp-formula><p>In<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x32.png" xlink:type="simple"/></inline-formula>, there is no component of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x33.png" xlink:type="simple"/></inline-formula> and in<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x34.png" xlink:type="simple"/></inline-formula>, there is no component of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x35.png" xlink:type="simple"/></inline-formula>, hence the system is fully orthogonal. The simulation of entire Alamouti scheme under fading channel can be represented by the flowchart of <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p></sec><sec id="s2_3"><title>2.3. Algorithm</title><p>This subsection provides the algorithm of image processing and transmission of the image through fading channel.</p><p>1. Select an RGB image and convert it to grayscale. Resize the image as the size of N &#215; N.</p><p>2. Covert the image to a column vector Γ of size of 1 &#215; N<sup>2</sup>.</p><p>3. Divide the amplitude of each pixel of column vector by 16 and store the remainder R(i) and quotient Q(i) of ith pixel where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x36.png" xlink:type="simple"/></inline-formula> using the concept of [<xref ref-type="bibr" rid="scirp.63417-ref26">26</xref>] .</p><p>4. Since the amplitude of each pixel is in the range of 0 - 255 therefore both R(i) and Q(i) has the value in the range of 0 - 15 hence we can use the values as the constellation points of 16-QAM.</p><p>5. Assign each value of R(i) and Q(i) against a constellation point of 16-QAM.</p><p>6. Transmit the constellation points or symbols against corresponding values of R(i) and Q(i) thorough a Alamouti simulator with Rayleigh fading channel contaminated by AWGN. The flowchart of simulator is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p><p>7. Recover each constellation points using orthogonal space diversity algorithm at the receiving end.</p><p>8. Convert the constellation points to Q(i) and R(i).</p><p>9. Evaluate the amplitude of pixel using Γ(i) = 16 * Q(i) + R(i).</p><p>10. Convert the column vector Γ to the matrix N &#215; N in the reverse way of step 2.</p><p>11. Smooth the image using DWT with a threshold value.</p><p>We can apply RSA algorithm of [<xref ref-type="bibr" rid="scirp.63417-ref27">27</xref>] [<xref ref-type="bibr" rid="scirp.63417-ref28">28</xref>] on R(i) and Q(i) at step 5 to achieve secured communication.</p></sec></sec><sec id="s3"><title>3. Results</title><p>Let us first select a test image (main gate of Jahangirnagar University campus) and apply the algorithm on it for the fading channel of average SNR of 12, 15, 20, 25 and 30 dB. The corresponding results are shown in Figures 3-7. The recovered image is found appreciable at a glance for 20 dB or above. The quality of received image improves at higher SNR is visualized from the figures. We can get better results by applying lower modulation scheme like, BPSK, QPSK, 8-PSK instead of 16-QAM, although throughput is higher at higher modulation scheme. We measure the BER of the same image (main gate of JU campus) for four different modulation schemes shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>, where we get the conventional results, i.e. performance is better for lower modulation scheme. Actually the algorithm has very small effect on different images in context of BER. The phenomenon is shown in <xref ref-type="table" rid="table2">Table 2</xref>, where we select 6 different images and measure BER under 16-QAM taking SNR</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Flowchart of Alamouti Simulator</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x37.png"/></fig><p>from 12 to 30 dB. Finally, for secured communication we apply RSA algorithm on Q(i) and R(i) of four images. The corresponding results are shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>, where we show the original RGB image, its grayscale version, encrypted image and recovered/decrypted image.</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Image recovery at SNR of 12dB using 16-QAM</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x38.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Image recovery at SNR of 15dB using 16-QAM</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x39.png"/></fig><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Image recovery at SNR of 20dB using 16-QAM</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x40.png"/></fig><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Image recovery at SNR of 25dB using 16-QAM</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x41.png"/></fig><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Image recovery at SNR of 30dB using 16-QAM</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x42.png"/></fig><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> BER of the image of JU Gate under four different modulation schemes</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x43.png"/></fig><fig-group id="fig9"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Encryption and decryption of image.</title></caption><fig id ="fig9_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x44.png"/></fig><fig id ="fig9_2"><label>(c)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x45.png"/></fig><fig id ="fig9_3"><label> (d)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x46.png"/></fig><fig id ="fig9_4"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1730308x47.png"/></fig></fig-group><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> BER of six test images under 16-QAM</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >SNR (dB)</th><th align="center" valign="middle" >BER (image 1) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x48.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" >BER (image 2) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x49.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" >BER (image 3) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x50.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" >BER (image 4) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x51.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" >BER (image 5) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x52.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" >BER (image 6) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1730308x53.png" xlink:type="simple"/></inline-formula></th></tr></thead><tr><td align="center" valign="middle" >12</td><td align="center" valign="middle" >0.2082</td><td align="center" valign="middle" >0.2074</td><td align="center" valign="middle" >0.2092</td><td align="center" valign="middle" >0.2059</td><td align="center" valign="middle" >0.2076</td><td align="center" valign="middle" >0.2107</td></tr><tr><td align="center" valign="middle" >14</td><td align="center" valign="middle" >0.1835</td><td align="center" valign="middle" >0.1813</td><td align="center" valign="middle" >0.1826</td><td align="center" valign="middle" >0.1803</td><td align="center" valign="middle" >0.1830</td><td align="center" valign="middle" >0.1862</td></tr><tr><td align="center" valign="middle" >16</td><td align="center" valign="middle" >0.1598</td><td align="center" valign="middle" >0.1587</td><td align="center" valign="middle" >0.1600</td><td align="center" valign="middle" >0.1579</td><td align="center" valign="middle" >0.1612</td><td align="center" valign="middle" >0.1629</td></tr><tr><td align="center" valign="middle" >18</td><td align="center" valign="middle" >0.1370</td><td align="center" valign="middle" >0.1366</td><td align="center" valign="middle" >0.1374</td><td align="center" valign="middle" >0.1349</td><td align="center" valign="middle" >0.1386</td><td align="center" valign="middle" >0.1399</td></tr><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >0.1158</td><td align="center" valign="middle" >0.1154</td><td align="center" valign="middle" >0.1156</td><td align="center" valign="middle" >0.1146</td><td align="center" valign="middle" >0.1158</td><td align="center" valign="middle" >0.1164</td></tr><tr><td align="center" valign="middle" >22</td><td align="center" valign="middle" >0.0920</td><td align="center" valign="middle" >0.0911</td><td align="center" valign="middle" >0.0921</td><td align="center" valign="middle" >0.0919</td><td align="center" valign="middle" >0.0930</td><td align="center" valign="middle" >0.0932</td></tr><tr><td align="center" valign="middle" >24</td><td align="center" valign="middle" >0.0692</td><td align="center" valign="middle" >0.0686</td><td align="center" valign="middle" >0.0685</td><td align="center" valign="middle" >0.0676</td><td align="center" valign="middle" >0.0695</td><td align="center" valign="middle" >0.0704</td></tr><tr><td align="center" valign="middle" >26</td><td align="center" valign="middle" >0.0490</td><td align="center" valign="middle" >0.0477</td><td align="center" valign="middle" >0.0487</td><td align="center" valign="middle" >0.0483</td><td align="center" valign="middle" >0.0486</td><td align="center" valign="middle" >0.0492</td></tr><tr><td align="center" valign="middle" >28</td><td align="center" valign="middle" >0.0310</td><td align="center" valign="middle" >0.0305</td><td align="center" valign="middle" >0.0317</td><td align="center" valign="middle" >0.0296</td><td align="center" valign="middle" >0.0304</td><td align="center" valign="middle" >0.0309</td></tr><tr><td align="center" valign="middle" >30</td><td align="center" valign="middle" >0.0179</td><td align="center" valign="middle" >0.0177</td><td align="center" valign="middle" >0.0176</td><td align="center" valign="middle" >0.0176</td><td align="center" valign="middle" >0.0178</td><td align="center" valign="middle" >0.0181</td></tr></tbody></table></table-wrap></sec><sec id="s4"><title>4. Conclusion</title><p>In this paper, we are able to recover an image transmitting through Alamouti channel with incorporation of RSA algorithm; where the quality of the image depends on the SNR of the channel. Although we reveal the results for grayscale images, we can also do the similar job for RGB images as well, sending the R, G and B components separately, then combining and at receiving end. We can apply channel coding scheme like linear block code, convolutional code or CRC (Cyclic Redundancy Code) scheme to enhance the performance of the system. MIMO and combining scheme (maximal ratio combining, equal gain, selection combining) can be considered an alternate technique of improvement of the system.</p></sec><sec id="s5"><title>Cite this paper</title><p>AnindaMajumder,Mohammad RaihanRuhin,TahsinaHashem,Md. ImdadulIslam, (2016) Recovery of Image through Alamouti Channel with Incorporation of RSA Algorithm. Journal of Computer and Communications,04,1-10. doi: 10.4236/jcc.2016.42001</p></sec></body><back><ref-list><title>References</title><ref id="scirp.63417-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">El-Astal, M.T.O., Abu-Hudrouss, A.M., Salmon, B.P. and Olivier, J.C. (2015) An Adaptive Transmission Protocol for Exploiting Diversity and Multiplexing Gains in Wireless Relaying Networks. EURASIP Journal on Wireless Communications and Networking, 2015, 1-15.</mixed-citation></ref><ref id="scirp.63417-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Gupta, S., Dutta, R.K. and Tiwari, A.C. (2014) Performance Analysis of Alamouti and Orthogonal Space-Time Block Codes in MIMO System under Rayleigh Fading Scenario. International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering, 3, 12423-12429.</mixed-citation></ref><ref id="scirp.63417-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Rao, V. and Malavika, T. (2014) Performance Analysis of MIMO-OFDM for Multiple Antennas. International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering, 3, 9349-9355.</mixed-citation></ref><ref id="scirp.63417-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Jassim, F.A. and Qassim, H.E. (2012) Five Modulus Method for Image Compression. Signal &amp; Image Processing: An International Journal (SIPIJ), 3, 19-28.</mixed-citation></ref><ref id="scirp.63417-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Ayele, A.A. and Sreenivasarao, V. (2013) Modified RSA Encryption Technique Based on Multiple Public Keys. International Journal of Innovative Research in Computer and Communication Engineering, 1, 859-864.</mixed-citation></ref><ref id="scirp.63417-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Jamgekar, R.S. and Joshi, G.S. (2013) File Encryption and Decryption Using Secure RSA. International Journal of Emerging Science and Engineering (IJESE), 1, 11-14.</mixed-citation></ref><ref id="scirp.63417-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Chaudhary, S. and Patil, A.J. (2012) Performance Analysis of Mimo-Space Time Block Coding with Different Modulation Techniques. ICTACT Journal on Communication Technology, 3, 510-514.</mixed-citation></ref><ref id="scirp.63417-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Park, U., Kim, Y. and Kim, S. (2010) A New Result on Turbo Coded QO-STBC Schemes. IEEE Communications Letters, 14, 199-201. http://dx.doi.org/10.1109/LCOMM.2010.03.092404</mixed-citation></ref><ref id="scirp.63417-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Badic, B., Rupp, M. and Weinrichter, H. (2004) Quasi-Orthogonal Space-Time Block Codes for Data Transmission over Four and Eight Transmit Antennas with Very Low Feedback Rate. 5th International ITG Conference on Source and Channel Coding (SCC), Erlangen, 14-16 January 2004, 157-164.</mixed-citation></ref><ref id="scirp.63417-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Badic, B., Herdin, M., Weinrichter, H. and Rupp, M. (2004) Quasi-Orthogonal Space-Time Block Codes on Measured MIMO Channels. Joint IST Workshop on Mobile Future, 2004 and the Symposium on Trends in Communications, Bratislava, 24-26 October 2004, 17-20.</mixed-citation></ref><ref id="scirp.63417-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Bhatnagar, M.R., Vishwanath, R. and Bhatnagar, V. (2007) Performance Analysis of Space-Time Block Codes in Flat Fading MIMO Channels with Offsets. EURASIP Journal on Wireless Communications and Networking, 2007, Article ID: 030548.</mixed-citation></ref><ref id="scirp.63417-ref12"><label>12</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Perisoara</surname><given-names> L.A. </given-names></name>,<etal>et al</etal>. (<year>2012</year>)<article-title>BER Analysis of STBC Codes for MIMO Rayleigh Flat Fading Channels</article-title><source> Telfor Journal</source><volume> 4</volume>,<fpage> 78</fpage>-<lpage>82</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.63417-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Ahmed, T., Anower, M.S., Sarkar, M.Z.I. and Ali, M.M. (2013) Investigation of Correlated Rayleigh Fading Channel with Alamouti’s STBC-MRC System. International Journal of Advanced Science and Technology, 58, 65-74. http://dx.doi.org/10.14257/ijast.2013.58.06</mixed-citation></ref><ref id="scirp.63417-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Fang, L., Bi, G. and Kot, A.C. (2000) New Method of Performance Analysis for Diversity Reception with Correlated Rayleigh-Fading Signals. IEEE Transactions on Vehicular Technology, 49, 1807-1812. http://dx.doi.org/10.1109/25.892585</mixed-citation></ref><ref id="scirp.63417-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Saeed, A., Xu, H.J. and Quazi, T. (2014) Alamouti Space-Time Block Coded Hierarchical Modulation with Signal Space Diversity and MRC Reception in Nakagami-m Fading Channel. IET Communications, 8, 516-524.http://dx.doi.org/10.1049/iet-com.2013.0519</mixed-citation></ref><ref id="scirp.63417-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Stallings, W. (2005) Cryptography and Network Security Principles and Practices. 4th Edition, Prentice-Hall, New Jersey.</mixed-citation></ref><ref id="scirp.63417-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Gu, D. and Leung, C. (2003) Performance Analysis of Transmit Diversity Scheme with Imperfect Channel Estimation. IEEE Electronics Letters, 39, 402-403. http://dx.doi.org/10.1049/el:20030243</mixed-citation></ref><ref id="scirp.63417-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Xia, B. and Wang, J. (2005) Effect of Channel Estimation Error on QAM Systems with Antenna Diversity. IEEE Transactions on Communications, 53, 481-488.</mixed-citation></ref><ref id="scirp.63417-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Ryan, W.E. and Lin, S. (2009) Channel Codes: Classical and Modern. Cambridge University Press, Cambridge, UK, 4.</mixed-citation></ref><ref id="scirp.63417-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Sklar, B. (2001) Digital Communications: Fundamentals and Applications. 2nd Edition, Prentice Hall, Upper Saddle River.</mixed-citation></ref><ref id="scirp.63417-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Anoh, K.O.O., Ochonogor, O., Abd-Alhameed, R.A.A., Jones, S.M.R. and Mapuka, T.T. (2014) Improved Alamouti STBC Multi-Antenna System Using Hadamard Matrices. International Journal of Communications, Network and System Sciences, 7, 83-89. http://dx.doi.org/10.4236/ijcns.2014.73010</mixed-citation></ref><ref id="scirp.63417-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Ahmed, T., Ali, M.M. and Ullah, S.E. (2012) BER Performance Analysis of a STBC Encoded Secured Multiuser MIMO-OFDM Wireless Communication System. International Journal of Hybrid Information Technology, 5, 19-30.</mixed-citation></ref><ref id="scirp.63417-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Alam, M.M., Islam, A.Z.M.T. and Ullah, S.E. (2011) Performance Analysis of a Concatenated LDPC Coded Alamouti Based STBC-OFDM System on Text Message Transmission. International Journal of Computer Science, Engineering and Applications (IJCSEA), 1, 1-9.</mixed-citation></ref><ref id="scirp.63417-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple">Derryberry, R.T., Gray, S.D., Ionescu, D.M., Mandyam, G. and Raghothaman, B. (2002) Transmit Diversity in 3G CDMA Systems. IEEE Communications Magazine, 40, 68-75. http://dx.doi.org/10.1109/35.995853</mixed-citation></ref><ref id="scirp.63417-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Wang, X.Y. and Wang, J. (2004) Effect of Imperfect Channel Estimation on Transmit Diversity in CDMA Systems. IEEE Transactions on Vehicular Technology, 53, 1400-1412.</mixed-citation></ref><ref id="scirp.63417-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Alamouti, S. (1998) A Simple Transmit Diversity Technique for Wireless Communications. IEEE Journal on Selected Areas in Communications, 16, 1451-1458. http://dx.doi.org/10.1109/49.730453</mixed-citation></ref><ref id="scirp.63417-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Zhu, H.L., Xia, B. and Tan, Z.H. (2011) Performance Analysis of Alamouti Transmit Diversity with QAM in Imperfect Channel Estimation. IEEE Journal on Selected Areas in Communications, 29, 1242-1248.</mixed-citation></ref><ref id="scirp.63417-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, J.K., Chen, S., Mu, X.M. and Hanzo, L. (2011) Joint Channel Estimation and Multiuser Detection for SDMA/OFD Based on Dual Repeated Weighted Boosting Search. IEEE Transactions on Vehicular Technology, 60, 3265-3275. http://dx.doi.org/10.1109/TVT.2011.2161356</mixed-citation></ref></ref-list></back></article>