Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140212
Seyyedali Hosseinalipour, A. Sakzad, Mohammad-Reza Sadeghi
In this paper, we study the minimum free distance of the Consultative Committee for Space Data Systems (CCSDS) standard turbo encoder with Möbius interleavers. We introduce a new class of deterministic interleavers based on the Möbius interleavers called truncated Möbius interleavers and investigate their cycle structure. We find the exact number of total cycles of these interleavers and an upper bound on the binary fixed points in all of their cycles shifts. We derive the run time of the binary fixed point algorithm, which is used for estimating the minimum free distance of the employed turbo codes. Finally, we introduce some criteria to reduce the number of total cycles. This leads us to reduce the run time of the aforementioned algorithm.
{"title":"Minimum free distance of CCSDS turbo encoders under (Truncated) Möbius interleavers","authors":"Seyyedali Hosseinalipour, A. Sakzad, Mohammad-Reza Sadeghi","doi":"10.1109/IWCIT.2015.7140212","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140212","url":null,"abstract":"In this paper, we study the minimum free distance of the Consultative Committee for Space Data Systems (CCSDS) standard turbo encoder with Möbius interleavers. We introduce a new class of deterministic interleavers based on the Möbius interleavers called truncated Möbius interleavers and investigate their cycle structure. We find the exact number of total cycles of these interleavers and an upper bound on the binary fixed points in all of their cycles shifts. We derive the run time of the binary fixed point algorithm, which is used for estimating the minimum free distance of the employed turbo codes. Finally, we introduce some criteria to reduce the number of total cycles. This leads us to reduce the run time of the aforementioned algorithm.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140205
Salman Beigi, O. Etesami, A. Gohari
“Help bits” are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or instances. Assume that we can efficiently solve k instances of a decision problem using some help bits whose entropy is less than k when the k instances are drawn independently from a particular distribution. Then there is an upper bound on the average-case complexity of the problem, namely we can efficiently solve an instance drawn from that distribution correctly with probability better than 1/2.
{"title":"The value of information-theoretic content of help bits for computation","authors":"Salman Beigi, O. Etesami, A. Gohari","doi":"10.1109/IWCIT.2015.7140205","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140205","url":null,"abstract":"“Help bits” are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or instances. Assume that we can efficiently solve k instances of a decision problem using some help bits whose entropy is less than k when the k instances are drawn independently from a particular distribution. Then there is an upper bound on the average-case complexity of the problem, namely we can efficiently solve an instance drawn from that distribution correctly with probability better than 1/2.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130692531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140206
G. Hodtani
Transmitter-receiver re-cognition is defined information-theoretically and, as a communication theory example of energy extracting intelligence, its effect on the channel capacity is demonstrated, by considering linear Gaussian channel with two sided input-noise dependent side information, which is a continuous alphabet extension of discrete alphabet Cover-Chiang capacity theorem.
{"title":"The effect of transceiver recognition on the Gaussian channel capacity","authors":"G. Hodtani","doi":"10.1109/IWCIT.2015.7140206","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140206","url":null,"abstract":"Transmitter-receiver re-cognition is defined information-theoretically and, as a communication theory example of energy extracting intelligence, its effect on the channel capacity is demonstrated, by considering linear Gaussian channel with two sided input-noise dependent side information, which is a continuous alphabet extension of discrete alphabet Cover-Chiang capacity theorem.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124166775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140218
M. J. Khojasteh, M. Shoreh, J. Salehi
In this paper, we investigate PN-sequences with ideal autocorrelation property and the consequences of this property on the number of +1s and -1s and run structure of sequences. We begin by discussing and surveying about the length of PN-sequences with ideal autocorrelation property. From our discussion and survey we introduce circulant matrix representation of PN-sequence. Through circulant matrix representation we obtain system of non-linear equations that lead to ideal autocorrelation property. Rewriting PN-sequence and its autocorrelation property in {0,1} leads to a definition based on Hamming weight and Hamming distance and hence we can easily prove some results on the PN-sequences with ideal autocorrelation property.
{"title":"Circulant matrix representation of PN-sequences with ideal autocorrelation property","authors":"M. J. Khojasteh, M. Shoreh, J. Salehi","doi":"10.1109/IWCIT.2015.7140218","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140218","url":null,"abstract":"In this paper, we investigate PN-sequences with ideal autocorrelation property and the consequences of this property on the number of +1s and -1s and run structure of sequences. We begin by discussing and surveying about the length of PN-sequences with ideal autocorrelation property. From our discussion and survey we introduce circulant matrix representation of PN-sequence. Through circulant matrix representation we obtain system of non-linear equations that lead to ideal autocorrelation property. Rewriting PN-sequence and its autocorrelation property in {0,1} leads to a definition based on Hamming weight and Hamming distance and hence we can easily prove some results on the PN-sequences with ideal autocorrelation property.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"62 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125883303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140211
Roghayeh Joda, E. Erkip, F. Lahouti
In this paper, the problem of lossy source coding with side information at the decoder is considered when the dependency between the source and the side information (SI) is quasi-stationary and unknown to the encoder. This dependency is modeled using a (virtual) block fading channel. In order to help the decoder estimate the dependency, a part of the transmitted source in each block is coded at high rate (disregarding the SI) to be decoded error-free at the decoder. The estimate of the virtual block fading channel is imperfect and its quality depends on the length of the estimation block. The decoder's estimate is then quantized and communicated back to the encoder using a limited rate feedback. The encoder encodes the rest of the source block with this knowledge of the SI dependency model. A source coding scheme that uses the estimated dependency structure is proposed and the appropriate length of the source assigned for the estimation phase is characterized so as to minimize the mean distortion. The effect of the feedback rate, the quantization step size and the dependency estimation error are also investigated.
{"title":"Wyner-Ziv source coding with feedback and uncertain side information","authors":"Roghayeh Joda, E. Erkip, F. Lahouti","doi":"10.1109/IWCIT.2015.7140211","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140211","url":null,"abstract":"In this paper, the problem of lossy source coding with side information at the decoder is considered when the dependency between the source and the side information (SI) is quasi-stationary and unknown to the encoder. This dependency is modeled using a (virtual) block fading channel. In order to help the decoder estimate the dependency, a part of the transmitted source in each block is coded at high rate (disregarding the SI) to be decoded error-free at the decoder. The estimate of the virtual block fading channel is imperfect and its quality depends on the length of the estimation block. The decoder's estimate is then quantized and communicated back to the encoder using a limited rate feedback. The encoder encodes the rest of the source block with this knowledge of the SI dependency model. A source coding scheme that uses the estimated dependency structure is proposed and the appropriate length of the source assigned for the estimation phase is characterized so as to minimize the mean distortion. The effect of the feedback rate, the quantization step size and the dependency estimation error are also investigated.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123474400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140217
E. Zandi, Guido Dartmann, G. Ascheid, R. Mathar
Cooperative relay communication is an interesting area of research, since it is to enhance data rate and coverage in wireless networks. In this paper, we propose a method to optimize power allocation strategy in an amplify-and-forward relay system. Our objective is to attain a max-min fairness within co-channel users. To reduce the complexity we maximize the upper bound on the performance. The reason is that this bound is observed to be tight in low noise conditions. Therefore, one achievement of this work is separating the problem of relay pre-coding design from power allocation. Then, the power control is done iteratively via the proposed low-complexity algorithm whose convergence is proven. The relay precoder can be subsequently designed via existing methods, such as semidefinite programming, nonetheless, it is beyond the main focus of the current work. The optimality of the proposed power allocation algorithm is very hard to mathematically prove. Yet, the simulation results are promising.
{"title":"Fast power control for amplify-and-forward multiple-antenna bidirectional relays","authors":"E. Zandi, Guido Dartmann, G. Ascheid, R. Mathar","doi":"10.1109/IWCIT.2015.7140217","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140217","url":null,"abstract":"Cooperative relay communication is an interesting area of research, since it is to enhance data rate and coverage in wireless networks. In this paper, we propose a method to optimize power allocation strategy in an amplify-and-forward relay system. Our objective is to attain a max-min fairness within co-channel users. To reduce the complexity we maximize the upper bound on the performance. The reason is that this bound is observed to be tight in low noise conditions. Therefore, one achievement of this work is separating the problem of relay pre-coding design from power allocation. Then, the power control is done iteratively via the proposed low-complexity algorithm whose convergence is proven. The relay precoder can be subsequently designed via existing methods, such as semidefinite programming, nonetheless, it is beyond the main focus of the current work. The optimality of the proposed power allocation algorithm is very hard to mathematically prove. Yet, the simulation results are promising.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132214057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-06DOI: 10.1109/IWCIT.2015.7140222
Hediyeh Soltanizadeh, F. Parvaresh
The diversity-multiplexing trade-off (DMT) expresses the optimal trade-off between the transmission rate and the error probability for communications at high signal to noise ratios (SNR) in wireless networks with fading channels. For half-duplex single relay networks with quasi-static fading channels, if the average signal to noise ratio (SNR) of the source-relay (S-R) link is equal to the average SNR of the relay-destination (RD) link, quantize-map-and-forward (QMF) and dynamic decode-and-forward (DDF) strategies are DMT optimal at high and low multiplexing gains, respectively. In this paper, we show that DDF and SQMF strategies are not generally DMT optimal in half-duplex single relay networks when the average SNR of the S-R link and R-D link are not equal. We show that DMT of dynamic QMF strategy is strictly greater than DMT of DDF and static QMF strategies for a specific half-duplex single relay network at certain multiplexing gains.
{"title":"On the suboptimality of DDF and static QMF communication strategies in half-duplex single relay networks","authors":"Hediyeh Soltanizadeh, F. Parvaresh","doi":"10.1109/IWCIT.2015.7140222","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140222","url":null,"abstract":"The diversity-multiplexing trade-off (DMT) expresses the optimal trade-off between the transmission rate and the error probability for communications at high signal to noise ratios (SNR) in wireless networks with fading channels. For half-duplex single relay networks with quasi-static fading channels, if the average signal to noise ratio (SNR) of the source-relay (S-R) link is equal to the average SNR of the relay-destination (RD) link, quantize-map-and-forward (QMF) and dynamic decode-and-forward (DDF) strategies are DMT optimal at high and low multiplexing gains, respectively. In this paper, we show that DDF and SQMF strategies are not generally DMT optimal in half-duplex single relay networks when the average SNR of the S-R link and R-D link are not equal. We show that DMT of dynamic QMF strategy is strictly greater than DMT of DDF and static QMF strategies for a specific half-duplex single relay network at certain multiplexing gains.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133960837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-02-19DOI: 10.1109/IWCIT.2015.7140210
P. Banerjee
We address the problem of quantifying the cryptographic content of probability distributions, in relation to an application to secure multi-party sampling against a passive t-adversary. We generalize a recently introduced notion of assisted common information of a pair of correlated sources to that of K sources and define a family of monotone rate regions indexed by K. This allows for a simple characterization of all t-private distributions that can be statistically securely sampled without any auxiliary setup of pre-shared noisy correlations. We also give a new monotone called the residual total correlation that admits a simple operational interpretation. Interestingly, for sampling with non-trivial setups (K > 2) in the public discussion model, our definition of a monotone region differs from the one by Prabhakaran and Prabhakaran (ITW 2012).
我们探讨了概率分布加密内容的量化问题，并将其应用于针对被动 t 逆源的多方安全采样。我们将最近引入的一对相关源的辅助公共信息概念推广到 K 个源的辅助公共信息，并定义了一个以 K 为索引的单调率区域族。这样就可以简单描述所有 t-private 分布，这些分布可以在没有任何预共享噪声相关性辅助设置的情况下进行统计安全采样。我们还给出了一种新的单调，称为残余总相关性，它允许一种简单的操作解释。有趣的是，对于公共讨论模型中的非三重设置（K > 2）采样，我们对单调区域的定义与 Prabhakaran 和 Prabhakaran（ITW，2012 年）的定义不同。
{"title":"Multipartite monotones for secure sampling by public discussion from noisy correlations","authors":"P. Banerjee","doi":"10.1109/IWCIT.2015.7140210","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140210","url":null,"abstract":"We address the problem of quantifying the cryptographic content of probability distributions, in relation to an application to secure multi-party sampling against a passive t-adversary. We generalize a recently introduced notion of assisted common information of a pair of correlated sources to that of K sources and define a family of monotone rate regions indexed by K. This allows for a simple characterization of all t-private distributions that can be statistically securely sampled without any auxiliary setup of pre-shared noisy correlations. We also give a new monotone called the residual total correlation that admits a simple operational interpretation. Interestingly, for sampling with non-trivial setups (K > 2) in the public discussion model, our definition of a monotone region differs from the one by Prabhakaran and Prabhakaran (ITW 2012).","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130661053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-26DOI: 10.1109/IWCIT.2015.7140220
S. Ghavami, V. Rahmati, F. Lahouti, L. Schwabe
We are interested in understanding the neural correlates of attentional processes using first principles. Here we apply a recently developed first principles approach that uses transmitted information in bits per joule to quantify the energy efficiency of information transmission for an inter-spike-interval (ISI) code that can be modulated by means of the synchrony in the presynaptic population. We simulate a single compartment conductance-based model neuron driven by excitatory and inhibitory spikes from a presynaptic population, where the rate and synchrony in the presynaptic excitatory population may vary independently from the average rate. We find that for a fixed input rate, the ISI distribution of the post synaptic neuron depends on the level of synchrony and is well-described by a Gamma distribution for synchrony levels less than 50%. For levels of synchrony between 15% and 50% (restricted for technical reasons), we compute the optimum input distribution that maximizes the mutual information per unit energy. This optimum distribution shows that an increased level of synchrony, as it has been reported experimentally in attention-demanding conditions, reduces the mode of the input distribution and the excitability threshold of post synaptic neuron. This facilitates a more energy efficient neuronal communication.
{"title":"Synchrony in neuronal communication: An energy efficient scheme","authors":"S. Ghavami, V. Rahmati, F. Lahouti, L. Schwabe","doi":"10.1109/IWCIT.2015.7140220","DOIUrl":"https://doi.org/10.1109/IWCIT.2015.7140220","url":null,"abstract":"We are interested in understanding the neural correlates of attentional processes using first principles. Here we apply a recently developed first principles approach that uses transmitted information in bits per joule to quantify the energy efficiency of information transmission for an inter-spike-interval (ISI) code that can be modulated by means of the synchrony in the presynaptic population. We simulate a single compartment conductance-based model neuron driven by excitatory and inhibitory spikes from a presynaptic population, where the rate and synchrony in the presynaptic excitatory population may vary independently from the average rate. We find that for a fixed input rate, the ISI distribution of the post synaptic neuron depends on the level of synchrony and is well-described by a Gamma distribution for synchrony levels less than 50%. For levels of synchrony between 15% and 50% (restricted for technical reasons), we compute the optimum input distribution that maximizes the mutual information per unit energy. This optimum distribution shows that an increased level of synchrony, as it has been reported experimentally in attention-demanding conditions, reduces the mode of the input distribution and the excitability threshold of post synaptic neuron. This facilitates a more energy efficient neuronal communication.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124868032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：