Pub Date : 2013-06-18DOI: 10.1109/CWIT.2013.6621593
A. Saleh, W. Chan, F. Alajaji
We consider the problem of sending a Gaussian source over an additive white Gaussian noise channel with Gaussian correlated interference known to the transmitter. We study both low-delay and asymptotically high-delay (in the sense of infinite source and coding block lengths) joint source-channel coding schemes based on purely analog and hybrid-digital analog (HDA) schemes with bandwidth expansion, respectively. The achievable (square error) distortion region of these schemes under matched and mismatched noise power is analyzed. The low-delay scheme uses a non-parametric analog mapping that is designed using a joint optimization of the encoder and the decoder. Numerical results show that the non-parametric approach adapts better to the interference than the classical linear scheme. For the high-delay regime, we establish a lower bound on the system's distortion and propose a layered HDA scheme based on Wyner-Ziv and HDA Costa coding. The proposed HDA scheme is shown to perform close to the derived bound and to be resilient under noise mismatch.
{"title":"Low and high-delay source-channel coding with bandwidth expansion and correlated interference","authors":"A. Saleh, W. Chan, F. Alajaji","doi":"10.1109/CWIT.2013.6621593","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621593","url":null,"abstract":"We consider the problem of sending a Gaussian source over an additive white Gaussian noise channel with Gaussian correlated interference known to the transmitter. We study both low-delay and asymptotically high-delay (in the sense of infinite source and coding block lengths) joint source-channel coding schemes based on purely analog and hybrid-digital analog (HDA) schemes with bandwidth expansion, respectively. The achievable (square error) distortion region of these schemes under matched and mismatched noise power is analyzed. The low-delay scheme uses a non-parametric analog mapping that is designed using a joint optimization of the encoder and the decoder. Numerical results show that the non-parametric approach adapts better to the interference than the classical linear scheme. For the high-delay regime, we establish a lower bound on the system's distortion and propose a layered HDA scheme based on Wyner-Ziv and HDA Costa coding. The proposed HDA scheme is shown to perform close to the derived bound and to be resilient under noise mismatch.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133951090","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621610
Khaled F. Hayajneh, S. Yousefi
Fountain codes are typically defined solely based on the right degree distributions which are Soliton or Soliton-like in most cases. In this paper, we consider Fountain encoders for the Gaussian channel and improve their performance by shaping the resulting left degree distributions away from Poisson. The proposed Fountain encoders achieve lower left degree variance at the same average degree. This in turn improves the growth of the so-called ripple in the BP decoding. The new encoders outperform the traditional ones in terms of overhead, error rate, and decoding complexity.
{"title":"Improved systematic fountain codes in AWGN channel","authors":"Khaled F. Hayajneh, S. Yousefi","doi":"10.1109/CWIT.2013.6621610","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621610","url":null,"abstract":"Fountain codes are typically defined solely based on the right degree distributions which are Soliton or Soliton-like in most cases. In this paper, we consider Fountain encoders for the Gaussian channel and improve their performance by shaping the resulting left degree distributions away from Poisson. The proposed Fountain encoders achieve lower left degree variance at the same average degree. This in turn improves the growth of the so-called ripple in the BP decoding. The new encoders outperform the traditional ones in terms of overhead, error rate, and decoding complexity.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233273","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621616
Yong Jin Daniel Kim, J. Bajcsy
Recently, faster-than-Nyquist (FTN) signaling (or also sub-Nyquist filtering) has been proposed as a means to increase the spectral efficiency of the next generation long-haul optical fiber transmission systems. In the high spectral efficiency regime, however, the severe intersymbol interference (ISI) inherent to the FTN signaling poses a significant challenge in implementing a practical FTN system. In this work, we propose to use non-uniform power allocation at the optical FTN transmitter and establish its optimality in the achievable capacity. Consequently, we utilize the non-uniform power allocation to design a low-complexity FTN receiver that can operate close to the channel capacity limit. Presented simulation results also illustrate that the proposed optical FTN signaling transceiver with non-uniform power allocation allows supporting very high spectral efficiencies.
{"title":"Binary faster than Nyquist optical transmission via non-uniform power allocation","authors":"Yong Jin Daniel Kim, J. Bajcsy","doi":"10.1109/CWIT.2013.6621616","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621616","url":null,"abstract":"Recently, faster-than-Nyquist (FTN) signaling (or also sub-Nyquist filtering) has been proposed as a means to increase the spectral efficiency of the next generation long-haul optical fiber transmission systems. In the high spectral efficiency regime, however, the severe intersymbol interference (ISI) inherent to the FTN signaling poses a significant challenge in implementing a practical FTN system. In this work, we propose to use non-uniform power allocation at the optical FTN transmitter and establish its optimality in the achievable capacity. Consequently, we utilize the non-uniform power allocation to design a low-complexity FTN receiver that can operate close to the channel capacity limit. Presented simulation results also illustrate that the proposed optical FTN signaling transceiver with non-uniform power allocation allows supporting very high spectral efficiencies.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116890834","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621595
M. H. Taieb, J. Chouinard, Demin Wang
In most DVC architectures presented in the literature, the puncturing mechanism operates according to a periodic pattern that spreads uniformly the turbo generated parity bits and discards all the systematic bits. These latter are replaced by the receiver side information (SI) during the turbo decoding process. The side information is generated by a block based motion interpolation algorithm that can, furthermore, predict whether or not each block is well interpolated. Thus, instead of uniformly dispersing the parity bits over the whole turbo code trellis, they can be directed to the most corrupted regions. If the side information displays regions that appear to be even more highly corrupted, systematic bits can likewise be guided adaptively towards these regions. In this paper, an adaptive puncturing scheme is proposed. A classification of the corrupted parts of each DCT band of the interpolated frame is performed and then an adaptive puncturing mechanism is employed for a more efficient parity and systematic bits repartition. Simulation results show that the adaptive puncturing scheme can provide as much as 20 % of Wyner-Ziv bitrate reduction: this is reflected by a PSNR vs bit rate performance improvement of up to 1.8 dB.
{"title":"Turbo code using adaptive puncturing for transform domain Wyner-Ziv video coding","authors":"M. H. Taieb, J. Chouinard, Demin Wang","doi":"10.1109/CWIT.2013.6621595","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621595","url":null,"abstract":"In most DVC architectures presented in the literature, the puncturing mechanism operates according to a periodic pattern that spreads uniformly the turbo generated parity bits and discards all the systematic bits. These latter are replaced by the receiver side information (SI) during the turbo decoding process. The side information is generated by a block based motion interpolation algorithm that can, furthermore, predict whether or not each block is well interpolated. Thus, instead of uniformly dispersing the parity bits over the whole turbo code trellis, they can be directed to the most corrupted regions. If the side information displays regions that appear to be even more highly corrupted, systematic bits can likewise be guided adaptively towards these regions. In this paper, an adaptive puncturing scheme is proposed. A classification of the corrupted parts of each DCT band of the interpolated frame is performed and then an adaptive puncturing mechanism is employed for a more efficient parity and systematic bits repartition. Simulation results show that the adaptive puncturing scheme can provide as much as 20 % of Wyner-Ziv bitrate reduction: this is reflected by a PSNR vs bit rate performance improvement of up to 1.8 dB.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116954964","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 : 2013-06-18DOI: 10.1109/cwit.2013.6621587
Alain U. Toboso, S. Loyka, F. Gagnon
Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.
{"title":"On optimal detection ordering for coded V-BLAST","authors":"Alain U. Toboso, S. Loyka, F. Gagnon","doi":"10.1109/cwit.2013.6621587","DOIUrl":"https://doi.org/10.1109/cwit.2013.6621587","url":null,"abstract":"Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250578","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621613
Andrew Liau, Il Kim, S. Yousefi
Originally designed for point-to-point transmissions, fountain codes are capacity-achieving codes over a binary erasure channel. On the other hand, network coding is an optimal multihop data dissemination protocol whose high decoding complexity makes it too expensive for resource-constrained applications. Soliton-like rateless coding (SLRC) has previously combined network and fountain coding paradigms such that a less complex decoder can be applied. Specifically, the coding done at an intermediate relay node allows a belief propagation decoder to be efficiently applied. We extend the SLRC protocol and propose the Improved Soliton-like Rateless Coding (ISLRC) protocol. In ISLRC, the relay applies intelligent coding and shapes the degree distribution such that performance is better than SLRC. In addition, ISLRCs performance gains are achieved using fewer resources than SLRC while maintaining all the key properties of SLRC. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.
{"title":"An efficient Soliton-like network coding protocol for the resource-constrained Y-network","authors":"Andrew Liau, Il Kim, S. Yousefi","doi":"10.1109/CWIT.2013.6621613","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621613","url":null,"abstract":"Originally designed for point-to-point transmissions, fountain codes are capacity-achieving codes over a binary erasure channel. On the other hand, network coding is an optimal multihop data dissemination protocol whose high decoding complexity makes it too expensive for resource-constrained applications. Soliton-like rateless coding (SLRC) has previously combined network and fountain coding paradigms such that a less complex decoder can be applied. Specifically, the coding done at an intermediate relay node allows a belief propagation decoder to be efficiently applied. We extend the SLRC protocol and propose the Improved Soliton-like Rateless Coding (ISLRC) protocol. In ISLRC, the relay applies intelligent coding and shapes the degree distribution such that performance is better than SLRC. In addition, ISLRCs performance gains are achieved using fewer resources than SLRC while maintaining all the key properties of SLRC. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130299947","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621622
Jesse Haber-Kucharsky, E. Alian, P. Mitran
Orthogonal frequency division multiplexing (OFDM) is a popular modulation scheme used in a variety of applications. One significant problem associated with OFDM is the possibility of large side-lobes in its spectrum. In this paper, we consider the so-called N-continuous method for reducing the side-lobes. We first consider one implementation approach, whereby certain sub-carriers are reserved for the purpose of adjusting the spectrum of an OFDM symbol. We find that significant side-lobe reduction is possible, although at the cost of injecting very large power in the reserved sub-carriers that results in unacceptable spectrum overshoot. In order to achieve reasonable power levels, at least 20% of all sub-carriers must be reserved for weighting. As a solution to the problem of spectrum overshoot, we propose an alternative approach whereby the power of the reserved sub-carriers is constrained. Numerical results show that reasonable power levels are achieved at the cost of significant performance loss in the N-continuous OFDM technique for side-lobe reduction. We thus find that the performance cost of eliminating the spectrum overshoot reduces the side-lobes reduction to less than 5 dB in cases of interest.
{"title":"On the reserved sub-carrier approach to achieving N-continuity for side-lobe reduction in OFDM","authors":"Jesse Haber-Kucharsky, E. Alian, P. Mitran","doi":"10.1109/CWIT.2013.6621622","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621622","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is a popular modulation scheme used in a variety of applications. One significant problem associated with OFDM is the possibility of large side-lobes in its spectrum. In this paper, we consider the so-called N-continuous method for reducing the side-lobes. We first consider one implementation approach, whereby certain sub-carriers are reserved for the purpose of adjusting the spectrum of an OFDM symbol. We find that significant side-lobe reduction is possible, although at the cost of injecting very large power in the reserved sub-carriers that results in unacceptable spectrum overshoot. In order to achieve reasonable power levels, at least 20% of all sub-carriers must be reserved for weighting. As a solution to the problem of spectrum overshoot, we propose an alternative approach whereby the power of the reserved sub-carriers is constrained. Numerical results show that reasonable power levels are achieved at the cost of significant performance loss in the N-continuous OFDM technique for side-lobe reduction. We thus find that the performance cost of eliminating the spectrum overshoot reduces the side-lobes reduction to less than 5 dB in cases of interest.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126051090","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621621
Xiaoguang Yan, W. Gage, A. Eckford
In this paper, we propose Prior Optimized Time Warping (POTW) algorithm, which allows user to integrate prior knowledge by marking out pairs of matching sub-sequences from the sequences to be aligned. To relieve users of the task of guaranteeing the full accuracy of the marking, a certainty coefficient reflecting the certainty of the matching can also be specified for each marked pairs. POTW will then look for the best alignment based on the two sequences and the given matching pairs. POTW is an extension of existing align algorithm, and in the absence of prior knowledge, is able to independently find the best alignment of two sequences. We apply our algorithm to walk sequences from CMU motion capture database, as well as UJI pen characters dataset to demonstrate its ability to allow easy and effective integration of prior knowledge.
{"title":"Integrating prior knowledge in time series alignment: Prior Optimized Time Warping","authors":"Xiaoguang Yan, W. Gage, A. Eckford","doi":"10.1109/CWIT.2013.6621621","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621621","url":null,"abstract":"In this paper, we propose Prior Optimized Time Warping (POTW) algorithm, which allows user to integrate prior knowledge by marking out pairs of matching sub-sequences from the sequences to be aligned. To relieve users of the task of guaranteeing the full accuracy of the marking, a certainty coefficient reflecting the certainty of the matching can also be specified for each marked pairs. POTW will then look for the best alignment based on the two sequences and the given matching pairs. POTW is an extension of existing align algorithm, and in the absence of prior knowledge, is able to independently find the best alignment of two sequences. We apply our algorithm to walk sequences from CMU motion capture database, as well as UJI pen characters dataset to demonstrate its ability to allow easy and effective integration of prior knowledge.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115256197","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621590
Peng Hao, Xianbin Wang, A. Refaey
Recently physical layer attributes and statistics have been exploited in securing wireless communications. However, one major obstacle of physical layer security techniques is that not all of these attributes are accessible in practical wireless communication platforms. More precisely, once the hardware of a physical transceiver is implemented, most of the physical layer attributes are not accessible due to the highly integrated circuits. Consequently, it becomes essential to develop implementable security enhancement techniques by utilizing all available attributes and statistics at different layers of wireless communication networks. In this paper, we consider the packet error rate (PER) and the received signal strength indicator (RSSI) in IEEE 802.11 networks to improve the wireless communication security. These two unique user and environment dependent attributes are readily available in most of the currently deployed IEEE 802.11 platforms. To enhance the spoofing attack detection capability, we propose a practical authentication scheme by monitoring and analyzing the PER and RSSI at the same time. The hypothesis testing model for the proposed authentication using PER and RSSI as two testing variables is presented. In addition, a decision rule for authentication, which is able to differentiate between a legitimate transmitter and a potential attacker by combining both attributes together, is developed. To evaluate the feasibility of our proposed scheme, lab experiments have been conducted using an IEEE 802.11g Atheros platform. The proposed authentication technique is validated by the experimental and simulation data. Our final authentication results confirm the improved spoofing detecting capability of the proposed technique over the single-variable based authentication.
{"title":"An enhanced cross-layer authentication mechanism for wireless communications based on PER and RSSI","authors":"Peng Hao, Xianbin Wang, A. Refaey","doi":"10.1109/CWIT.2013.6621590","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621590","url":null,"abstract":"Recently physical layer attributes and statistics have been exploited in securing wireless communications. However, one major obstacle of physical layer security techniques is that not all of these attributes are accessible in practical wireless communication platforms. More precisely, once the hardware of a physical transceiver is implemented, most of the physical layer attributes are not accessible due to the highly integrated circuits. Consequently, it becomes essential to develop implementable security enhancement techniques by utilizing all available attributes and statistics at different layers of wireless communication networks. In this paper, we consider the packet error rate (PER) and the received signal strength indicator (RSSI) in IEEE 802.11 networks to improve the wireless communication security. These two unique user and environment dependent attributes are readily available in most of the currently deployed IEEE 802.11 platforms. To enhance the spoofing attack detection capability, we propose a practical authentication scheme by monitoring and analyzing the PER and RSSI at the same time. The hypothesis testing model for the proposed authentication using PER and RSSI as two testing variables is presented. In addition, a decision rule for authentication, which is able to differentiate between a legitimate transmitter and a potential attacker by combining both attributes together, is developed. To evaluate the feasibility of our proposed scheme, lab experiments have been conducted using an IEEE 802.11g Atheros platform. The proposed authentication technique is validated by the experimental and simulation data. Our final authentication results confirm the improved spoofing detecting capability of the proposed technique over the single-variable based authentication.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131115290","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621603
Yuhan Zhou, Wei Yu
This paper studies single-user compression for the uplink multi-cell processing (MCP) model where multiple base-stations are connected to a central processor via noiseless backhaul links with a sum capacity constraint. The proposed scheme is based on the virtual multiple-access channel (V-MAC) architecture, where the base-stations quantize the received signals and send the quantized bits to the central processor, and at the decoder side the central processor first recovers the quantized signals then decodes the user messages in a successive manner. This paper focuses on the use of single-user compression in the V-MAC architecture, which is significantly simpler to implement than Wyner-Ziv compression. The main result of this paper is that single-user compression can achieve the sum capacity of the MCP model to within a constant gap under two specific scenarios. First, we define a diagonally dominant channel criterion and show the constant-gap result for the case when the covariance matrix of the received signals across the base-stations is κ-strictly diagonally dominant for some constant κ > 1. Second, we show that the constant-gap result holds for a special class of Wyner channel models in the weak interference regime.
本文研究了上行多单元处理(MCP)模型的单用户压缩，其中多个基站通过具有和容量约束的无噪声回程链路连接到中央处理器。该方案基于虚拟多址信道(virtual multi -access channel, V-MAC)架构，基站对接收到的信号进行量化，并将量化后的比特发送给中央处理器，在解码器端，中央处理器首先对量化后的信号进行恢复，然后对用户报文进行逐次解码。本文关注的是单用户压缩在V-MAC架构中的使用，它比Wyner-Ziv压缩更容易实现。本文的主要结果是，在两种特定场景下，单用户压缩可以实现MCP模型的容量总和在一个恒定的间隙内。首先，我们定义了一个对角占优的信道准则，并给出了在某些常数κ > 1的情况下，跨基站接收信号的协方差矩阵是κ-严格对角占优的情况下的常间隙结果。其次，我们证明了在弱干扰条件下一类特殊的Wyner信道模型的常隙结果是成立的。
{"title":"Approximate bounds for limited backhaul uplink multicell processing with single-user compression","authors":"Yuhan Zhou, Wei Yu","doi":"10.1109/CWIT.2013.6621603","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621603","url":null,"abstract":"This paper studies single-user compression for the uplink multi-cell processing (MCP) model where multiple base-stations are connected to a central processor via noiseless backhaul links with a sum capacity constraint. The proposed scheme is based on the virtual multiple-access channel (V-MAC) architecture, where the base-stations quantize the received signals and send the quantized bits to the central processor, and at the decoder side the central processor first recovers the quantized signals then decodes the user messages in a successive manner. This paper focuses on the use of single-user compression in the V-MAC architecture, which is significantly simpler to implement than Wyner-Ziv compression. The main result of this paper is that single-user compression can achieve the sum capacity of the MCP model to within a constant gap under two specific scenarios. First, we define a diagonally dominant channel criterion and show the constant-gap result for the case when the covariance matrix of the received signals across the base-stations is κ-strictly diagonally dominant for some constant κ > 1. Second, we show that the constant-gap result holds for a special class of Wyner channel models in the weak interference regime.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134361712","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
扫码关注我们
求助内容：
应助结果提醒方式：