Pub Date : 2017-10-01DOI: 10.1109/SiPS.2017.8110010
Yonghong Bai, Zhiyuan Yan
Since physical unclonable functions (PUFs) are considered for various security applications such as authentication and key generation, the robustness of PUFs is vital. In prior works, various error correction codes, such as Bose-Chaudhuri-Hocquenghem (BCH) codes, were used to improve the robustness of PUFs. In this paper, we use polar codes, a new family of error correction codes, to improve the robustness of PUFs. Our results show that when compared with BCH codes, although polar codes have smaller minimum Hamming distances, they are more resistant to severe environmental effects.
{"title":"Physical unclonable functions with improved robustness based on polar codes","authors":"Yonghong Bai, Zhiyuan Yan","doi":"10.1109/SiPS.2017.8110010","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8110010","url":null,"abstract":"Since physical unclonable functions (PUFs) are considered for various security applications such as authentication and key generation, the robustness of PUFs is vital. In prior works, various error correction codes, such as Bose-Chaudhuri-Hocquenghem (BCH) codes, were used to improve the robustness of PUFs. In this paper, we use polar codes, a new family of error correction codes, to improve the robustness of PUFs. Our results show that when compared with BCH codes, although polar codes have smaller minimum Hamming distances, they are more resistant to severe environmental effects.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130157694","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8110018
A. Ivanov, D. Lakontsev
Orthogonal Frequency Division Multiplexing (OFDM) is a technique, which is widely used in 4G and considered in 5G wireless communication system these days. It is a form of multi-carrier modulation technique. One major disadvantage of OFDM is that the time domain OFDM signal leads to a high peak-to-average power ratio (PAPR). In this paper we propose a new selective tone reservation (STR) algorithm for reducing the PAPR in downlink channel of base station. We simulate the STR for different application scenarios with consideration of 4G/5G requirements. Simulation results show the STR has a PAPR reduction performance much better compared with all traditional methods in that it doesn't require any side information and has no effect on the performance of high order modulation users. Proposed method is fast and has an ultra-low latency compared with well-known iterative methods of tone reservation and constellation extension. Its performance is higher compared with a common clipping and filtering due to employing a constellation recognition technique for blind detection of the modulation order. STR fully fits in 4G/5G standard requirements and its complexity doesn't require a huge computational resources.
{"title":"Selective tone reservation for PAPR reduction in wireless communication systems","authors":"A. Ivanov, D. Lakontsev","doi":"10.1109/SiPS.2017.8110018","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8110018","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is a technique, which is widely used in 4G and considered in 5G wireless communication system these days. It is a form of multi-carrier modulation technique. One major disadvantage of OFDM is that the time domain OFDM signal leads to a high peak-to-average power ratio (PAPR). In this paper we propose a new selective tone reservation (STR) algorithm for reducing the PAPR in downlink channel of base station. We simulate the STR for different application scenarios with consideration of 4G/5G requirements. Simulation results show the STR has a PAPR reduction performance much better compared with all traditional methods in that it doesn't require any side information and has no effect on the performance of high order modulation users. Proposed method is fast and has an ultra-low latency compared with well-known iterative methods of tone reservation and constellation extension. Its performance is higher compared with a common clipping and filtering due to employing a constellation recognition technique for blind detection of the modulation order. STR fully fits in 4G/5G standard requirements and its complexity doesn't require a huge computational resources.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125243100","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8109981
Reza Ghanaatian, A. Burg
Low-density parity check (LDPC) codes are a mature coding scheme in telecommunications and the low power implementation of corresponding decoders is an issue of significant importance for receivers with stringent power budgets. This paper presents a power reduction technique for LDPC decoders that further extends their energy-proportional behavior, obtained with early-termination (ET), by predicting the required number of iterations and by applying dynamic voltage and frequency scaling (DVFS). The number of expected iterations and the associated voltage/frequency settings are predicted with a novel algorithm that is based on the offline statistical analysis of the number of decoding iterations. This algorithm systematically trades the error-correcting performance up to a predefined approximation level for the achieved amount of power reduction beyond ET. Simulation and postlayout implementation results in a 28 nm FD-SOI technology prove that the proposed algorithm, when integrated with an LDPC decoder, can significantly reduce the power consumption with negligible overhead.
{"title":"DVFS based power management for LDPC decoders with early termination","authors":"Reza Ghanaatian, A. Burg","doi":"10.1109/SiPS.2017.8109981","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8109981","url":null,"abstract":"Low-density parity check (LDPC) codes are a mature coding scheme in telecommunications and the low power implementation of corresponding decoders is an issue of significant importance for receivers with stringent power budgets. This paper presents a power reduction technique for LDPC decoders that further extends their energy-proportional behavior, obtained with early-termination (ET), by predicting the required number of iterations and by applying dynamic voltage and frequency scaling (DVFS). The number of expected iterations and the associated voltage/frequency settings are predicted with a novel algorithm that is based on the offline statistical analysis of the number of decoding iterations. This algorithm systematically trades the error-correcting performance up to a predefined approximation level for the achieved amount of power reduction beyond ET. Simulation and postlayout implementation results in a 28 nm FD-SOI technology prove that the proposed algorithm, when integrated with an LDPC decoder, can significantly reduce the power consumption with negligible overhead.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130641492","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8110019
T. Richter, Nils Genser, Jürgen Seiler, André Kaup, Christopher Saloman, Koray Kasnakli, A. Nowak, M. Schöberl
Multi-channel imaging like RGB is common today, however, a custom configuration of other modalities, such as wavelengths or polarization, is expensive and often unavailable. We propose a novel configurable multi-modal imaging system that solves this problem by using off-the-shelf components and proper fusion algorithms. The paper shows the application of polarization imaging for machine vision inspection. Sequential images acquired with different cameras and polarization angles are first registered and then fused together. With standard components, we demonstrate a superior image quality to existing specialized cameras while being significantly cheaper, available, and easily configurable.
{"title":"Sequential polarization imaging using multi-view fusion","authors":"T. Richter, Nils Genser, Jürgen Seiler, André Kaup, Christopher Saloman, Koray Kasnakli, A. Nowak, M. Schöberl","doi":"10.1109/SiPS.2017.8110019","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8110019","url":null,"abstract":"Multi-channel imaging like RGB is common today, however, a custom configuration of other modalities, such as wavelengths or polarization, is expensive and often unavailable. We propose a novel configurable multi-modal imaging system that solves this problem by using off-the-shelf components and proper fusion algorithms. The paper shows the application of polarization imaging for machine vision inspection. Sequential images acquired with different cameras and polarization angles are first registered and then fused together. With standard components, we demonstrate a superior image quality to existing specialized cameras while being significantly cheaper, available, and easily configurable.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131531358","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8110013
Said Medjkouh, Jérémy Nadal, C. A. Nour, A. Baghdadi
Universal Filtered Orthogonal Frequency Division Multiplexing (UF-OFDM) is considered one of the main wave-form candidates to overcome the challenges facing the next generation of mobile communication systems. Due to its spectral properties it can support relaxed synchronization, low-latency communications and flexible time transmission interval. Nevertheless, the available recent literature addresses the potential of this waveform mainly from communication performance perspective, and sometimes presents a rough estimation of the complexity. Therefore, it becomes high of interest to seek efficient hardware implementations. In this paper, a reduced complexity pipelined architecture is proposed for UF-OFDM frequency domain transmitter. Using LTE parameters, the proposed UF-OFDM FDA architecture uses around 3.6 times less hardware ressources than the straightforward implementation.
{"title":"Reduced complexity FPGA implementation for UF-OFDM frequency domain transmitter","authors":"Said Medjkouh, Jérémy Nadal, C. A. Nour, A. Baghdadi","doi":"10.1109/SiPS.2017.8110013","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8110013","url":null,"abstract":"Universal Filtered Orthogonal Frequency Division Multiplexing (UF-OFDM) is considered one of the main wave-form candidates to overcome the challenges facing the next generation of mobile communication systems. Due to its spectral properties it can support relaxed synchronization, low-latency communications and flexible time transmission interval. Nevertheless, the available recent literature addresses the potential of this waveform mainly from communication performance perspective, and sometimes presents a rough estimation of the complexity. Therefore, it becomes high of interest to seek efficient hardware implementations. In this paper, a reduced complexity pipelined architecture is proposed for UF-OFDM frequency domain transmitter. Using LTE parameters, the proposed UF-OFDM FDA architecture uses around 3.6 times less hardware ressources than the straightforward implementation.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133492743","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8109998
Liang He, Xianhong Chen, Can Xu, Tianyu Liang, Jia Liu
This paper proposes a hybrid speaker diarization system. The main body is a variational Bayes — hidden Markov model (VB-HMM) speaker diarization system. The VB-HMM speaker diarization system avoids making premature hard decision and takes advantages of soft speaker information in an iterative way. Thus, it outperforms most of mainstream speaker diarization systems. Unfortunately, this system is sensitive to its prior in some cases. Either a uniform prior or a flat Dirichlet prior may fail and lead to poor results, thus a more robust and informative prior is desired. Another speaker diarization branch is an i-vector — probabilistic linear discriminant analysis — agglomerative hierarchical clustering (Ivec-PLDA-AHC) system. Benefits from the excellent performance of the Ivec-PLDA system in the speaker recognition field, the Ivec-PLDA-AHC speaker diarization system is believed to be more powerful to cluster segmental i-vectors according to their speakers. Inspired by this feature, we take the output of the Ivec-PLDA-AHC as the VB-HMM's prior. Experiments on our collected database show that the proposed system is significantly better than both of the mentioned systems.
本文提出了一种混合式说话人日记系统。其主体是变异贝叶斯-隐马尔可夫模型（VB-HMM）扬声器日差化系统。VB-HMM 说话人日记系统避免了过早做出硬性决定，并以迭代方式利用了说话人的软信息。因此，它的性能优于大多数主流的说话人日记系统。遗憾的是，该系统在某些情况下对先验很敏感。无论是均匀先验还是平面 Dirichlet 先验都可能失效，导致效果不佳，因此需要一个更稳健、信息量更大的先验。另一个扬声器分词分支是 i 向量-概率线性判别分析-聚类分层聚类（Ivec-PLDA-AHC）系统。得益于 Ivec-PLDA 系统在扬声器识别领域的出色表现，Ivec-PLDA-AHC 扬声器分层系统被认为在根据扬声器对分段 i 向量进行聚类方面功能更为强大。受此启发，我们将 Ivec-PLDA-AHC 的输出作为 VB-HMM 的先验。在我们收集的数据库上进行的实验表明，所提出的系统明显优于上述两种系统。
{"title":"Ivec-PLDA-AHC priors for VB-HMM speaker diarization system","authors":"Liang He, Xianhong Chen, Can Xu, Tianyu Liang, Jia Liu","doi":"10.1109/SiPS.2017.8109998","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8109998","url":null,"abstract":"This paper proposes a hybrid speaker diarization system. The main body is a variational Bayes — hidden Markov model (VB-HMM) speaker diarization system. The VB-HMM speaker diarization system avoids making premature hard decision and takes advantages of soft speaker information in an iterative way. Thus, it outperforms most of mainstream speaker diarization systems. Unfortunately, this system is sensitive to its prior in some cases. Either a uniform prior or a flat Dirichlet prior may fail and lead to poor results, thus a more robust and informative prior is desired. Another speaker diarization branch is an i-vector — probabilistic linear discriminant analysis — agglomerative hierarchical clustering (Ivec-PLDA-AHC) system. Benefits from the excellent performance of the Ivec-PLDA system in the speaker recognition field, the Ivec-PLDA-AHC speaker diarization system is believed to be more powerful to cluster segmental i-vectors according to their speakers. Inspired by this feature, we take the output of the Ivec-PLDA-AHC as the VB-HMM's prior. Experiments on our collected database show that the proposed system is significantly better than both of the mentioned systems.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127724334","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8109988
Zhizhen Wu, Lulu Ge, X. You, Chuan Zhang
In this paper, an improved and low-complexity signal detection approach for large-scale multiple-input multiple-output (MIMO) systems has been proposed. This approach utilizes the preconditioning technique to accelerate the conventional detection algorithm based on Gauss-Seidel (GS) iterative method, and achieves a detection performance close to the minimum mean square error (MMSE) detection algorithm with relatively small iteration counts. It also outperforms the counterparts based on the Neumann series (NS) expansion and the conjugate gradient (CG) method in poor propagation environments, such as MIMO systems with large loading or correlated factors. The corresponding architecture is also proposed with both novelty and scalability. It takes advantage of the cyclic-shift property of the GS method, and therefore facilitates the hardware implementation. Both numerical results and complexity analysis demonstrate that the proposed detector is efficient and suitable for large-scale MIMO systems.
{"title":"Efficient near-MMSE detector for large-scale MIMO systems","authors":"Zhizhen Wu, Lulu Ge, X. You, Chuan Zhang","doi":"10.1109/SiPS.2017.8109988","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8109988","url":null,"abstract":"In this paper, an improved and low-complexity signal detection approach for large-scale multiple-input multiple-output (MIMO) systems has been proposed. This approach utilizes the preconditioning technique to accelerate the conventional detection algorithm based on Gauss-Seidel (GS) iterative method, and achieves a detection performance close to the minimum mean square error (MMSE) detection algorithm with relatively small iteration counts. It also outperforms the counterparts based on the Neumann series (NS) expansion and the conjugate gradient (CG) method in poor propagation environments, such as MIMO systems with large loading or correlated factors. The corresponding architecture is also proposed with both novelty and scalability. It takes advantage of the cyclic-shift property of the GS method, and therefore facilitates the hardware implementation. Both numerical results and complexity analysis demonstrate that the proposed detector is efficient and suitable for large-scale MIMO systems.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121441499","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8110024
Jose Marques, J. Andrade, G. Falcão
The evolution of convolutional neural networks (CNNs) into more complex forms of organization, with additional layers, larger convolutions and increasing connections, established the state-of-the-art in terms of accuracy errors for detection and classification challenges in images. Moreover, as they evolved to a point where Gigabytes of memory are required for their operation, we have reached a stage where it becomes fundamental to understand how their inference capabilities can be impaired if data elements somehow become corrupted in memory. This paper introduces fault-injection in these systems by simulating failing bit-cells in hardware memories brought on by relaxing the 100% reliable operation assumption. We analyze the behavior of these networks calculating inference under severe fault-injection rates and apply fault mitigation strategies to improve on the CNNs resilience. For the MNIST dataset, we show that 8x less memory is required for the feature maps memory space, and that in sub-100% reliable operation, fault-injection rates up to 10−1 (with most significant bit protection) can withstand only a 1% error probability degradation. Furthermore, considering the offload of the feature maps memory to an embedded dynamic RAM (eDRAM) system, using technology nodes from 65 down to 28 nm, up to 73∼80% improved power efficiency can be obtained.
{"title":"Unreliable memory operation on a convolutional neural network processor","authors":"Jose Marques, J. Andrade, G. Falcão","doi":"10.1109/SiPS.2017.8110024","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8110024","url":null,"abstract":"The evolution of convolutional neural networks (CNNs) into more complex forms of organization, with additional layers, larger convolutions and increasing connections, established the state-of-the-art in terms of accuracy errors for detection and classification challenges in images. Moreover, as they evolved to a point where Gigabytes of memory are required for their operation, we have reached a stage where it becomes fundamental to understand how their inference capabilities can be impaired if data elements somehow become corrupted in memory. This paper introduces fault-injection in these systems by simulating failing bit-cells in hardware memories brought on by relaxing the 100% reliable operation assumption. We analyze the behavior of these networks calculating inference under severe fault-injection rates and apply fault mitigation strategies to improve on the CNNs resilience. For the MNIST dataset, we show that 8x less memory is required for the feature maps memory space, and that in sub-100% reliable operation, fault-injection rates up to 10−1 (with most significant bit protection) can withstand only a 1% error probability degradation. Furthermore, considering the offload of the feature maps memory to an embedded dynamic RAM (eDRAM) system, using technology nodes from 65 down to 28 nm, up to 73∼80% improved power efficiency can be obtained.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125711852","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8109972
Jiejun Jin, Ye Xue, Yeong-Luh Ueng, X. You, Chuan Zhang
In massive multiple-input multiple-output (MIMO) mobile system, the computational complexity of signal detection increases exponentially along with the growing number of antennas. For example, the sub-optimal linear detection schemes, such as zero forcing (ZF) detector and minimum mean square error (MMSE) detector, always have to balance the performance and complexity resulted from the large-scale matrix inversion operations. Recently, some iterative linear solvers, such as conjugate gradient (CG), have been proposed to address this issue. These series of detection algorithms offer a better tradeoff between error-rate performance and computational complexity by avoiding the computation-hungry operations like matrix inversion. However, when the the system loading factor ρ goes up, their results are no longer satisfactory. To solve the aforementioned issues, this paper 1) first introduces a novel, low-complexity pre-conditioner by exploring the properties of the equalization matrix and 2) then proposes a split pre-conditioned conjugate gradient (SPCG) method to speed up the convergence rate of detection. Both analytical and numerical results have demonstrated the performance and complexity advantages of the proposed algorithm over the sate-of-the-art ones. The proposed detector outperforms the conventional CG detector with around 2 dB for BER = 10−4. When the number of user antennas is relatively large, its complexity is only 25% of the existing pre-conditioned conjugate gradient detector based on incomplete Cholesky decomposition (ICCG).
{"title":"A split pre-conditioned conjugate gradient method for massive MIMO detection","authors":"Jiejun Jin, Ye Xue, Yeong-Luh Ueng, X. You, Chuan Zhang","doi":"10.1109/SiPS.2017.8109972","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8109972","url":null,"abstract":"In massive multiple-input multiple-output (MIMO) mobile system, the computational complexity of signal detection increases exponentially along with the growing number of antennas. For example, the sub-optimal linear detection schemes, such as zero forcing (ZF) detector and minimum mean square error (MMSE) detector, always have to balance the performance and complexity resulted from the large-scale matrix inversion operations. Recently, some iterative linear solvers, such as conjugate gradient (CG), have been proposed to address this issue. These series of detection algorithms offer a better tradeoff between error-rate performance and computational complexity by avoiding the computation-hungry operations like matrix inversion. However, when the the system loading factor ρ goes up, their results are no longer satisfactory. To solve the aforementioned issues, this paper 1) first introduces a novel, low-complexity pre-conditioner by exploring the properties of the equalization matrix and 2) then proposes a split pre-conditioned conjugate gradient (SPCG) method to speed up the convergence rate of detection. Both analytical and numerical results have demonstrated the performance and complexity advantages of the proposed algorithm over the sate-of-the-art ones. The proposed detector outperforms the conventional CG detector with around 2 dB for BER = 10−4. When the number of user antennas is relatively large, its complexity is only 25% of the existing pre-conditioned conjugate gradient detector based on incomplete Cholesky decomposition (ICCG).","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131949495","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 : 2017-10-01DOI: 10.1109/SiPS.2017.8109983
M. Waheed, D. Korpi, A. Kiayani, L. Anttila, M. Valkama
In this paper we study and analyze the problem of self-interference in transceivers performing inter-band carrier aggregation, where separate power amplifiers (PAs) are used for each component carrier (CC). The self-interference stems from the nonlinear behaviour of the passive RF components at the transmitter, which results in passive intermodulation terms that in some cases fall onto the RX band. Moreover, also the individual PAs distort the CCs in a nonlinear fashion, which means that the self-interference is in fact produced by a cascade of two nonlinearities. This is something that has largely been ignored in earlier literature. Hence, in this work, a signal model is derived that considers both the nonlinearity of the PAs and the passive components, resulting in a highly efficient digital cancellation solution. Using realistic waveform simulations, it is shown to outperform the existing digital cancellers that neglect the PA-induced nonlinear distortion. Also the computational complexity of the proposed digital canceller is analyzed in detail. All in all, the findings indicate that the developed digital cancellation solution is a feasible option for improving the receiver sensitivity of mobile devices utilizing inter-band carrier aggregation.
{"title":"Digital self-interference cancellation in inter-band carrier aggregation transceivers: Algorithm and digital implementation perspectives","authors":"M. Waheed, D. Korpi, A. Kiayani, L. Anttila, M. Valkama","doi":"10.1109/SiPS.2017.8109983","DOIUrl":"https://doi.org/10.1109/SiPS.2017.8109983","url":null,"abstract":"In this paper we study and analyze the problem of self-interference in transceivers performing inter-band carrier aggregation, where separate power amplifiers (PAs) are used for each component carrier (CC). The self-interference stems from the nonlinear behaviour of the passive RF components at the transmitter, which results in passive intermodulation terms that in some cases fall onto the RX band. Moreover, also the individual PAs distort the CCs in a nonlinear fashion, which means that the self-interference is in fact produced by a cascade of two nonlinearities. This is something that has largely been ignored in earlier literature. Hence, in this work, a signal model is derived that considers both the nonlinearity of the PAs and the passive components, resulting in a highly efficient digital cancellation solution. Using realistic waveform simulations, it is shown to outperform the existing digital cancellers that neglect the PA-induced nonlinear distortion. Also the computational complexity of the proposed digital canceller is analyzed in detail. All in all, the findings indicate that the developed digital cancellation solution is a feasible option for improving the receiver sensitivity of mobile devices utilizing inter-band carrier aggregation.","PeriodicalId":251688,"journal":{"name":"2017 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772460","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
扫码关注我们
求助内容：
应助结果提醒方式：