2018 52nd Asilomar Conference on Signals, Systems, and Computers
Multi-kernel polar codes have recently been proposed to construct polar codes of lengths differen... more Multi-kernel polar codes have recently been proposed to construct polar codes of lengths different from powers of two. Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory management. We propose an efficient, generalized memory management framework for implementation of successivecancellation decoding of multi-kernel polar codes. It can be used on many types of hardware architectures and different flavors of SC decoding algorithms. We illustrate the proposed solution for small kernel sizes, and give complexity estimates for various kernel combinations and code lengths.
In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of... more In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of designing codes tailored for automorphism ensemble (AE) decoding. We prove the equivalence between the notion of decreasing monomial codes and the universal partial order (UPO) framework for the description of polar codes. Then, we analyze the algebraic properties of the affine automorphisms group of polar codes, providing a novel description of its structure and proposing a classification of automorphisms providing the same results under permutation decoding. Finally, we propose a method to list all the automorphisms that may lead to different candidates under AE decoding; by introducing the concept of redundant automorphisms, we find the maximum number of permutations providing possibly different codeword candidates under AE-SC, proposing a method to list all of them. A numerical analysis of the error correction performance of AE algorithm for the decoding of polar codes concludes the paper.
2019 IEEE Wireless Communications and Networking Conference (WCNC), 2019
Product codes are widespread in optical communications, thanks to their high throughput and good ... more Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we present a novel construction for product polar codes based on non-systematic polar codes. We prove that the resulting product code is actually a polar code, having a frozen set that is dependent on the frozen sets of the component polar codes. We propose a low-complexity decoding algorithm exploiting the dual nature of the constructed code. Performance analysis and simulations show high decoding speed, that allows to construct long codes while maintaining low decoding latency. The resulting high throughput and good error-correction performance are appealing for optical communication systems and other systems where high throughput and low latency are required.
2021 IEEE International Symposium on Information Theory (ISIT), 2021
We propose a novel coupling technique for the design of polar codes of length N , making them dec... more We propose a novel coupling technique for the design of polar codes of length N , making them decodable through a sliding window of size M ă N. This feature allows to reduce the computational complexity of the decoder, an important possibility in wireless communication downlink scenarios. Our approach is based on the design of an ad-hoc kernel to be inserted in a multi-kernel polar code framework; this structure enables the sliding window decoding of the code. Simulation results show that the proposed sliding window polar codes outperform the independent blocks transmission in the proposed scenario, at the cost of a negligible decoding overhead.
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
Blind quality estimation for corrupted source signals based on a-posteriori probabilities. In Pro... more Blind quality estimation for corrupted source signals based on a-posteriori probabilities. In Proc. IEEE Int. Symp. Inform. Theory (ISIT) (pp. 304) General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. ? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us at [email protected] providing details, and we will remove access to the work immediately and investigate your claim.
In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, ... more In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, proving that this construction actually polarizes. To this end, we derive a new and more general proof of polarization, which gives sufficient conditions for kernels to polarize. Finally, we derive the convergence rate of the multi-kernel construction and relate it to the convergence rate of each of the constituent kernels.
This paper addresses extrinsic information chart based design of non-systematic irregular repeat-... more This paper addresses extrinsic information chart based design of non-systematic irregular repeat-accumulate codes for a given number of decoding iterations. This criterion is of practical importance in many applications where complexity or latency is limited. Our main contribution is a novel formulation of the optimzation problem in a particular way that makes its actual evaluation possible. This is achieved by introducing additional optimization variables and constraints which have the effect of “unrolling” the iteration. Our approach enforces the finite iteration condition, while avoiding the need to know arbitrary repeated functional compositions of the component EXIT functions. We restrict attention to the binary erasure channel, for which the EXIT chart approach is exact. Extension to other sparse-graph codes and other communication channels is straightforward.
2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2021
Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for mas... more Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for massive uplink communication. In this modulation, transmitters encode data as rank-1 tensors, with factors from a discrete vector constellation. This construction allows to split the multiuser receiver into a user separation step based on a low-rank tensor decomposition, and independent single-user demappers. In this paper, we analyze the limits of the tensor decomposition using Cramér-Rao bounds, providing bounds on the accuracy of the estimated factors. These bounds are shown by simulation to be tight at high SNR. We introduce an approximate perturbation model for the output of the tensor decomposition, which facilitates the computation of the log-likelihood ratios (LLR) of the transmitted bits, and provides an approximate achievable bound for the finite-length error probability. Combining TBM with classical forward error correction coding schemes such as polar codes, we use the approximate LLR to derive soft-decision decoders showing a gain over hard-decision decoders at low SNR.
2018 IEEE Global Communications Conference (GLOBECOM), 2018
Research on polar codes has been constantly gaining attention over the last decade, by academia a... more Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have been selected as one of the coding schemes in the 5 th generation wireless standard (5G). Over the years various polar code decoding algorithms, like SC-list (SCL), have been proposed to improve the mediocre performance of the successive cancellation (SC) decoding algorithm for finite code lengths; however, like SC, they suffer from long decoding latency. Fast decoding of polar codes tries to overcome this problem by identifying particular subcodes in the polar code and decoding them with efficient decoders. In this work, we introduce a generalized approach to fast decoding of polar codes to further reduce SC-based decoding latency. We propose three multi-node polar code subcodes whose identification patterns include most of the existing subcodes, extending them to SCL decoding, and allow to apply fast decoding to larger subsets of bits. Without any error-correction performance degradation, the proposed technique shows up to 23.6% and 29.2% decoding latency gain with respect to fast SC and SCL decoding algorithms, respectively, and up to 63.6% and 49.8% if a performance loss is accepted, whose amount depends on code and decoding algorithm parameters, along with the desired speedup.
2017 IEEE International Conference on Communications Workshops (ICC Workshops), 2017
We propose a generalized construction for binary polar codes based on mixing multiple kernels of ... more We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms stateof-the-art constructions using puncturing methods.
In this paper, we propose a new polar code construction by employing kernels of different sizes i... more In this paper, we propose a new polar code construction by employing kernels of different sizes in the Kronecker product of the transformation matrix, thus generalizing the original construction by Arikan. The proposed multi-kernel polar code allows for more flexibility in terms of the code length, moreover allowing for various new design principles. We describe in detail encoding as well as successive cancellation (SC) decoding and SC list (SCL) decoding, and we provide a novel design method for the frozen set that allows to optimise the performance under list decoding, as opposed to original relability-based code design. Finally, we numerically demonstrate the advantage of multi-kernel polar codes under the new design principles compared to punctured and shortened polar codes.
We introduce a modulation for unsourced massive random access whereby the transmitted symbols are... more We introduce a modulation for unsourced massive random access whereby the transmitted symbols are rank-1 tensors constructed from Grassmannian sub-constellations. The use of a low-rank tensor structure, together with tensor decomposition in order to separate the users at the receiver, allows a convenient uncoupling between multiuser separation and single-user demapping. The proposed signaling scheme is designed for the block fading channel and multiple-antenna settings, and is shown to perform well in comparison to stateof-the-art unsourced approaches.
GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017
In this paper, we propose a construction for multikernel polar codes based on the maximization of... more In this paper, we propose a construction for multikernel polar codes based on the maximization of the minimum distance. Compared to the original construction based on density evolution, our new design shows particular advantages for short code lengths, where the polarization effect has less impact on the performance than the distances of the code. We introduce and compute the minimum-distance profile and provide a simple greedy algorithm for the code design. Compared to state-of-theart punctured or shortened Arikan polar codes, multi-kernel polar codes with our new design show significantly improved error-rate performance.
Optical Fiber Communication Conference (OFC) 2019, 2019
We propose a very low-complexity and high-performance algorithm for soft-demapping of multi-dimen... more We propose a very low-complexity and high-performance algorithm for soft-demapping of multi-dimensional modulation formats. We assess its performance over the linear channel for four 8D formats, generated using binary arithmetics. This solution outperforms current algorithms in terms of complexity without loss in performances.
In this paper, we study the connection between polar codes and product codes. Our analysis shows ... more In this paper, we study the connection between polar codes and product codes. Our analysis shows that the product of two polar codes is again a polar code, and we provide guidelines to compute its frozen set on the basis of the frozen sets of the component polar codes. Moreover, we show how polar codes can be described as irregular product codes. We propose a two-step decoder for long polar codes taking advantage of this dual nature to heavily reduce decoding latency. Finally, we show that the proposed decoding technique outperforms both standard polar codes and state-of-the-art codes for optical communications under latency constraints.
We analyze and optimize the secrecy performance of artificial noise (AN) in multi-input single-ou... more We analyze and optimize the secrecy performance of artificial noise (AN) in multi-input single-output wiretap channels with multiple antennas at the transmitter and a single antenna at the receiver and the eavesdropper. We consider two transmission schemes: 1) an on-off transmission scheme with a constant secrecy rate for all transmission periods, and 2) an adaptive transmission scheme with a varying secrecy rate during each transmission period. For the on-off transmission scheme, an easy-to-compute expression is derived for the hybrid outage probability, which allows us to evaluate the transmission outage probability and the secrecy outage probability. For the adaptive transmission scheme where transmission outage does not occur, we derive a closedform expression for the secrecy outage probability. Using these expressions, we determine the optimal power allocation between the information signal and the AN signal and also determine the optimal secrecy rate such that the effective secrecy throughput is maximized for both transmission schemes. We show that the maximum effective secrecy throughput requires more power to be allocated to the AN signal when the quality of the transmitterreceiver channel or the transmitter-eavesdropper channel improves. We also show that both transmission schemes achieve a higher maximum effective secrecy throughput while incurring a lower secrecy outage probability than existing schemes.
2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, 2007
This paper presents a novel iterative receiver for mobile handsets using multiple antennas in the... more This paper presents a novel iterative receiver for mobile handsets using multiple antennas in the GSM/EDGE system. The receiver is derived based on the space alternatinggeneralized expectation-maximization (SAGE) method. It performs joint channel estimation, spatial diversity combining and successive co-channel interference (CCI) cancellation. The channel impulse response of all users are jointly estimated, while the users' transmitted symbols are detected successively. The receiver has a tractable complexity that increases linearly with the number of interferers. Two practically relevant applications are investigated by means of Monte Carlo simulations: single antenna interference cancellation (SAIC) in the GSM system and dual antenna interference cancellation (DAIC) in the EDGE system. Simulations using the TU3 channel model show that the new proposed scheme achieves a significant performance gain compared to the conventional receiver at low signal-tointerference ratios (SIRs).
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2000
General rights Copyright and moral rights for the publications made accessible in the public port... more General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. ? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ?
2018 52nd Asilomar Conference on Signals, Systems, and Computers
Multi-kernel polar codes have recently been proposed to construct polar codes of lengths differen... more Multi-kernel polar codes have recently been proposed to construct polar codes of lengths different from powers of two. Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory management. We propose an efficient, generalized memory management framework for implementation of successivecancellation decoding of multi-kernel polar codes. It can be used on many types of hardware architectures and different flavors of SC decoding algorithms. We illustrate the proposed solution for small kernel sizes, and give complexity estimates for various kernel combinations and code lengths.
In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of... more In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of designing codes tailored for automorphism ensemble (AE) decoding. We prove the equivalence between the notion of decreasing monomial codes and the universal partial order (UPO) framework for the description of polar codes. Then, we analyze the algebraic properties of the affine automorphisms group of polar codes, providing a novel description of its structure and proposing a classification of automorphisms providing the same results under permutation decoding. Finally, we propose a method to list all the automorphisms that may lead to different candidates under AE decoding; by introducing the concept of redundant automorphisms, we find the maximum number of permutations providing possibly different codeword candidates under AE-SC, proposing a method to list all of them. A numerical analysis of the error correction performance of AE algorithm for the decoding of polar codes concludes the paper.
2019 IEEE Wireless Communications and Networking Conference (WCNC), 2019
Product codes are widespread in optical communications, thanks to their high throughput and good ... more Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we present a novel construction for product polar codes based on non-systematic polar codes. We prove that the resulting product code is actually a polar code, having a frozen set that is dependent on the frozen sets of the component polar codes. We propose a low-complexity decoding algorithm exploiting the dual nature of the constructed code. Performance analysis and simulations show high decoding speed, that allows to construct long codes while maintaining low decoding latency. The resulting high throughput and good error-correction performance are appealing for optical communication systems and other systems where high throughput and low latency are required.
2021 IEEE International Symposium on Information Theory (ISIT), 2021
We propose a novel coupling technique for the design of polar codes of length N , making them dec... more We propose a novel coupling technique for the design of polar codes of length N , making them decodable through a sliding window of size M ă N. This feature allows to reduce the computational complexity of the decoder, an important possibility in wireless communication downlink scenarios. Our approach is based on the design of an ad-hoc kernel to be inserted in a multi-kernel polar code framework; this structure enables the sliding window decoding of the code. Simulation results show that the proposed sliding window polar codes outperform the independent blocks transmission in the proposed scenario, at the cost of a negligible decoding overhead.
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
Blind quality estimation for corrupted source signals based on a-posteriori probabilities. In Pro... more Blind quality estimation for corrupted source signals based on a-posteriori probabilities. In Proc. IEEE Int. Symp. Inform. Theory (ISIT) (pp. 304) General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. ? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us at [email protected] providing details, and we will remove access to the work immediately and investigate your claim.
In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, ... more In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, proving that this construction actually polarizes. To this end, we derive a new and more general proof of polarization, which gives sufficient conditions for kernels to polarize. Finally, we derive the convergence rate of the multi-kernel construction and relate it to the convergence rate of each of the constituent kernels.
This paper addresses extrinsic information chart based design of non-systematic irregular repeat-... more This paper addresses extrinsic information chart based design of non-systematic irregular repeat-accumulate codes for a given number of decoding iterations. This criterion is of practical importance in many applications where complexity or latency is limited. Our main contribution is a novel formulation of the optimzation problem in a particular way that makes its actual evaluation possible. This is achieved by introducing additional optimization variables and constraints which have the effect of “unrolling” the iteration. Our approach enforces the finite iteration condition, while avoiding the need to know arbitrary repeated functional compositions of the component EXIT functions. We restrict attention to the binary erasure channel, for which the EXIT chart approach is exact. Extension to other sparse-graph codes and other communication channels is straightforward.
2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2021
Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for mas... more Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for massive uplink communication. In this modulation, transmitters encode data as rank-1 tensors, with factors from a discrete vector constellation. This construction allows to split the multiuser receiver into a user separation step based on a low-rank tensor decomposition, and independent single-user demappers. In this paper, we analyze the limits of the tensor decomposition using Cramér-Rao bounds, providing bounds on the accuracy of the estimated factors. These bounds are shown by simulation to be tight at high SNR. We introduce an approximate perturbation model for the output of the tensor decomposition, which facilitates the computation of the log-likelihood ratios (LLR) of the transmitted bits, and provides an approximate achievable bound for the finite-length error probability. Combining TBM with classical forward error correction coding schemes such as polar codes, we use the approximate LLR to derive soft-decision decoders showing a gain over hard-decision decoders at low SNR.
2018 IEEE Global Communications Conference (GLOBECOM), 2018
Research on polar codes has been constantly gaining attention over the last decade, by academia a... more Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have been selected as one of the coding schemes in the 5 th generation wireless standard (5G). Over the years various polar code decoding algorithms, like SC-list (SCL), have been proposed to improve the mediocre performance of the successive cancellation (SC) decoding algorithm for finite code lengths; however, like SC, they suffer from long decoding latency. Fast decoding of polar codes tries to overcome this problem by identifying particular subcodes in the polar code and decoding them with efficient decoders. In this work, we introduce a generalized approach to fast decoding of polar codes to further reduce SC-based decoding latency. We propose three multi-node polar code subcodes whose identification patterns include most of the existing subcodes, extending them to SCL decoding, and allow to apply fast decoding to larger subsets of bits. Without any error-correction performance degradation, the proposed technique shows up to 23.6% and 29.2% decoding latency gain with respect to fast SC and SCL decoding algorithms, respectively, and up to 63.6% and 49.8% if a performance loss is accepted, whose amount depends on code and decoding algorithm parameters, along with the desired speedup.
2017 IEEE International Conference on Communications Workshops (ICC Workshops), 2017
We propose a generalized construction for binary polar codes based on mixing multiple kernels of ... more We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms stateof-the-art constructions using puncturing methods.
In this paper, we propose a new polar code construction by employing kernels of different sizes i... more In this paper, we propose a new polar code construction by employing kernels of different sizes in the Kronecker product of the transformation matrix, thus generalizing the original construction by Arikan. The proposed multi-kernel polar code allows for more flexibility in terms of the code length, moreover allowing for various new design principles. We describe in detail encoding as well as successive cancellation (SC) decoding and SC list (SCL) decoding, and we provide a novel design method for the frozen set that allows to optimise the performance under list decoding, as opposed to original relability-based code design. Finally, we numerically demonstrate the advantage of multi-kernel polar codes under the new design principles compared to punctured and shortened polar codes.
We introduce a modulation for unsourced massive random access whereby the transmitted symbols are... more We introduce a modulation for unsourced massive random access whereby the transmitted symbols are rank-1 tensors constructed from Grassmannian sub-constellations. The use of a low-rank tensor structure, together with tensor decomposition in order to separate the users at the receiver, allows a convenient uncoupling between multiuser separation and single-user demapping. The proposed signaling scheme is designed for the block fading channel and multiple-antenna settings, and is shown to perform well in comparison to stateof-the-art unsourced approaches.
GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017
In this paper, we propose a construction for multikernel polar codes based on the maximization of... more In this paper, we propose a construction for multikernel polar codes based on the maximization of the minimum distance. Compared to the original construction based on density evolution, our new design shows particular advantages for short code lengths, where the polarization effect has less impact on the performance than the distances of the code. We introduce and compute the minimum-distance profile and provide a simple greedy algorithm for the code design. Compared to state-of-theart punctured or shortened Arikan polar codes, multi-kernel polar codes with our new design show significantly improved error-rate performance.
Optical Fiber Communication Conference (OFC) 2019, 2019
We propose a very low-complexity and high-performance algorithm for soft-demapping of multi-dimen... more We propose a very low-complexity and high-performance algorithm for soft-demapping of multi-dimensional modulation formats. We assess its performance over the linear channel for four 8D formats, generated using binary arithmetics. This solution outperforms current algorithms in terms of complexity without loss in performances.
In this paper, we study the connection between polar codes and product codes. Our analysis shows ... more In this paper, we study the connection between polar codes and product codes. Our analysis shows that the product of two polar codes is again a polar code, and we provide guidelines to compute its frozen set on the basis of the frozen sets of the component polar codes. Moreover, we show how polar codes can be described as irregular product codes. We propose a two-step decoder for long polar codes taking advantage of this dual nature to heavily reduce decoding latency. Finally, we show that the proposed decoding technique outperforms both standard polar codes and state-of-the-art codes for optical communications under latency constraints.
We analyze and optimize the secrecy performance of artificial noise (AN) in multi-input single-ou... more We analyze and optimize the secrecy performance of artificial noise (AN) in multi-input single-output wiretap channels with multiple antennas at the transmitter and a single antenna at the receiver and the eavesdropper. We consider two transmission schemes: 1) an on-off transmission scheme with a constant secrecy rate for all transmission periods, and 2) an adaptive transmission scheme with a varying secrecy rate during each transmission period. For the on-off transmission scheme, an easy-to-compute expression is derived for the hybrid outage probability, which allows us to evaluate the transmission outage probability and the secrecy outage probability. For the adaptive transmission scheme where transmission outage does not occur, we derive a closedform expression for the secrecy outage probability. Using these expressions, we determine the optimal power allocation between the information signal and the AN signal and also determine the optimal secrecy rate such that the effective secrecy throughput is maximized for both transmission schemes. We show that the maximum effective secrecy throughput requires more power to be allocated to the AN signal when the quality of the transmitterreceiver channel or the transmitter-eavesdropper channel improves. We also show that both transmission schemes achieve a higher maximum effective secrecy throughput while incurring a lower secrecy outage probability than existing schemes.
2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, 2007
This paper presents a novel iterative receiver for mobile handsets using multiple antennas in the... more This paper presents a novel iterative receiver for mobile handsets using multiple antennas in the GSM/EDGE system. The receiver is derived based on the space alternatinggeneralized expectation-maximization (SAGE) method. It performs joint channel estimation, spatial diversity combining and successive co-channel interference (CCI) cancellation. The channel impulse response of all users are jointly estimated, while the users' transmitted symbols are detected successively. The receiver has a tractable complexity that increases linearly with the number of interferers. Two practically relevant applications are investigated by means of Monte Carlo simulations: single antenna interference cancellation (SAIC) in the GSM system and dual antenna interference cancellation (DAIC) in the EDGE system. Simulations using the TU3 channel model show that the new proposed scheme achieves a significant performance gain compared to the conventional receiver at low signal-tointerference ratios (SIRs).
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2000
General rights Copyright and moral rights for the publications made accessible in the public port... more General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. ? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ?
Uploads
Papers by Ingmar Land