Pub Date : 2004-12-01DOI: 10.1109/ACSSC.2004.1399317
Jun Jin Kong, K. Parhi
In this paper, design of quantum convolutional codes and their encoder architectures have been investigated. We claim that rate-1/(n+1) quantum systematic convolutional codes can be constructed from rate-1/n classical nonsystematic convolutional codes, where n is greater than or equal to 2. The free distances (d/sub free/) of proposed rate-1/(n+1) quantum systematic convolutional codes are larger than that of original rate-1/n classical nonsystematic convolutional codes. A quantum convolutional code encoder can be implemented by using quantum linear feed-forward shift registers and quantum exclusive-OR (controlled-NOT: CNOT) gates. A quantum memory may be used as a quantum state delay element of a quantum register. It is also shown that different encoder architectures one needed for quantum nonsuperposition and superposition state inputs. For quantum superposition state input, additional Hadamard gates should be used in conjunction with a quantum convolutional code encoder for quantum nonsuperposition state input.
{"title":"Quantum convolutional codes design and their encoder architectures","authors":"Jun Jin Kong, K. Parhi","doi":"10.1109/ACSSC.2004.1399317","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399317","url":null,"abstract":"In this paper, design of quantum convolutional codes and their encoder architectures have been investigated. We claim that rate-1/(n+1) quantum systematic convolutional codes can be constructed from rate-1/n classical nonsystematic convolutional codes, where n is greater than or equal to 2. The free distances (d/sub free/) of proposed rate-1/(n+1) quantum systematic convolutional codes are larger than that of original rate-1/n classical nonsystematic convolutional codes. A quantum convolutional code encoder can be implemented by using quantum linear feed-forward shift registers and quantum exclusive-OR (controlled-NOT: CNOT) gates. A quantum memory may be used as a quantum state delay element of a quantum register. It is also shown that different encoder architectures one needed for quantum nonsuperposition and superposition state inputs. For quantum superposition state input, additional Hadamard gates should be used in conjunction with a quantum convolutional code encoder for quantum nonsuperposition state input.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131292832","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-12-01DOI: 10.1109/ACSSC.2004.1399381
A. Dimakis, Vinod M. Prabhakaran, K. Ramchandran
We assume a large-scale wireless sensor network of n nodes, measuring a physical quantity of interest (e.g. temperature). Most of the sensors are used as storage devices and relays while only a fraction (k out of n) is gathering data. We assume that each node can store at most one data packet. We are interested in storing these k data packets in the n nodes using redundancy so that we can reconstruct the original measurements by asking any k storage nodes in the network (with high probability). We show how this problem is closely related with the distributed construction of an erasure code. To solve this problem, we introduce a new class of erasure codes that can be created without gathering all data at one central location and show that by using these decentralized erasure codes, it is possible to diffuse the data by "pre-routing" only O(ln n) packets per data node to randomly selected storage nodes.
{"title":"Distributed data storage in sensor networks using decentralized erasure codes","authors":"A. Dimakis, Vinod M. Prabhakaran, K. Ramchandran","doi":"10.1109/ACSSC.2004.1399381","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399381","url":null,"abstract":"We assume a large-scale wireless sensor network of n nodes, measuring a physical quantity of interest (e.g. temperature). Most of the sensors are used as storage devices and relays while only a fraction (k out of n) is gathering data. We assume that each node can store at most one data packet. We are interested in storing these k data packets in the n nodes using redundancy so that we can reconstruct the original measurements by asking any k storage nodes in the network (with high probability). We show how this problem is closely related with the distributed construction of an erasure code. To solve this problem, we introduce a new class of erasure codes that can be created without gathering all data at one central location and show that by using these decentralized erasure codes, it is possible to diffuse the data by \"pre-routing\" only O(ln n) packets per data node to randomly selected storage nodes.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121493488","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-12-01DOI: 10.1109/ACSSC.2004.1399478
B. Sprague, M. Gardner, C. Pearson, P. Maddox, K. Bloom, E. Salmon, D. Odde
Fluorescence microscopy is a popular technique for visualizing protein dynamics in living cells. However, the precise distribution of fluorophores underlying the observed fluorescence is not always obvious, even after deconvolution, particularly when features on a scale of 250 nm or less are of interest In contrast, quantitative models of protein dynamics predict an actual fluorophore distribution. "Model-convolution" is a method that bridges this gap by convolving model-predicted fluorophore location data with the point spread function of the microscope system so that simulated images can be generated and directly compared to experimental images. This article offers a practical guide to model-convolution.
{"title":"Model-convolution approach to modeling fluorescent protein dynamics","authors":"B. Sprague, M. Gardner, C. Pearson, P. Maddox, K. Bloom, E. Salmon, D. Odde","doi":"10.1109/ACSSC.2004.1399478","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399478","url":null,"abstract":"Fluorescence microscopy is a popular technique for visualizing protein dynamics in living cells. However, the precise distribution of fluorophores underlying the observed fluorescence is not always obvious, even after deconvolution, particularly when features on a scale of 250 nm or less are of interest In contrast, quantitative models of protein dynamics predict an actual fluorophore distribution. \"Model-convolution\" is a method that bridges this gap by convolving model-predicted fluorophore location data with the point spread function of the microscope system so that simulated images can be generated and directly compared to experimental images. This article offers a practical guide to model-convolution.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114067614","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-12-01DOI: 10.1109/ACSSC.2004.1399177
A. E. Cohen, K. Parhi
This paper focuses on designing elliptic curve crypto-accelerators in GF(2/sup m/) that are cryptographically scalable and hold some degree of reconfigurability. Previous work in elliptic curve crypto-accelerators focused on implementations using projective coordinate systems for specific field sizes. Their performance, scalar point multiplication per second (kP/s) was determined primarily by the underlying multiplier implementation. In addition, a multiplier only implementation and a multiplier plus divider implementation are compared in terms of critical path, area and area time (AT) product. Our multiplier only design, designed for high performance, can achieve 6314 kP/s for GF(2/sup 571/) and requires 47876 LUTs. Meanwhile our multiplier and divider design, with a greater degree of reconfigurability, can achieve 44 kP/s for GF(2/sup 571/). However, this design requires 27355 LUTs, and has a significantly higher AT product. It is shown that reconfigurability with the reduction polynomial significantly benefits from the addition of a low latency divider unit and scalar point multiplication in affine coordinates. In both cases the performance is limited by a critical path in the control logic.
{"title":"Implementation of scalable elliptic curve cryptosystem crypto-accelerators for GF(2/sup m/)","authors":"A. E. Cohen, K. Parhi","doi":"10.1109/ACSSC.2004.1399177","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399177","url":null,"abstract":"This paper focuses on designing elliptic curve crypto-accelerators in GF(2/sup m/) that are cryptographically scalable and hold some degree of reconfigurability. Previous work in elliptic curve crypto-accelerators focused on implementations using projective coordinate systems for specific field sizes. Their performance, scalar point multiplication per second (kP/s) was determined primarily by the underlying multiplier implementation. In addition, a multiplier only implementation and a multiplier plus divider implementation are compared in terms of critical path, area and area time (AT) product. Our multiplier only design, designed for high performance, can achieve 6314 kP/s for GF(2/sup 571/) and requires 47876 LUTs. Meanwhile our multiplier and divider design, with a greater degree of reconfigurability, can achieve 44 kP/s for GF(2/sup 571/). However, this design requires 27355 LUTs, and has a significantly higher AT product. It is shown that reconfigurability with the reduction polynomial significantly benefits from the addition of a low latency divider unit and scalar point multiplication in affine coordinates. In both cases the performance is limited by a critical path in the control logic.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128180692","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-12-01DOI: 10.1109/ACSSC.2004.1399281
K. Slavakis, I. Yamada, N. Ogura, M. Yukawa
This paper presents an algorithmic solution, the adaptive projected subgradient method, to the problem of asymptotically minimizing a certain sequence of nonnegative continuous convex functions over the fixed point set of strongly attracting nonexpansive mappings in a real Hilbert space. The proposed method provides with a strongly convergent, asymptotically optimal point sequence as well as with a characterization of the limiting point. As a side effect, the method allows the asymptotic minimization over the nonempty intersection of a finite number of closed convex sets. Thus, new directions for set theoretic adaptive filtering algorithms are revealed whenever the estimandum (system to be identified) is known to satisfy a number of convex constraints. This leads to a unification of a wide range of set theoretic adaptive filtering schemes such as NLMS, projected or constrained NLMS, APA, adaptive parallel subgradient projection algorithm, adaptive parallel min-max projection algorithm as well as their embedded constraint versions. Numerical results demonstrate the effectiveness of the proposed method to the problem of stereophonic acoustic echo cancellation.
{"title":"Adaptive projected subgradient method and set theoretic adaptive filtering with multiple convex constraints","authors":"K. Slavakis, I. Yamada, N. Ogura, M. Yukawa","doi":"10.1109/ACSSC.2004.1399281","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399281","url":null,"abstract":"This paper presents an algorithmic solution, the adaptive projected subgradient method, to the problem of asymptotically minimizing a certain sequence of nonnegative continuous convex functions over the fixed point set of strongly attracting nonexpansive mappings in a real Hilbert space. The proposed method provides with a strongly convergent, asymptotically optimal point sequence as well as with a characterization of the limiting point. As a side effect, the method allows the asymptotic minimization over the nonempty intersection of a finite number of closed convex sets. Thus, new directions for set theoretic adaptive filtering algorithms are revealed whenever the estimandum (system to be identified) is known to satisfy a number of convex constraints. This leads to a unification of a wide range of set theoretic adaptive filtering schemes such as NLMS, projected or constrained NLMS, APA, adaptive parallel subgradient projection algorithm, adaptive parallel min-max projection algorithm as well as their embedded constraint versions. Numerical results demonstrate the effectiveness of the proposed method to the problem of stereophonic acoustic echo cancellation.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115799928","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-12-01DOI: 10.1109/ACSSC.2004.1399430
John E. Pickard, Rob L. Janiczek, S. Acton, J. Sklenar, J. Hossack, Sanjiv Kaul
Myocardial contrast echocardiography (MCE) is a promising new technique that allows quantification of myocardium perfusion and therefore accurate diagnosis of coronary artery disease. MCE data, however, have previously required tedious and time-consuming off-line manual image processing. This paper presents results that demonstrate success of an automatic segmentation approach utilizing active shape models. A shape model was created from a training set of eleven manually drawn contours, which was then applied to twenty-two MCE images. Standard success metrics show that error from this automatic method is comparable to error found among manually drawn contours. Additionally, a more robust calculation of the key blood flow parameters was developed which can accommodate error in the segmentation, verified by high correlation between manually and automatically derived parameters.
{"title":"Segmentation of the myocardium from myocardial contrast echocardiography","authors":"John E. Pickard, Rob L. Janiczek, S. Acton, J. Sklenar, J. Hossack, Sanjiv Kaul","doi":"10.1109/ACSSC.2004.1399430","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399430","url":null,"abstract":"Myocardial contrast echocardiography (MCE) is a promising new technique that allows quantification of myocardium perfusion and therefore accurate diagnosis of coronary artery disease. MCE data, however, have previously required tedious and time-consuming off-line manual image processing. This paper presents results that demonstrate success of an automatic segmentation approach utilizing active shape models. A shape model was created from a training set of eleven manually drawn contours, which was then applied to twenty-two MCE images. Standard success metrics show that error from this automatic method is comparable to error found among manually drawn contours. Additionally, a more robust calculation of the key blood flow parameters was developed which can accommodate error in the segmentation, verified by high correlation between manually and automatically derived parameters.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121065169","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-12-01DOI: 10.1109/ACSSC.2004.1399500
Jie Yu, A. Petropulu
Recent works have shown that high-speed wireline traffic exhibits self-similarity and burstings over a large range of time scales. Several studies in the past have hypothesized that wireless traffic is also self-similar but without adequate justification. We proposed a model for the wireless traffic that takes into account the behavior of an energy efficient gateway when fed by self-similar traffic, and also the behavior of the wireless channel. We show that under certain assumptions, the traffic that leaves the gateway will be self-similar, while in some cases the self-similarity might disappear. The analytical results are confirmed by simulations.
{"title":"On the propagation of self-similar traffic via a wireless gateway","authors":"Jie Yu, A. Petropulu","doi":"10.1109/ACSSC.2004.1399500","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399500","url":null,"abstract":"Recent works have shown that high-speed wireline traffic exhibits self-similarity and burstings over a large range of time scales. Several studies in the past have hypothesized that wireless traffic is also self-similar but without adequate justification. We proposed a model for the wireless traffic that takes into account the behavior of an energy efficient gateway when fed by self-similar traffic, and also the behavior of the wireless channel. We show that under certain assumptions, the traffic that leaves the gateway will be self-similar, while in some cases the self-similarity might disappear. The analytical results are confirmed by simulations.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"137 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120896031","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-12-01DOI: 10.1109/ICASSP.2005.1415724
R. Lin, A. Petropulu
We propose a new media access protocol for wireless networks, that through its ability to resolve collisions can achieve high throughput. We view the wireless network as a spatially distributed antenna, with antenna elements linked via the wireless channel. When there is a collision, the collided packets are saved in a buffer. In the slots following the collision, a set of nodes designated as relays, bounce off the signal they received during the collision slot. By processing the originally collided packets and the signals forwarded by the relays, the destination node can recover the original packets. The spatial diversity introduced via the cooperative relaying enables us to effectively deal with the wireless channel without any bandwidth expansion or additional antenna hardware. The proposed scheme offers the benefits of ALOHA systems in the sense that all nodes share access to media resources efficiently and without extra scheduling overhead, and enables efficient use of network power.
{"title":"Cooperative transmission for random access wireless networks","authors":"R. Lin, A. Petropulu","doi":"10.1109/ICASSP.2005.1415724","DOIUrl":"https://doi.org/10.1109/ICASSP.2005.1415724","url":null,"abstract":"We propose a new media access protocol for wireless networks, that through its ability to resolve collisions can achieve high throughput. We view the wireless network as a spatially distributed antenna, with antenna elements linked via the wireless channel. When there is a collision, the collided packets are saved in a buffer. In the slots following the collision, a set of nodes designated as relays, bounce off the signal they received during the collision slot. By processing the originally collided packets and the signals forwarded by the relays, the destination node can recover the original packets. The spatial diversity introduced via the cooperative relaying enables us to effectively deal with the wireless channel without any bandwidth expansion or additional antenna hardware. The proposed scheme offers the benefits of ALOHA systems in the sense that all nodes share access to media resources efficiently and without extra scheduling overhead, and enables efficient use of network power.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133061166","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-12-01DOI: 10.1109/ACSSC.2004.1399527
Ming Ding, B. Evans, I. Wong
Channel equalization plays a key role in achieving high bit rates in wireline multicarrier systems. Some VDSL systems and all standardized multicarrier ADSL systems employ time domain equalization (channel shortening) and frequency domain equalization in channel equalization. In this paper, we analyze the impact of imperfect channel estimates on the bit rate performance of four time domain equalization methods. We derive a closed-form expression for the bit rate loss due to channel estimation error. We simulate the sensitivity in bit rate performance using first-generation downstream ADSL transmission. In simulation, the minimum intersymbol interference and minimum mean square error methods are relatively insensitive to channel estimation errors vs. minimum delay spread and maximum shortening signal-to-noise ratio methods.
{"title":"Effect of channel estimation error on bit rate performance of time domain equalizers","authors":"Ming Ding, B. Evans, I. Wong","doi":"10.1109/ACSSC.2004.1399527","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399527","url":null,"abstract":"Channel equalization plays a key role in achieving high bit rates in wireline multicarrier systems. Some VDSL systems and all standardized multicarrier ADSL systems employ time domain equalization (channel shortening) and frequency domain equalization in channel equalization. In this paper, we analyze the impact of imperfect channel estimates on the bit rate performance of four time domain equalization methods. We derive a closed-form expression for the bit rate loss due to channel estimation error. We simulate the sensitivity in bit rate performance using first-generation downstream ADSL transmission. In simulation, the minimum intersymbol interference and minimum mean square error methods are relatively insensitive to channel estimation errors vs. minimum delay spread and maximum shortening signal-to-noise ratio methods.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123183519","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-12-01DOI: 10.1109/ACSSC.2004.1399396
Wun-Cheol Jeong, Jong‐Moon Chung
Multiple-input multiple-output (MIMO) systems can enable drastic increments in channel capacity by employing array antennas both at the transmitter and the receiver. However, the capacity of MIMO systems degrades severely when spatial correlation among multipath channels is present. In this paper, we show that the channel capacity is dominantly affected by shadowing, rather than multipath correlation. To overcome this adverse shadowing effect, we consider macroscopic selection diversity (MSD) scheme on top of MIMO technology, and provide an analysis of capacity outage probability for MSD-MIMO systems. The numerical results show that significant improvement is observed even with 2 base station (BS) diversity. It is also observed that the effect of spatial correlation due to multipath fading is almost negligible when multiple BSs cooperatively participate in the mobile communication scheme. Combined with the BS selection scheme, the proposed MSD-MIMO system overcomes adverse shadowing phenomena while obtaining spatial multiplexing gain in MIMO channels.
{"title":"Enhanced broadband wireless networking through macroscopic diversity combining applications of MIMO technology","authors":"Wun-Cheol Jeong, Jong‐Moon Chung","doi":"10.1109/ACSSC.2004.1399396","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399396","url":null,"abstract":"Multiple-input multiple-output (MIMO) systems can enable drastic increments in channel capacity by employing array antennas both at the transmitter and the receiver. However, the capacity of MIMO systems degrades severely when spatial correlation among multipath channels is present. In this paper, we show that the channel capacity is dominantly affected by shadowing, rather than multipath correlation. To overcome this adverse shadowing effect, we consider macroscopic selection diversity (MSD) scheme on top of MIMO technology, and provide an analysis of capacity outage probability for MSD-MIMO systems. The numerical results show that significant improvement is observed even with 2 base station (BS) diversity. It is also observed that the effect of spatial correlation due to multipath fading is almost negligible when multiple BSs cooperatively participate in the mobile communication scheme. Combined with the BS selection scheme, the proposed MSD-MIMO system overcomes adverse shadowing phenomena while obtaining spatial multiplexing gain in MIMO channels.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116990805","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
扫码关注我们
求助内容：
应助结果提醒方式：