Filter bank based multicarrier systems (FBMC) offer a number of benefits over conventional orthogonal frequency division multiplexing (OFDM) with cyclic prefix (CP). One benefit is the improved spectral efficiency by not using a redundant CP and by having much better control of out-of-band emission. Another advantage is the ease of accommodating multiple users in an FDMA fashion especially in the uplink, i. e. the multiple access channel (MAC). On the other hand, more elaborate equalization concepts are needed compared to the single-tap per-subcarrier equalizer sufficient in the OFDM with CP case. In this contribution we will present an efficient linear minimum mean square error (MMSE) equalization concept. Since FBMC systems employ offset-quadrature-amplitude-modulation (OQAM), a fractionally spaced per-subcarrier equalizer will be derived, which takes into account the inter-subcarrier interference due to frequency selective multipath fading. Still this is handled with decoupled per-subcarrier equalizers. Simulation results will show that OQAMFBMCs allow for savings in transmit power which have to be paid with a practicable amount of computational overhead.
{"title":"MMSE subcarrier equalization for filter bank based multicarrier systems","authors":"Dirk, Waldhauser, Leonardo, Baltar, JosefA. Nossek","doi":"10.1109/SPAWC.2008.4641663","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641663","url":null,"abstract":"Filter bank based multicarrier systems (FBMC) offer a number of benefits over conventional orthogonal frequency division multiplexing (OFDM) with cyclic prefix (CP). One benefit is the improved spectral efficiency by not using a redundant CP and by having much better control of out-of-band emission. Another advantage is the ease of accommodating multiple users in an FDMA fashion especially in the uplink, i. e. the multiple access channel (MAC). On the other hand, more elaborate equalization concepts are needed compared to the single-tap per-subcarrier equalizer sufficient in the OFDM with CP case. In this contribution we will present an efficient linear minimum mean square error (MMSE) equalization concept. Since FBMC systems employ offset-quadrature-amplitude-modulation (OQAM), a fractionally spaced per-subcarrier equalizer will be derived, which takes into account the inter-subcarrier interference due to frequency selective multipath fading. Still this is handled with decoupled per-subcarrier equalizers. Simulation results will show that OQAMFBMCs allow for savings in transmit power which have to be paid with a practicable amount of computational overhead.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506997","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641574
F. Fernandes, R. R. Lopes, D. Z. Filho
Transmission techniques for the wireless multi-antenna broadcast channel often require that the receivers feed back their channel state information (CSI) to the transmitter. In this paper, we propose a limited feedback method to approximate zero-forcing beamforming. Each user feeds back quantized information about channel direction and a deterministic lower bound on its signal-to-interference-plus-noise ratio (SINR), which require no more than an integer and a real number. With this information, the Base Station performs user scheduling, beamforming and rate adaptation. In this method, the information from both receiver and transmitter sides are taken into account to arrive at a tight lower bound on the supported rate of each user. Since a lower bound on the SINR is fed back, the proposed method avoids outage. We discuss the feedback load of the method, and show numerical results of the relationship between sum-rate and feedback load, SNR and number of users, as well as a comparison with similar methods.
{"title":"Zero-outage strategy for multi-antenna broadcast channels with limited feedback","authors":"F. Fernandes, R. R. Lopes, D. Z. Filho","doi":"10.1109/SPAWC.2008.4641574","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641574","url":null,"abstract":"Transmission techniques for the wireless multi-antenna broadcast channel often require that the receivers feed back their channel state information (CSI) to the transmitter. In this paper, we propose a limited feedback method to approximate zero-forcing beamforming. Each user feeds back quantized information about channel direction and a deterministic lower bound on its signal-to-interference-plus-noise ratio (SINR), which require no more than an integer and a real number. With this information, the Base Station performs user scheduling, beamforming and rate adaptation. In this method, the information from both receiver and transmitter sides are taken into account to arrive at a tight lower bound on the supported rate of each user. Since a lower bound on the SINR is fed back, the proposed method avoids outage. We discuss the feedback load of the method, and show numerical results of the relationship between sum-rate and feedback load, SNR and number of users, as well as a comparison with similar methods.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131983106","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641606
S. S. Pereira, A. Pagès-Zamora
In this paper we analyze the impact of quantization on the performance of a discrete-time distributed algorithm aimed at computing the average of an initial set of values in a wireless sensor network. We modify a well-known consensus model and propose a simple scheme where the transmitted data is quantized due to bandwith and/or power constraints. Conversely to existing models that include quantization noise, a closed-form expression for the residual mean square error of the state can be derived for the proposed model. This expression depends on general network parameters and provides therefore an a priori quantitative measure of the effects of quantization on the consensus.
{"title":"Distributed consensus in wireless sensor networks with quantized information exchange","authors":"S. S. Pereira, A. Pagès-Zamora","doi":"10.1109/SPAWC.2008.4641606","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641606","url":null,"abstract":"In this paper we analyze the impact of quantization on the performance of a discrete-time distributed algorithm aimed at computing the average of an initial set of values in a wireless sensor network. We modify a well-known consensus model and propose a simple scheme where the transmitted data is quantized due to bandwith and/or power constraints. Conversely to existing models that include quantization noise, a closed-form expression for the residual mean square error of the state can be derived for the proposed model. This expression depends on general network parameters and provides therefore an a priori quantitative measure of the effects of quantization on the consensus.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132781482","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641635
A. D. de Almeida, Icaro L. da Silva, G. Favier, F. Cavalcanti
We present a new precoding model for closed-loop multiple-antenna systems based on a tensor signal modeling and transmit antenna selection. The precoder is modeled as a third-order tensor and decomposed as a function of (i) an antenna selection matrix determining the allocation of data streams to transmit antennas and (ii) an orthogonal code matrix that spreads the data streams across time-slots. A sub-optimum transmit antenna selection algorithm based on limited-feedback is proposed. Blind channel estimation and symbol detection is afforded at the receiver by exploiting the algebraic tensor structure of the received signal. The bit error rate of the closed-loop system is tested by means of computer simulations.
{"title":"Tensor-based precoding with blind MIMO channel estimation and transmit antenna selection","authors":"A. D. de Almeida, Icaro L. da Silva, G. Favier, F. Cavalcanti","doi":"10.1109/SPAWC.2008.4641635","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641635","url":null,"abstract":"We present a new precoding model for closed-loop multiple-antenna systems based on a tensor signal modeling and transmit antenna selection. The precoder is modeled as a third-order tensor and decomposed as a function of (i) an antenna selection matrix determining the allocation of data streams to transmit antennas and (ii) an orthogonal code matrix that spreads the data streams across time-slots. A sub-optimum transmit antenna selection algorithm based on limited-feedback is proposed. Blind channel estimation and symbol detection is afforded at the receiver by exploiting the algebraic tensor structure of the received signal. The bit error rate of the closed-loop system is tested by means of computer simulations.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132901846","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641596
Liangnan Wu, A. Vosoughi
In this paper we propose a novel M-ary biorthogonal pulse shape modulation scheme for an Impulse radio ultra wideband (IR-UWB) system transmitting over lognormal fading channels. Our proposed modulation scheme enables different transmission rates for a fixed number of orthogonal pulses M/2, while the symbol period Ts is constant. In our transmission scheme information bits are mapped into N pulses (N symbols), using M/2 orthogonal pulses and their negates. The N generated pulses are superimposed to form one pulse that will be transmitted over the channel. The transmission rate provided by this scheme is N(log2 M/N)/Ts and is maximized at N = M/4 (i.e., one bit per orthogonal pulse). We consider maximum ratio combing (MRC)-RAKE receiver to demodulate N symbols. For the proposed scheme we derive a closed-form expression for symbol error probability and an upper bound on symbol error rate, using Wilkinsonpsilas method. Given the same channel delay spread, our scheme provides a better error performance and higher throughput than that of pulse position modulation (PPM) scheme.
{"title":"Biorthogonal pulse shape modulation for IR-UWB systems over fading channels","authors":"Liangnan Wu, A. Vosoughi","doi":"10.1109/SPAWC.2008.4641596","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641596","url":null,"abstract":"In this paper we propose a novel M-ary biorthogonal pulse shape modulation scheme for an Impulse radio ultra wideband (IR-UWB) system transmitting over lognormal fading channels. Our proposed modulation scheme enables different transmission rates for a fixed number of orthogonal pulses M/2, while the symbol period Ts is constant. In our transmission scheme information bits are mapped into N pulses (N symbols), using M/2 orthogonal pulses and their negates. The N generated pulses are superimposed to form one pulse that will be transmitted over the channel. The transmission rate provided by this scheme is N(log2 M/N)/Ts and is maximized at N = M/4 (i.e., one bit per orthogonal pulse). We consider maximum ratio combing (MRC)-RAKE receiver to demodulate N symbols. For the proposed scheme we derive a closed-form expression for symbol error probability and an upper bound on symbol error rate, using Wilkinsonpsilas method. Given the same channel delay spread, our scheme provides a better error performance and higher throughput than that of pulse position modulation (PPM) scheme.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114221084","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641621
T. Oechtering, R. F. Wyrembelski, H. Boche
We consider the broadcast phase of a three-node network, where a relay node with multiple antennas establishes a bidirectional communication between the two other nodes each equipped with a single antenna using a spectrally efficient two phase protocol. In the first phase, both nodes transmit a message to the relay node, which decodes the messages. In the second phase the relay broadcasts a re-encoded composition of them. In this work, we show that for two transmit antennas at the relay node transmitting a single beam is always an optimal transmit strategy. We show that if a single beam is optimal the beamforming vector is a linear combination of the two single-user optimal strategies. Further, we analyze the dependency of the capacity region on the correlation between the two channels.
{"title":"Optimal transmit strategy for the 2×1 MISO bidirectional broadcast channel","authors":"T. Oechtering, R. F. Wyrembelski, H. Boche","doi":"10.1109/SPAWC.2008.4641621","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641621","url":null,"abstract":"We consider the broadcast phase of a three-node network, where a relay node with multiple antennas establishes a bidirectional communication between the two other nodes each equipped with a single antenna using a spectrally efficient two phase protocol. In the first phase, both nodes transmit a message to the relay node, which decodes the messages. In the second phase the relay broadcasts a re-encoded composition of them. In this work, we show that for two transmit antennas at the relay node transmitting a single beam is always an optimal transmit strategy. We show that if a single beam is optimal the beamforming vector is a linear combination of the two single-user optimal strategies. Further, we analyze the dependency of the capacity region on the correlation between the two channels.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114903424","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641593
P. Layec, P. Piantanida, R. Visoz, A. Berthet
Traditional information-theoretic approaches to study channel feedback assume that the information is sent from the receiver to the transmitter via an ideal (instantaneous high-rate and error-free) feedback link. This paper investigates the problem of reliable communication over non-ergodic memoryless (stationary) channels using non-errorfree feedback links. We first provide a coding theorem showing that the estimation-induced outage (EIO) capacity is achieved by using rate splitting and hierarchical encoding, where the codes of different layers are jointly designed to exploit the feedback information. The feedback encoder uses hierarchical quantization to compress the state information, allowing the forward encoder to obtain successive refinement of the feedback information during the transmission. The capacity is evaluated for a fading MIMO channel assuming a single-antenna fading feedback link and imperfect channel estimation at the receiver. Simulation results show the joint impact of: (i) successive refinement of quantized feedback, (ii) noisy feedback and (iii) imperfect channel estimation, on the EIO capacity.
{"title":"Capacity of channels with multistage successive refinement of quantized feedback information via noisy links","authors":"P. Layec, P. Piantanida, R. Visoz, A. Berthet","doi":"10.1109/SPAWC.2008.4641593","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641593","url":null,"abstract":"Traditional information-theoretic approaches to study channel feedback assume that the information is sent from the receiver to the transmitter via an ideal (instantaneous high-rate and error-free) feedback link. This paper investigates the problem of reliable communication over non-ergodic memoryless (stationary) channels using non-errorfree feedback links. We first provide a coding theorem showing that the estimation-induced outage (EIO) capacity is achieved by using rate splitting and hierarchical encoding, where the codes of different layers are jointly designed to exploit the feedback information. The feedback encoder uses hierarchical quantization to compress the state information, allowing the forward encoder to obtain successive refinement of the feedback information during the transmission. The capacity is evaluated for a fading MIMO channel assuming a single-antenna fading feedback link and imperfect channel estimation at the receiver. Simulation results show the joint impact of: (i) successive refinement of quantized feedback, (ii) noisy feedback and (iii) imperfect channel estimation, on the EIO capacity.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115046913","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641584
F. P. Wathan, R. Hoshyar, R. Tafazolli
We present the performance evaluation of a grouped chip-level iterated (CLi) multiuser detection (MUD) technique that is based on Gaussian forcing technique for overloaded synchronous code-division multiple access systems. We confirm that the new grouped CLi MUD can approach the performance of the more complex CLi MUD with brute-force search. Also, we show that the new Grouped CLi MUD can provide a greater flexibility in trading off the performance and complexity. Furthermore, by incorporating a dynamic user grouping, the performance of the new CLi MUD technique can be further improved. We show via computer simulation, at the system with 200% condition, the loss of approximately 0.3 dB compared to its brute-force counterpart is observed while reducing the complexity to more than half.
{"title":"Performance analysis of grouped chip-level iterated multiuser detection for overloaded CDMA systems","authors":"F. P. Wathan, R. Hoshyar, R. Tafazolli","doi":"10.1109/SPAWC.2008.4641584","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641584","url":null,"abstract":"We present the performance evaluation of a grouped chip-level iterated (CLi) multiuser detection (MUD) technique that is based on Gaussian forcing technique for overloaded synchronous code-division multiple access systems. We confirm that the new grouped CLi MUD can approach the performance of the more complex CLi MUD with brute-force search. Also, we show that the new Grouped CLi MUD can provide a greater flexibility in trading off the performance and complexity. Furthermore, by incorporating a dynamic user grouping, the performance of the new CLi MUD technique can be further improved. We show via computer simulation, at the system with 200% condition, the loss of approximately 0.3 dB compared to its brute-force counterpart is observed while reducing the complexity to more than half.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132145780","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641568
H. Kwon
This paper analyzes the connectivity of wireless ad hoc networks in both a non-cooperative scheme and a cooperative scheme. Assuming that nodes are randomly distributed with a Poisson process, the probability of full connectivity in a system can be raised by increasing the number of connectional trials at each node. Even though an infinite number of trials guarantee full connectivity in a system, it is not of practical concern because it may require infinite power and infinite delay. Instead, this paper analyzes the required number of connection trials for full connectivity mathematically and experimentally. In addition, this paper proposes a cooperative scheme to maximize the benefit from collaboration among nodes and simulates its results.
{"title":"Outage connectivity with collaboration in wireless ad hoc networks","authors":"H. Kwon","doi":"10.1109/SPAWC.2008.4641568","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641568","url":null,"abstract":"This paper analyzes the connectivity of wireless ad hoc networks in both a non-cooperative scheme and a cooperative scheme. Assuming that nodes are randomly distributed with a Poisson process, the probability of full connectivity in a system can be raised by increasing the number of connectional trials at each node. Even though an infinite number of trials guarantee full connectivity in a system, it is not of practical concern because it may require infinite power and infinite delay. Instead, this paper analyzes the required number of connection trials for full connectivity mathematically and experimentally. In addition, this paper proposes a cooperative scheme to maximize the benefit from collaboration among nodes and simulates its results.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132261439","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 : 2008-07-06DOI: 10.1109/SPAWC.2008.4641685
S. Barembruch, Aurélien Garivier, É. Moulines
Particle filtering has been successfully used to approximate the fixed-lag or fixed-interval smoothing distributions in digital communication and to perform approximate maximum likelihood inference. Because the state-space is finite, it is possible at each step to consider all the offsprings (path) of any given particle. Because each particle has typically several possible offsprings, the population of offsprings is larger than the initial population; it is thus required to construct a novel particle swarm by selecting, among all these offsprings, particle positions and computing appropriate weights. We propose here a novel unbiased selection algorithm, which minimizes the expected loss with respect to general distance functions. In a blind deconvolution setting, the selection schemes associated to the Chi-Square distance and the Kullback-Leibler divergence are compared by simulations to the deterministic scheme that keep only the best weights.
{"title":"On optimal sampling for particle filtering in digital communication","authors":"S. Barembruch, Aurélien Garivier, É. Moulines","doi":"10.1109/SPAWC.2008.4641685","DOIUrl":"https://doi.org/10.1109/SPAWC.2008.4641685","url":null,"abstract":"Particle filtering has been successfully used to approximate the fixed-lag or fixed-interval smoothing distributions in digital communication and to perform approximate maximum likelihood inference. Because the state-space is finite, it is possible at each step to consider all the offsprings (path) of any given particle. Because each particle has typically several possible offsprings, the population of offsprings is larger than the initial population; it is thus required to construct a novel particle swarm by selecting, among all these offsprings, particle positions and computing appropriate weights. We propose here a novel unbiased selection algorithm, which minimizes the expected loss with respect to general distance functions. In a blind deconvolution setting, the selection schemes associated to the Chi-Square distance and the Kullback-Leibler divergence are compared by simulations to the deterministic scheme that keep only the best weights.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123656804","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
扫码关注我们
求助内容：
应助结果提醒方式：