• OpenAccess
    • List of Articles Capacity

      • Open Access Article

        1 - A New Upper Bound for Free Space Optical Channel Capacity Using a Simple Mathematical in Equality
        Arezu Rezazadeh Ghosheh  Abed Hodtani
        In this paper, by using a simple mathematical inequality, we derive a $ new upper bound fkr the capacity of$ free space optical channel in coherent case. Then, by applying general fading distribution, we obtain an upper bound for mutual information in non-coherent cas More
        In this paper, by using a simple mathematical inequality, we derive a $ new upper bound fkr the capacity of$ free space optical channel in coherent case. Then, by applying general fading distribution, we obtain an upper bound for mutual information in non-coherent case. Finally, we derive the corresponding optimal input distributions for both coherent and non-coherent cases, compare the results with previous works numerically and illustrate that our results subsume some of previous results in special cases. Manuscript profile
      • Open Access Article

        2 - Statistical Analysis of Different Traffic Types Effect on QoS of Wireless Ad Hoc Networks
        Mahmood Mollaei Gharehajlu Saadan Zokaei Yousef Darmani
        IEEE 802.11 based wireless ad hoc networks are highly appealing owing to their needless of infrastructures, ease and quick deployment and high availability. Vast variety of applications such as voice and video transmission over these types of networks need different net More
        IEEE 802.11 based wireless ad hoc networks are highly appealing owing to their needless of infrastructures, ease and quick deployment and high availability. Vast variety of applications such as voice and video transmission over these types of networks need different network performances. In order to support quality of service for these applications, characterizing both packets arrival and available resources are essential. To address these issues we use Effective Bandwidth/Effective Capacity theory which expresses packet arrival and service model statistically. Effective Bandwidth asymptotically represents arrival traffic specifications using a single function. Also, Effective Capacity statistically describes service model of each node. Based on this theory, at first we modeled each node’s service as an ON/OFF process. Then a new closed form of Effective Capacity is proposed which is a simple function and is dependent on a few parameters of the network. Afterward the performance of different traffic patterns such as constant bit rate, Poisson and Markov Modulated Poisson process are statistically evaluated in the case of both single and aggregate traffic modes. Using the proposed model we will show that traffic pattern affects QoS parameters even if all models have the same average packet arrival rate. We prove the accuracy of our model by a series of simulations which are run using NS2 simulator. Manuscript profile
      • Open Access Article

        3 - Good Index Choosing for Polarized Relay Channel
        Hassan Tavakoli Saeid Pakravan
        The Polar coding is a method which have been proposed by Arikan and it is one of the first codes that achieve the capacity for vast numerous channels. This paper discusses relay channel polarization in order to achieve the capacity and it has been shown that polarizatio More
        The Polar coding is a method which have been proposed by Arikan and it is one of the first codes that achieve the capacity for vast numerous channels. This paper discusses relay channel polarization in order to achieve the capacity and it has been shown that polarization of two relay channels can be given a more achievable rate region in the general form. This method is compatible with the original vision of polarization based on the combining, splitting and polarizing of channels and it has been shown that the complexity of encoding and decoding for these codes in mentioned method are O(N log⁡〖N)〗, and also error probability for them is O(2^(〖-(N)〗^β )). Choose the best sub-channels in polarized relay channels for sending data is a big trouble in this structure. In this paper, we have been presented a new scheme for choosing a good index for sending the information bits in relay channels polarized in order to have the best performance by using sending information bits over FIF sets. Manuscript profile
      • Open Access Article

        4 - A New Capacity Theorem for the Gaussian Channel with Two-sided Input and Noise Dependent State Information
        Nima S. Anzabi-Nezhad Ghosheh  Abed Hodtani
        Gaussian interference known at the transmitter can be fully canceled in a Gaussian communication channel employing dirty paper coding, as Costa shows, when interference is independent of the channel noise and when the channel input designed independently of the interfer More
        Gaussian interference known at the transmitter can be fully canceled in a Gaussian communication channel employing dirty paper coding, as Costa shows, when interference is independent of the channel noise and when the channel input designed independently of the interference. In this paper, a new and general version of the Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the capacity in a non-limiting case, we try to analyze and solve the Gaussian version of the Cover-Chiang theorem mathematically and information-theoretically. Our capacity theorem, while including all previous theorems as its special cases, explains situations that can not be analyzed by them; for example, the effect of the correlation between the side information and the channel input on the capacity of the channel that can not be analyzed with Costa’s “writing on dirty paper" theorem. Meanwhile, we try to exemplify the concept of “cognition" of the transmitter or the receiver on a variable (here, the channel noise) with the information-theoretic concept of “side information" correlated to that variable and known at the transmitter or at the receiver. According to our theorem, the channel capacity is an increasing function of the mutual information of the side information and the channel noise. Manuscript profile
      • Open Access Article

        5 - Reliability Analysis of the Sum-Product Decoding Algorithm for the PSK Modulation Scheme
        Hadi Khodaei Jooshin Mahdi Nangir
        Iteratively decoding and reconstruction of encoded data has been considered in recent decades. Most of these iterative schemes are based on graphical codes. Messages are passed through space graphs to reach a reliable belief of the original data. This paper presents a p More
        Iteratively decoding and reconstruction of encoded data has been considered in recent decades. Most of these iterative schemes are based on graphical codes. Messages are passed through space graphs to reach a reliable belief of the original data. This paper presents a performance analysis of the Low-Density Parity-Check (LDPC) code design method which approach the capacity of the Additive White Gaussian Noise (AWGN) model for communication channels. We investigate the reliability of the system under Phase Shift Keying (PSK) modulation. We study the effects and advantages of variation in the codeword length, the rate of parity-check matrix of the LDPC codes, and the number of iterations in the Sum-Product Algorithm (SPA). By employing an LDPC encoder prior to the PSK modulation block and the SPA in the decoding part, the Bit Error Rate (BER) performance of the PSK modulation system can improve significantly. The BER performance improvement of a point-to-point communication system is measured in different cases. Our analysis is capable for applying any other iterative message-passing algorithm. The code design process of the communication systems and parameter selection of the encoding and decoding algorithms are accomplished by considering hardware limitations in a communication system. Our results help to design and select paramours efficiently. Manuscript profile
      • Open Access Article

        6 - A New High-Capacity Audio Watermarking Based on Wavelet Transform using the Golden Ratio and TLBO Algorithm
        Ali Zeidi joudaki Marjan Abdeyazdan Mohammad Mosleh Mohammad Kheyrandish
        Digital watermarking is one of the best solutions for copyright infringement, copying, data verification, and illegal distribution of digital media. Recently, the protection of digital audio signals has received much attention as one of the fascinating topics for resear More
        Digital watermarking is one of the best solutions for copyright infringement, copying, data verification, and illegal distribution of digital media. Recently, the protection of digital audio signals has received much attention as one of the fascinating topics for researchers and scholars. In this paper, we presented a new high-capacity, clear, and robust audio signaling scheme based on the DWT conversion synergy and golden ratio advantages using the TLBO algorithm. We used the TLBO algorithm to determine the effective frame length and embedded range, and the golden ratio to determine the appropriate embedded locations for each frame. First, the main audio signal was broken down into several sub-bands using a DWT in a specific frequency range. Since the human auditory system is not sensitive to changes in high-frequency bands, to increase the clarity and capacity of these sub-bands to embed bits we used the watermark signal. Moreover, to increase the resistance to common attacks, we framed the high-frequency bandwidth and then used the average of the frames as a key value. Our main idea was to embed an 8-bit signal simultaneously in the host signal. Experimental results showed that the proposed method is free from significant noticeable distortion (SNR about 29.68dB) and increases the resistance to common signal processing attacks such as high pass filter, echo, resampling, MPEG (MP3), etc. Manuscript profile