Pub Date : 2003-04-22DOI: 10.1109/VETECS.2003.1208807
N. Kim, Myong Seop Yang, Soon-Young Kim, M. Lee
Turbo trellis coded modulation (TTCM) invented by Patrick Robertson adapted the bandwidth efficiency of TCM and iterative decoding of turbo codes and presented better performance without bandwidth expansion [P. Robertson et al., 1996]. But TTCM has a difficulty of implementing a hardware owing to decoder complexity. So, we need efficient scheduling and date storage management. In order to solve this essential problem, we propose a novel TTCM decoder using sliding window technique by using trace back technique, which is popular for realizing long path memories for Virterbi decoders [A.J. Viterbi, Feb. 1998].
Patrick Robertson发明的Turbo栅格编码调制(TTCM)利用了TCM的带宽效率和Turbo码的迭代解码，在不扩展带宽的情况下具有更好的性能[P]。Robertson et al.， 1996]。但由于解码器的复杂性，TTCM在硬件实现上存在困难。因此，我们需要高效的调度和数据存储管理。为了解决这一关键问题，我们提出了一种新的TTCM解码器，该解码器采用滑动窗口技术，利用回溯技术实现Virterbi解码器的长路径存储器[a . j .]Viterbi, Feb. 1998]。
{"title":"Saving memory in turbo trellis coded modulation using the sliding window","authors":"N. Kim, Myong Seop Yang, Soon-Young Kim, M. Lee","doi":"10.1109/VETECS.2003.1208807","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1208807","url":null,"abstract":"Turbo trellis coded modulation (TTCM) invented by Patrick Robertson adapted the bandwidth efficiency of TCM and iterative decoding of turbo codes and presented better performance without bandwidth expansion [P. Robertson et al., 1996]. But TTCM has a difficulty of implementing a hardware owing to decoder complexity. So, we need efficient scheduling and date storage management. In order to solve this essential problem, we propose a novel TTCM decoder using sliding window technique by using trace back technique, which is popular for realizing long path memories for Virterbi decoders [A.J. Viterbi, Feb. 1998].","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121072492","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1208833
M. Hasna, Mohamed-Slim Alouini
Relayed transmission is a way to attain broader coverage by splitting the communication link from the source to the destination into several links/hops. One of the main advantages of this communication technique is that it distributes the use of power throughout the hops which means longer battery lives and lower interference introduced to the rest of the network. In this context, this paper investigates the optimal allocation of power over these links/hops for a given power budget. All hops are assumed to be subject to independent Rayleigh fading. The optimization criterion used is outage probability which is the probability that the link quality from source to destination falls below a certain threshold. Numerical results show that optimizing the allocation of power enhances the system performance, specially if the links are highly unbalanced in terms of their average fading power. They also show that non-regenerative systems with optimum power allocation can outperform regenerative systems with no power optimization.
{"title":"Optimal power allocation for relayed transmissions over Rayleigh fading channels","authors":"M. Hasna, Mohamed-Slim Alouini","doi":"10.1109/VETECS.2003.1208833","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1208833","url":null,"abstract":"Relayed transmission is a way to attain broader coverage by splitting the communication link from the source to the destination into several links/hops. One of the main advantages of this communication technique is that it distributes the use of power throughout the hops which means longer battery lives and lower interference introduced to the rest of the network. In this context, this paper investigates the optimal allocation of power over these links/hops for a given power budget. All hops are assumed to be subject to independent Rayleigh fading. The optimization criterion used is outage probability which is the probability that the link quality from source to destination falls below a certain threshold. Numerical results show that optimizing the allocation of power enhances the system performance, specially if the links are highly unbalanced in terms of their average fading power. They also show that non-regenerative systems with optimum power allocation can outperform regenerative systems with no power optimization.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116153654","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207765
Seyong Park, Kyungtae Kim, Dong-Yup Kim, Sunghyun Choi, Sangjin Hong
As the multimedia applications such as voice over IP (VoIP) and audio/visual (AV) streaming across the Internet emerge, many are working on the network architecture to extend such applications to the wireless networking domain. The emerging IEEE 802.11e quality-of-service (QoS)-enabled wireless LAN (WLAN) is considered a strong candidate for the air interface for such multimedia applications thanks to the IP-centric network paradigm along with its inherent high-speed transmission capability. This paper provides an integrated wired/wireless network architecture interfacing QoS between user level traffic over IP using differentiated service (Diffserv) and transport level traffic using IEEE 802.11e WLAN. Our study investigates the correlations in end-to-end traffic management between Diffserv and 802.11e, and presents the hierarchical QoS signaling interface between Diffserv and 802.11e, in terms of traffic classifying, shaping and policing.
{"title":"Collaborative QoS architecture between DiffServ and 802.11e wireless LAN","authors":"Seyong Park, Kyungtae Kim, Dong-Yup Kim, Sunghyun Choi, Sangjin Hong","doi":"10.1109/VETECS.2003.1207765","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207765","url":null,"abstract":"As the multimedia applications such as voice over IP (VoIP) and audio/visual (AV) streaming across the Internet emerge, many are working on the network architecture to extend such applications to the wireless networking domain. The emerging IEEE 802.11e quality-of-service (QoS)-enabled wireless LAN (WLAN) is considered a strong candidate for the air interface for such multimedia applications thanks to the IP-centric network paradigm along with its inherent high-speed transmission capability. This paper provides an integrated wired/wireless network architecture interfacing QoS between user level traffic over IP using differentiated service (Diffserv) and transport level traffic using IEEE 802.11e WLAN. Our study investigates the correlations in end-to-end traffic management between Diffserv and 802.11e, and presents the hierarchical QoS signaling interface between Diffserv and 802.11e, in terms of traffic classifying, shaping and policing.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116226238","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207812
Bing-Hung Chiang, D. Lin, Hsueh-Jyh Li, Jia-li Wang
In 2000, King proposed two g/sub 2/-based transmit diversity block coded OFDM (TDBC-OFDM) systems, i.e., space-time block coded (STBC-OFDM) and space-frequency block coded OFDM (SFBC-OFDM). However, he employed the least square (LS) detector, which was designed under the assumption that the channel is static over the duration of a space-time/frequency codeword. Thereupon, STBC-OFDM/SFBC-OFDM suffers from highly time-frequency selectivity of the channel. Recently, Antony recommended three novel detectors for space-time block coding (STBC) to combat the rapid channel variation. In our work, these detectors are applied to improve the original g/sub 2/-based TDBC-OFDM systems. Also, the performances of the improved g/sub 2/-based TDBC-OFDM systems are evaluated by computer simulation. Simulation results have revealed that significant performance improvement can be achieved even when the systems are operated in highly dispersive channels.
{"title":"Improved transmit diversity block coded OFDM systems for highly dispersive channels","authors":"Bing-Hung Chiang, D. Lin, Hsueh-Jyh Li, Jia-li Wang","doi":"10.1109/VETECS.2003.1207812","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207812","url":null,"abstract":"In 2000, King proposed two g/sub 2/-based transmit diversity block coded OFDM (TDBC-OFDM) systems, i.e., space-time block coded (STBC-OFDM) and space-frequency block coded OFDM (SFBC-OFDM). However, he employed the least square (LS) detector, which was designed under the assumption that the channel is static over the duration of a space-time/frequency codeword. Thereupon, STBC-OFDM/SFBC-OFDM suffers from highly time-frequency selectivity of the channel. Recently, Antony recommended three novel detectors for space-time block coding (STBC) to combat the rapid channel variation. In our work, these detectors are applied to improve the original g/sub 2/-based TDBC-OFDM systems. Also, the performances of the improved g/sub 2/-based TDBC-OFDM systems are evaluated by computer simulation. Simulation results have revealed that significant performance improvement can be achieved even when the systems are operated in highly dispersive channels.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124927981","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207744
Arnaud Guéguen
At high spectral efficiencies, optimal decoding of space time block coded (STBC) multiple input multiple output (MIMO) systems has a critical complexity unless the space-time code structure offers simple optimal decoding, as is the case for space time orthogonal block codes (STOBC). Indeed, the complexity of true maximum likelihood (ML) decoding or a posteriori probability (APP) decoding of STBC increase exponentially with the spectral efficiency. As a soft input soft output (SISO) decoding scheme, APP space-time decoding is of special interest since it allows the space-time receiver to efficiently work with a channel decoder. Besides, it can advantageously be used in an iterative manner with a SISO channel decoder to approach the optimal joint receiver performance. List sphere decoding (LSD) provides a good approximation of APP decoding with reduced complexity and can therefore be considered as a performance reference. This paper presents a new suboptimal SISO space-time receiver based on MMSE using priors, which has significantly lower complexity than LSD but turns out to perform similarly when used in an iterative receiver. The system under consideration is first presented, followed by a detailed description of the new proposed MMSE based receiver and a brief description of the reference LSD receiver. These two schemes are then evaluated in iterative receivers in terms of performance and complexity.
{"title":"Comparison of suboptimal iterative space-time receivers","authors":"Arnaud Guéguen","doi":"10.1109/VETECS.2003.1207744","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207744","url":null,"abstract":"At high spectral efficiencies, optimal decoding of space time block coded (STBC) multiple input multiple output (MIMO) systems has a critical complexity unless the space-time code structure offers simple optimal decoding, as is the case for space time orthogonal block codes (STOBC). Indeed, the complexity of true maximum likelihood (ML) decoding or a posteriori probability (APP) decoding of STBC increase exponentially with the spectral efficiency. As a soft input soft output (SISO) decoding scheme, APP space-time decoding is of special interest since it allows the space-time receiver to efficiently work with a channel decoder. Besides, it can advantageously be used in an iterative manner with a SISO channel decoder to approach the optimal joint receiver performance. List sphere decoding (LSD) provides a good approximation of APP decoding with reduced complexity and can therefore be considered as a performance reference. This paper presents a new suboptimal SISO space-time receiver based on MMSE using priors, which has significantly lower complexity than LSD but turns out to perform similarly when used in an iterative receiver. The system under consideration is first presented, followed by a detailed description of the new proposed MMSE based receiver and a brief description of the reference LSD receiver. These two schemes are then evaluated in iterative receivers in terms of performance and complexity.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124990117","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207557
M. Schubert, D. Karadoulamas, H. Boche, G. Lehmann
The spectral efficiency of the WCDMA downlink can significantly be increased by jointly adjusting beamformers and transmission powers. The design goal is to control individual link capacities with minimum total power. Channel information is assumed to be available at the base station. We propose a computational efficiency strategy which computes the beamforming weights by jointly balancing the instantaneous carrier-to-interference ratios (CINR) measured at each RAKE receiver input. Then, the SINRs at the RAKE output are adjusted by an additional power control step. Potential gains over conventional techniques are shown by numerical simulations.
{"title":"Joint downlink beamforming and power control for 3G WCDMA","authors":"M. Schubert, D. Karadoulamas, H. Boche, G. Lehmann","doi":"10.1109/VETECS.2003.1207557","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207557","url":null,"abstract":"The spectral efficiency of the WCDMA downlink can significantly be increased by jointly adjusting beamformers and transmission powers. The design goal is to control individual link capacities with minimum total power. Channel information is assumed to be available at the base station. We propose a computational efficiency strategy which computes the beamforming weights by jointly balancing the instantaneous carrier-to-interference ratios (CINR) measured at each RAKE receiver input. Then, the SINRs at the RAKE output are adjusted by an additional power control step. Potential gains over conventional techniques are shown by numerical simulations.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125240624","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207156
I. Barbancho, A. M. Barbancho, L. Tardón, J.T. Emtrambasaguas
In this paper, a multirate successive interference cancellation (MSIC) receiver for UMTS base stations is presented. The receiver takes into account the multirate nature of the order in which the users should be detected and cancelled. Several procedures to estimate the amplitude of the received signals are considered. The simulation results demonstrate that the performance of the proposed MSIC receiver using these amplitudes estimation techniques exceeds that of the MSIC, which uses the magnitude of the matched filter (MF) outputs as the received amplitude estimate. Finally, it will be shown that the received amplitude estimate. Finally, it will be shown that the proposed scheme outperforms other commonly employed receivers like the MMSE receiver and the correlation receiver.
{"title":"Multirate SIC receiver with several amplitude estimation methods for UMTS FDD uplink","authors":"I. Barbancho, A. M. Barbancho, L. Tardón, J.T. Emtrambasaguas","doi":"10.1109/VETECS.2003.1207156","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207156","url":null,"abstract":"In this paper, a multirate successive interference cancellation (MSIC) receiver for UMTS base stations is presented. The receiver takes into account the multirate nature of the order in which the users should be detected and cancelled. Several procedures to estimate the amplitude of the received signals are considered. The simulation results demonstrate that the performance of the proposed MSIC receiver using these amplitudes estimation techniques exceeds that of the MSIC, which uses the magnitude of the matched filter (MF) outputs as the received amplitude estimate. Finally, it will be shown that the received amplitude estimate. Finally, it will be shown that the proposed scheme outperforms other commonly employed receivers like the MMSE receiver and the correlation receiver.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122810948","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1208808
T. Fukuhara, H. Yuan, Y. Takeuchi, Hideo Kobayashi
This paper proposes a novel estimation method of channel frequency response for orthogonal frequency division multiplexing (OFDM) systems operating in fast time-variant fading channels. The proposed method enables accurate coherent demodulation without using pilot signals, which are usually required to be inserted in the data symbols periodically to cope with fast time-variant fading. Computer simulation results show that the proposed method maintains better BER performance even when the vehicle speed reaches 180 km/h.
{"title":"A novel channel estimation method for OFDM transmission technique under fast time-variant fading channel","authors":"T. Fukuhara, H. Yuan, Y. Takeuchi, Hideo Kobayashi","doi":"10.1109/VETECS.2003.1208808","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1208808","url":null,"abstract":"This paper proposes a novel estimation method of channel frequency response for orthogonal frequency division multiplexing (OFDM) systems operating in fast time-variant fading channels. The proposed method enables accurate coherent demodulation without using pilot signals, which are usually required to be inserted in the data symbols periodically to cope with fast time-variant fading. Computer simulation results show that the proposed method maintains better BER performance even when the vehicle speed reaches 180 km/h.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131630371","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207086
C. Choi, W. C. Shin, J. Park, Dong Joon Kim, Jea Hwan Ju
In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared intending to efficiently utilize resource during idle periods. In such a scheme, connection components are sequentially released as an idle period persists, while a transmission activity is resumed as a prescribed amount of traffic load is accumulated at the transmitting station. Before a transmission resume, however, latency depending on previous idle period is unavoidable to retrieve the lost connection components, which also produces a chain reaction in forthcoming idle period and connection retrieval time. An issue arising in design of the scheme is to determine a threshold value for load accumulation in conjunction with packet delay properties. A high threshold apparently incurs along stand-by to gather the prescribed traffic load before resuming transmission. On the other hand, such high threshold may shorten the length of upcoming idle period and reduce the consequent connection retrieval time by suppressing the release of connection components. In this paper, we thus investigate the antithetical effects of load threshold on packet delay performance. First, we generalize the connection retrieval time in consideration of the number of states and maximum sojourn times. Secondly, for general packet arrivals, we estimate average length of idle period and mean packet delay. In addition, we present an approximation method to calculate the moments of packet delay time for Poisson arrivals. Finally, we construct and solve a problem to find an optimal value for load threshold minimizing mean packet delay. From numerical examples, we find non-trivial optimal thresholds in the environments characterized by relatively long connection retrieval time and heavy traffic load.
{"title":"Load threshold for connection state scheme supporting packet data service in wireless networks","authors":"C. Choi, W. C. Shin, J. Park, Dong Joon Kim, Jea Hwan Ju","doi":"10.1109/VETECS.2003.1207086","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207086","url":null,"abstract":"In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared intending to efficiently utilize resource during idle periods. In such a scheme, connection components are sequentially released as an idle period persists, while a transmission activity is resumed as a prescribed amount of traffic load is accumulated at the transmitting station. Before a transmission resume, however, latency depending on previous idle period is unavoidable to retrieve the lost connection components, which also produces a chain reaction in forthcoming idle period and connection retrieval time. An issue arising in design of the scheme is to determine a threshold value for load accumulation in conjunction with packet delay properties. A high threshold apparently incurs along stand-by to gather the prescribed traffic load before resuming transmission. On the other hand, such high threshold may shorten the length of upcoming idle period and reduce the consequent connection retrieval time by suppressing the release of connection components. In this paper, we thus investigate the antithetical effects of load threshold on packet delay performance. First, we generalize the connection retrieval time in consideration of the number of states and maximum sojourn times. Secondly, for general packet arrivals, we estimate average length of idle period and mean packet delay. In addition, we present an approximation method to calculate the moments of packet delay time for Poisson arrivals. Finally, we construct and solve a problem to find an optimal value for load threshold minimizing mean packet delay. From numerical examples, we find non-trivial optimal thresholds in the environments characterized by relatively long connection retrieval time and heavy traffic load.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572284","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 : 2003-04-22DOI: 10.1109/VETECS.2003.1207551
F. Zheng, A. Burr
Several non-orthogonal space-time block coding (NO-STBC) schemes have recently been proposed to achieve full rate transmission. Some of these schemes, however, suffer from weak robustness: their channel matrices will become ill conditioned in the case of highly correlated channels (HCC). To address this issue, this paper derives a family of robust NO-STBC schemes for four Tx antennas based on the worst case of HCC. These codes turned out to be a superset of Jafarkhani's quasi-orthogonal STBC codes. A computationally affordable linear decoder is also proposed. Although these codes achieve a similar performance to the non-robust schemes under normal channel conditions, they offer a strong robustness against HCC (although possibly yielding a poorer performance). Finally, computer simulations are presented to verify the algorithm design.
{"title":"A robust non-orthogonal space-time block code for four transmit antennas","authors":"F. Zheng, A. Burr","doi":"10.1109/VETECS.2003.1207551","DOIUrl":"https://doi.org/10.1109/VETECS.2003.1207551","url":null,"abstract":"Several non-orthogonal space-time block coding (NO-STBC) schemes have recently been proposed to achieve full rate transmission. Some of these schemes, however, suffer from weak robustness: their channel matrices will become ill conditioned in the case of highly correlated channels (HCC). To address this issue, this paper derives a family of robust NO-STBC schemes for four Tx antennas based on the worst case of HCC. These codes turned out to be a superset of Jafarkhani's quasi-orthogonal STBC codes. A computationally affordable linear decoder is also proposed. Although these codes achieve a similar performance to the non-robust schemes under normal channel conditions, they offer a strong robustness against HCC (although possibly yielding a poorer performance). Finally, computer simulations are presented to verify the algorithm design.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932193","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
扫码关注我们
求助内容：
应助结果提醒方式：