Pub Date : 2004-10-20DOI: 10.1109/ISIT.2004.1365582
N. Kiyavash, I. Duursma
The paper presents the vector decomposition problem (VDP) for m-torsion points on an elliptic curve. We prove that any elliptic curve for which the sufficient conditions hold is bound to be supersingular.
研究椭圆曲线上m-扭转点的矢量分解问题。我们证明了任何满足充分条件的椭圆曲线必然是超奇异的。
{"title":"On the vector decomposition problem for m-torsion points on an elliptic curve","authors":"N. Kiyavash, I. Duursma","doi":"10.1109/ISIT.2004.1365582","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365582","url":null,"abstract":"The paper presents the vector decomposition problem (VDP) for m-torsion points on an elliptic curve. We prove that any elliptic curve for which the sufficient conditions hold is bound to be supersingular.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133133571","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 : 2004-07-02DOI: 10.1109/ISIT.2004.1365329
A. G. Amat, G. Montorsi, S. Benedetto, D. Vogrig, A. Neviani, A. Gerosa
The design and test results of a three-metal, double-poly, 0.35 μm; CMOS analog turbo decoder for the rate-1/3, block length 40, UMTS turbo code, are presented. A discrete-time model of analog decoding networks is also presented. This model can be used as a tool to both predict chip performance in a short time and give design guidelines for complex decoders, for which circuit-level simulations are impractical.
{"title":"An analog turbo decoder for the UMTS standard","authors":"A. G. Amat, G. Montorsi, S. Benedetto, D. Vogrig, A. Neviani, A. Gerosa","doi":"10.1109/ISIT.2004.1365329","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365329","url":null,"abstract":"The design and test results of a three-metal, double-poly, 0.35 μm; CMOS analog turbo decoder for the rate-1/3, block length 40, UMTS turbo code, are presented. A discrete-time model of analog decoding networks is also presented. This model can be used as a tool to both predict chip performance in a short time and give design guidelines for complex decoders, for which circuit-level simulations are impractical.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130947373","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 : 2004-07-02DOI: 10.1109/ISIT.2004.1365240
H. G. Schaathun
Collusion-secure codes are used in digital fingerprinting and traitor tracing. Scattering codes were recently introduced by Sebe and Domingo-Ferrer (2002), and used to contstruct a family of codes allegedly collusion-secure against three pirates. We prove that their codes are insecure against optimal pirate strategies, and we present a new secure construction.
{"title":"Fighting three pirates with scattering codes","authors":"H. G. Schaathun","doi":"10.1109/ISIT.2004.1365240","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365240","url":null,"abstract":"Collusion-secure codes are used in digital fingerprinting and traitor tracing. Scattering codes were recently introduced by Sebe and Domingo-Ferrer (2002), and used to contstruct a family of codes allegedly collusion-secure against three pirates. We prove that their codes are insecure against optimal pirate strategies, and we present a new secure construction.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116478615","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 : 2004-07-02DOI: 10.1109/ISIT.2004.1365413
A. G. Fàbregas, G. Caire
We consider the coded modulation family of block-wise concatenated codes (BCC). The blocks are separately interleaved and fed to binary inner encoders. Finally, the output of each component inner code is mapped onto a sequence of signal components by the modulator mapping. The proposed BCCs significantly outperform conventional serial and parallel turbo codes in the block-fading channel. Differently from the AWGN and fully-interleaved fading cases, iterative decoding performs very close to ML on the block-fading channel, even for relatively short block lengths. Moreover, at constant decoding complexity per information bit, BCCs are shown to be weakly good, while standard block codes obtained by trellis-termination of convolutional codes have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called "interleaving gain" of turbo-like codes.
{"title":"Turbo-like codes for the block-fading channel","authors":"A. G. Fàbregas, G. Caire","doi":"10.1109/ISIT.2004.1365413","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365413","url":null,"abstract":"We consider the coded modulation family of block-wise concatenated codes (BCC). The blocks are separately interleaved and fed to binary inner encoders. Finally, the output of each component inner code is mapped onto a sequence of signal components by the modulator mapping. The proposed BCCs significantly outperform conventional serial and parallel turbo codes in the block-fading channel. Differently from the AWGN and fully-interleaved fading cases, iterative decoding performs very close to ML on the block-fading channel, even for relatively short block lengths. Moreover, at constant decoding complexity per information bit, BCCs are shown to be weakly good, while standard block codes obtained by trellis-termination of convolutional codes have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called \"interleaving gain\" of turbo-like codes.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122545801","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 : 2004-07-02DOI: 10.1109/ISIT.2004.1365481
N. Letzepis, A. Grant
The nonGaussian behaviour of extrinsic log-values (L-values) during iterative turbo-decoding process is investigated in this paper. We assess the use of the Pearson system to model the extrinsic L-values nonGaussian behaviour
{"title":"Non-gaussian behaviour of extrinsic log-values","authors":"N. Letzepis, A. Grant","doi":"10.1109/ISIT.2004.1365481","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365481","url":null,"abstract":"The nonGaussian behaviour of extrinsic log-values (L-values) during iterative turbo-decoding process is investigated in this paper. We assess the use of the Pearson system to model the extrinsic L-values nonGaussian behaviour","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660127","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 : 2004-07-02DOI: 10.1109/ISIT.2004.1365103
N. Gresset, J. Boutros, L. Brunel
We present a linear preceding solution to achieve full diversity with iteratively decoded bit-interleaved coded modulation on multiple antenna channels while minimizing the detection complexity.
{"title":"Optimal linear precoding for BICM over MIMO channels","authors":"N. Gresset, J. Boutros, L. Brunel","doi":"10.1109/ISIT.2004.1365103","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365103","url":null,"abstract":"We present a linear preceding solution to achieve full diversity with iteratively decoded bit-interleaved coded modulation on multiple antenna channels while minimizing the detection complexity.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132108942","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 : 2004-07-01DOI: 10.1109/ISIT.2004.1365602
V. Chandrasekaran, M. Wakin, D. Baron, Richard Baraniuk
Discontinuities in data often provide vital information, and representing these discontinuities sparsely is an important goal for approximation and compression algorithms. Little work has been done on efficient representations for higher dimensional functions containing arbitrarily smooth discontinuities. We consider the N-dimensional Horizon class-N-dimensional functions containing a C/sup K/ smooth (N-1)-dimensional singularity separating two constant regions. We derive the optimal rate-distortion function for this class and introduce the multiscale surflet representation for sparse piecewise approximation of these functions. We propose a compression algorithm using surflets that achieves the optimal asymptotic rate-distortion performance for Horizon functions. This algorithm can be implemented using knowledge of only the N-dimensional function, without explicitly estimating the (N-1)-dimensional discontinuity.
{"title":"Surflets: a sparse representation for multidimensional functions containing smooth discontinuities","authors":"V. Chandrasekaran, M. Wakin, D. Baron, Richard Baraniuk","doi":"10.1109/ISIT.2004.1365602","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365602","url":null,"abstract":"Discontinuities in data often provide vital information, and representing these discontinuities sparsely is an important goal for approximation and compression algorithms. Little work has been done on efficient representations for higher dimensional functions containing arbitrarily smooth discontinuities. We consider the N-dimensional Horizon class-N-dimensional functions containing a C/sup K/ smooth (N-1)-dimensional singularity separating two constant regions. We derive the optimal rate-distortion function for this class and introduce the multiscale surflet representation for sparse piecewise approximation of these functions. We propose a compression algorithm using surflets that achieves the optimal asymptotic rate-distortion performance for Horizon functions. This algorithm can be implemented using knowledge of only the N-dimensional function, without explicitly estimating the (N-1)-dimensional discontinuity.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134389200","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365174
H. Lo
Hwang (2003) has proposed a decoy state method in quantum key distribution (QKD). In Hwang's proposal, the average photon number of the decoy state is about two. This paper propose a new decoy state scheme using vacua or very weak coherent states as decoy states and discuss its advantages.
{"title":"Quantum key distribution with vacua or dim pulses as decoy states","authors":"H. Lo","doi":"10.1109/ISIT.2004.1365174","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365174","url":null,"abstract":"Hwang (2003) has proposed a decoy state method in quantum key distribution (QKD). In Hwang's proposal, the average photon number of the decoy state is about two. This paper propose a new decoy state scheme using vacua or very weak coherent states as decoy states and discuss its advantages.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115361845","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365167
Jinho Choi, Y. Hong, Jinhong Yuan
This paper proposes an approach for the soft-decision in the coded multiple-input multiple-output (MIMO) iterative receiver. A quadratic cost function approximation for the maximum a-posteriori (MAP) detection is considered to apply the computationally efficient sphere decoding (SD) method and a numerically stable approach for the soft-decision is proposed.
{"title":"On the soft-decision in the iterative receiver for coded MIMO systems","authors":"Jinho Choi, Y. Hong, Jinhong Yuan","doi":"10.1109/ISIT.2004.1365167","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365167","url":null,"abstract":"This paper proposes an approach for the soft-decision in the coded multiple-input multiple-output (MIMO) iterative receiver. A quadratic cost function approximation for the maximum a-posteriori (MAP) detection is considered to apply the computationally efficient sphere decoding (SD) method and a numerically stable approach for the soft-decision is proposed.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124877430","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365225
J. Jaldén, M. Skoglund, B. Ottersten
An inner space-time block code (STBC) is concatenated with a powerful outer code such as the turbo codes to achieve the low probability of error in a system with multiple antennas at the receiver and the transmitter. We study the overall performance of the system by computing the random coding exponent of the channel by the outer code.
{"title":"On the random coding exponent of multiple antenna systems using space-time block codes","authors":"J. Jaldén, M. Skoglund, B. Ottersten","doi":"10.1109/ISIT.2004.1365225","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365225","url":null,"abstract":"An inner space-time block code (STBC) is concatenated with a powerful outer code such as the turbo codes to achieve the low probability of error in a system with multiple antennas at the receiver and the transmitter. We study the overall performance of the system by computing the random coding exponent of the channel by the outer code.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125135450","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
扫码关注我们
求助内容：
应助结果提醒方式：