Pub Date : 2010-07-26DOI: 10.1109/CISS.2009.5054833
Y. Savir, Tsvi Tlusty
Molecular recognition, which is essential in processing information in biological systems, takes place in a crowded noisy biochemical environment and requires the recognition of a specific target within a background of various similar competing molecules. We consider molecular recognition as a transmission of information via a noisy channel and use this analogy to gain insights on the optimal, or fittest, molecular recognizer. We focus on the optimal structural properties of the molecules such as flexibility and conformation. We show that conformational changes upon binding, which often occur during molecular recognition, may optimize the detection performance of the recognizer. We thus suggest a generic design principle termed ‘conformational proofreading’ in which deformation enhances detection. We evaluate the optimal flexibility of the molecular recognizer, which is analogous to the stochasticity in a decision unit. In some scenarios, a flexible recognizer, i.e., a stochastic decision unit, performs better than a rigid, deterministic one. As a biological example, we discuss conformational changes during homologous recombination, the process of genetic exchange between two DNA strands.
{"title":"Molecular recognition as an information channel: The role of conformational changes","authors":"Y. Savir, Tsvi Tlusty","doi":"10.1109/CISS.2009.5054833","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054833","url":null,"abstract":"Molecular recognition, which is essential in processing information in biological systems, takes place in a crowded noisy biochemical environment and requires the recognition of a specific target within a background of various similar competing molecules. We consider molecular recognition as a transmission of information via a noisy channel and use this analogy to gain insights on the optimal, or fittest, molecular recognizer. We focus on the optimal structural properties of the molecules such as flexibility and conformation. We show that conformational changes upon binding, which often occur during molecular recognition, may optimize the detection performance of the recognizer. We thus suggest a generic design principle termed ‘conformational proofreading’ in which deformation enhances detection. We evaluate the optimal flexibility of the molecular recognizer, which is analogous to the stochasticity in a decision unit. In some scenarios, a flexible recognizer, i.e., a stochastic decision unit, performs better than a rigid, deterministic one. As a biological example, we discuss conformational changes during homologous recombination, the process of genetic exchange between two DNA strands.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134234853","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 : 2009-06-02DOI: 10.1109/CISS.2009.5054754
E. Psota, L. C. Pérez
A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.
{"title":"Extrinsic tree decoding","authors":"E. Psota, L. C. Pérez","doi":"10.1109/CISS.2009.5054754","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054754","url":null,"abstract":"A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116226476","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054742
Ahmed O. Nasif, B. L. Mark
We consider the problem of localizing multiple cochannel transmitters belonging to a licensed or primary network using signal strength measurements taken by a group of unlicensed or secondary nodes. Traditional localization techniques can be applied to multiple transmitter localization, provided that: (1) the total number of cochannel transmitters in the system is known, and (2) an appropriate set of clustered measurements is available. In this paper, we present two criteria to determine the total number of cochannel transmitters in the primary system. The first criterion is called the net MMSE criterion, which uses the Cramér-Rao lower bound on localization accuracy. The second criterion is the information theoretic criterion, minimum description length. Both of these criteria lead to measurement clustering algorithms in a natural way. Although we consider only signal strength measurements, the approach can be generalized to include other types of observations (e.g., time and angle information) with independent measurements in additive noise. Our numerical results demonstrate the effectiveness of the proposed approach to measurement clustering.
{"title":"Measurement clustering criteria for localization of multiple transmitters","authors":"Ahmed O. Nasif, B. L. Mark","doi":"10.1109/CISS.2009.5054742","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054742","url":null,"abstract":"We consider the problem of localizing multiple cochannel transmitters belonging to a licensed or primary network using signal strength measurements taken by a group of unlicensed or secondary nodes. Traditional localization techniques can be applied to multiple transmitter localization, provided that: (1) the total number of cochannel transmitters in the system is known, and (2) an appropriate set of clustered measurements is available. In this paper, we present two criteria to determine the total number of cochannel transmitters in the primary system. The first criterion is called the net MMSE criterion, which uses the Cramér-Rao lower bound on localization accuracy. The second criterion is the information theoretic criterion, minimum description length. Both of these criteria lead to measurement clustering algorithms in a natural way. Although we consider only signal strength measurements, the approach can be generalized to include other types of observations (e.g., time and angle information) with independent measurements in additive noise. Our numerical results demonstrate the effectiveness of the proposed approach to measurement clustering.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118584","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054783
Ming-Wei Liu, J. Doherty
A data-aided iterative algorithm to estimate the nonlinearities of wireless emitters for Specific emitter Identification (SEI) is presented. To achieve robust estimation, Inter Symbol Interference (ISI) is removed by iteratively estimating the channel coefficients and nonlinear transmit symbols to achieve asymptotically unbiased estimation. The complexity of the iteration procedure is further reduced by increasing the step size of the iteration result. The algorithm is applicable to various communication systems where multiple amplitude level schemes are used such as QAM, OFDM, and PAM in Multiple-Input Multiple-Output (MIMO) channels. Numerical results are shown which achieve nonlinearity estimation and radio emitter identification over empirical channel models using an Orthogonal Frequency Division Multiplexing (OFDM) MIMO system.
{"title":"Wireless device identification in MIMO channels","authors":"Ming-Wei Liu, J. Doherty","doi":"10.1109/CISS.2009.5054783","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054783","url":null,"abstract":"A data-aided iterative algorithm to estimate the nonlinearities of wireless emitters for Specific emitter Identification (SEI) is presented. To achieve robust estimation, Inter Symbol Interference (ISI) is removed by iteratively estimating the channel coefficients and nonlinear transmit symbols to achieve asymptotically unbiased estimation. The complexity of the iteration procedure is further reduced by increasing the step size of the iteration result. The algorithm is applicable to various communication systems where multiple amplitude level schemes are used such as QAM, OFDM, and PAM in Multiple-Input Multiple-Output (MIMO) channels. Numerical results are shown which achieve nonlinearity estimation and radio emitter identification over empirical channel models using an Orthogonal Frequency Division Multiplexing (OFDM) MIMO system.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115535427","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054834
Tsvi Tlusty
The function of the organism hinges on the performance of its information-processing networks, which convey information via molecular recognition. Many paths within these networks utilize molecular codebooks, such as the genetic code, to translate information written in one class of molecules into another molecular “language”. The present paper examines the emergence and evolution of molecular codes in terms of ratedistortion theory and reviews recent results of this approach. We discuss how the biological problem of maximizing the fitness of an organism by optimizing its molecular coding machinery is equivalent to the communication engineering problem of designing an optimal information channel. The fitness of a molecular code takes into account the interplay between the quality of the channel and the cost of resources which the organism needs to invest in its construction and maintenance. We analyze the dynamics of a population of organisms that compete according to the fitness of their codes. The model suggests a generic mechanism for the emergence of molecular codes as a phase transition in an information channel. This mechanism is put into biological context and demonstrated in a simple example.
{"title":"The physical language of molecular codes: A rate-distortion approach to the evolution and emergence of biological codes","authors":"Tsvi Tlusty","doi":"10.1109/CISS.2009.5054834","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054834","url":null,"abstract":"The function of the organism hinges on the performance of its information-processing networks, which convey information via molecular recognition. Many paths within these networks utilize molecular codebooks, such as the genetic code, to translate information written in one class of molecules into another molecular “language”. The present paper examines the emergence and evolution of molecular codes in terms of ratedistortion theory and reviews recent results of this approach. We discuss how the biological problem of maximizing the fitness of an organism by optimizing its molecular coding machinery is equivalent to the communication engineering problem of designing an optimal information channel. The fitness of a molecular code takes into account the interplay between the quality of the channel and the cost of resources which the organism needs to invest in its construction and maintenance. We analyze the dynamics of a population of organisms that compete according to the fitness of their codes. The model suggests a generic mechanism for the emergence of molecular codes as a phase transition in an information channel. This mechanism is put into biological context and demonstrated in a simple example.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122736808","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054849
Qun Zhang, C. Menyuk, M. I. Hayee, C. Tavva, H.-W. Huang, R. Nair, M. Khaliq
After an introduction to the nonlinear fiber transmission and an optimal channel equalization scheme, recently proposed analytical step-size selection and scaling rules was verified to achieve comparable global simulation accuracy for split-step Fourier (SSF) simulations of optical pulse propagation through fiber with low simulation accuracy. Its application to digital post-compensation and its computational performance was systematically studied for return to zero (RZ) and carrier suppressed return to zero (CSRZ) modulation formats with different inline dispersion map degrees.
{"title":"Computation step-size study in digital post-compensation of fiber optic communication systems","authors":"Qun Zhang, C. Menyuk, M. I. Hayee, C. Tavva, H.-W. Huang, R. Nair, M. Khaliq","doi":"10.1109/CISS.2009.5054849","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054849","url":null,"abstract":"After an introduction to the nonlinear fiber transmission and an optimal channel equalization scheme, recently proposed analytical step-size selection and scaling rules was verified to achieve comparable global simulation accuracy for split-step Fourier (SSF) simulations of optical pulse propagation through fiber with low simulation accuracy. Its application to digital post-compensation and its computational performance was systematically studied for return to zero (RZ) and carrier suppressed return to zero (CSRZ) modulation formats with different inline dispersion map degrees.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114482949","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054784
J. Lei, R. Yates, P. Spasojevic, L. Greenstein
Opportunistic access to temporarily unused licensed frequency bands has been recognized as a cost-effective solution to mitigate the scarcity of radio spectrum incurred by the proliferation and evolution of wireless devices. In order to accomplish a more efficient spectrum utilization across time, space and frequency. the functionality of spectral awareness is expected to be incorporated into transceivers of cognitive radios (CR) in the foreseeable future. However, the agility requirements imposed on an individual CR might be very stringent since the spectrum has to be monitored on a continuous basis and the spectral holes must be detected reliably in the presence of channel fading and/or hardware failure, especially in a broadband wireless network with multiple primary users. To remedy this problem, light-weight collaboration among CRs becomes attractive since distributed signal processing can exploit the spatial diversity through network cooperation to improve the sensing reliability. To this end, we extend the classical framework for distributed detection of a single user to the case of multiuser detection, and introduce a Tanner graph description of the network topology. We designate the transmission pattern of primaries by a binary space-frequency signature sequence and view all possible patterns collectively as a low-density parity check (LDPC) codebook. Then, we invoke belief propagation message passing algorithm across the entire CR network to infer the unknown pattern iteratively from the noisy observations of all spectrum sensors. Based on the pattern inferred, the fusion centers can determine the spectral and spatial access pattern of secondary users, without interfering with the normal functioning of incumbent primaries.
{"title":"Cooperative sensing of primary users in cognitive radio networks based on message passing","authors":"J. Lei, R. Yates, P. Spasojevic, L. Greenstein","doi":"10.1109/CISS.2009.5054784","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054784","url":null,"abstract":"Opportunistic access to temporarily unused licensed frequency bands has been recognized as a cost-effective solution to mitigate the scarcity of radio spectrum incurred by the proliferation and evolution of wireless devices. In order to accomplish a more efficient spectrum utilization across time, space and frequency. the functionality of spectral awareness is expected to be incorporated into transceivers of cognitive radios (CR) in the foreseeable future. However, the agility requirements imposed on an individual CR might be very stringent since the spectrum has to be monitored on a continuous basis and the spectral holes must be detected reliably in the presence of channel fading and/or hardware failure, especially in a broadband wireless network with multiple primary users. To remedy this problem, light-weight collaboration among CRs becomes attractive since distributed signal processing can exploit the spatial diversity through network cooperation to improve the sensing reliability. To this end, we extend the classical framework for distributed detection of a single user to the case of multiuser detection, and introduce a Tanner graph description of the network topology. We designate the transmission pattern of primaries by a binary space-frequency signature sequence and view all possible patterns collectively as a low-density parity check (LDPC) codebook. Then, we invoke belief propagation message passing algorithm across the entire CR network to infer the unknown pattern iteratively from the noisy observations of all spectrum sensors. Based on the pattern inferred, the fusion centers can determine the spectral and spatial access pattern of secondary users, without interfering with the normal functioning of incumbent primaries.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595792","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054731
P. Venkitasubramaniam, L. Tong
The problem of anonymous wireless networking is considered when an adversary monitors the packet transmission timing of an unknown fraction of the network nodes. For a given level of network performance, as measured by network throughput, the problem of maximizing anonymity is studied from a game-theoretic perspective. Using conditional entropy of routes as a measure of anonymity, this problem is posed as a two player zero-sum game between the network designer and the adversary; the task of the adversary is to choose a subset of nodes to monitor so that anonymity of routes is minimum and the task of the network designer is to choose a subset of nodes (referred to as covert relays to generate independent transmission schedules and evade flow detection so that anonymity is maximized. It is shown that a Nash equilibrium exists for a general category of finite networks. The theory is applied to the numerical example of a switching network to study the relationship between anonymity, fraction of monitored relays and the fraction of covert relays.
{"title":"Anonymous networking with localized eavesdroppers: A game-theoretic approach","authors":"P. Venkitasubramaniam, L. Tong","doi":"10.1109/CISS.2009.5054731","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054731","url":null,"abstract":"The problem of anonymous wireless networking is considered when an adversary monitors the packet transmission timing of an unknown fraction of the network nodes. For a given level of network performance, as measured by network throughput, the problem of maximizing anonymity is studied from a game-theoretic perspective. Using conditional entropy of routes as a measure of anonymity, this problem is posed as a two player zero-sum game between the network designer and the adversary; the task of the adversary is to choose a subset of nodes to monitor so that anonymity of routes is minimum and the task of the network designer is to choose a subset of nodes (referred to as covert relays to generate independent transmission schedules and evade flow detection so that anonymity is maximized. It is shown that a Nash equilibrium exists for a general category of finite networks. The theory is applied to the numerical example of a switching network to study the relationship between anonymity, fraction of monitored relays and the fraction of covert relays.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121408624","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054838
E. May
In this work we will discuss the implications of understanding hybridization using the mathematical framework of error control coding theory and how this requires not only the use of information theoretic analysis tools, but compels us to view and model biomolecular systems as information transmission and processing systems. Using the genetic communication theory paradigm, we investigate coding theory algorithms for in silico categorization of single nucleotide polymorphisms based on the calculation of syndromes [1]. We explore the use of coding theory frameworks in the design of in vitro computational biosensors [2] and design of error correcting biosensors [3] for monitoring biomolecular systems. We conclude by briefly investigating the necessity of biological coding theory in the emerging field of synthetic biology [4] where incorporation of error control codes into synthetic DNA, an established area of research in the field of DNA computing [5], is becoming an area of growing interest in order to increase the robustness of engineered biomolecular systems.
{"title":"The Emergence of biological coding theory as a mathematical framework for modeling, monitoring, and modulating biomolecular systems","authors":"E. May","doi":"10.1109/CISS.2009.5054838","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054838","url":null,"abstract":"In this work we will discuss the implications of understanding hybridization using the mathematical framework of error control coding theory and how this requires not only the use of information theoretic analysis tools, but compels us to view and model biomolecular systems as information transmission and processing systems. Using the genetic communication theory paradigm, we investigate coding theory algorithms for in silico categorization of single nucleotide polymorphisms based on the calculation of syndromes [1]. We explore the use of coding theory frameworks in the design of in vitro computational biosensors [2] and design of error correcting biosensors [3] for monitoring biomolecular systems. We conclude by briefly investigating the necessity of biological coding theory in the emerging field of synthetic biology [4] where incorporation of error control codes into synthetic DNA, an established area of research in the field of DNA computing [5], is becoming an area of growing interest in order to increase the robustness of engineered biomolecular systems.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114695993","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054781
S. Narayanan, B. Narasimhan, N. Al-Dhahir
Previous work [1] on I/Q imbalance in SC-FDE transceivers investigates the effect of receiver I/Q imbalance but does not consider Doppler effects due to mobility. SCFDE in doubly-selective channels is studied in [2] and [3] but without considering I/Q imbalance. In this paper, we derive an equivalent channel model for SC-FDE in the presence of both joint Tx/Rx I/Q imbalance and mobility and present an effective low-complexity digital baseband compensation scheme. Furthermore, we propose a novel joint channel and I/Q imbalance parameter estimation scheme for SC-FDE transceivers.
{"title":"Baseband estimation and compensation of joint TX/RX I/Q imbalance in SC-FDE transceivers","authors":"S. Narayanan, B. Narasimhan, N. Al-Dhahir","doi":"10.1109/CISS.2009.5054781","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054781","url":null,"abstract":"Previous work [1] on I/Q imbalance in SC-FDE transceivers investigates the effect of receiver I/Q imbalance but does not consider Doppler effects due to mobility. SCFDE in doubly-selective channels is studied in [2] and [3] but without considering I/Q imbalance. In this paper, we derive an equivalent channel model for SC-FDE in the presence of both joint Tx/Rx I/Q imbalance and mobility and present an effective low-complexity digital baseband compensation scheme. Furthermore, we propose a novel joint channel and I/Q imbalance parameter estimation scheme for SC-FDE transceivers.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918519","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
扫码关注我们
求助内容：
应助结果提醒方式：