Pub Date : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577744
V. Suryavanshi, Aria Nosratinia
This paper proposes a system using convolutional codes to mitigate error propagation in packet header compression. Convolutional codes are a class of forward error correction (FEC) codes, and their use is motivated because on uni-directional links loss of even one packet can render subsequent packets useless. A combination of two interleavers is used to address channel memory and increase the power of the code, and the optimum yet computationally efficient Viterbi algorithm is used for decoding at the receiver. Simulation results demonstrate the advantages of the proposed scheme.
{"title":"Convolutional coding for resilient packet header compression","authors":"V. Suryavanshi, Aria Nosratinia","doi":"10.1109/GLOCOM.2005.1577744","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577744","url":null,"abstract":"This paper proposes a system using convolutional codes to mitigate error propagation in packet header compression. Convolutional codes are a class of forward error correction (FEC) codes, and their use is motivated because on uni-directional links loss of even one packet can render subsequent packets useless. A combination of two interleavers is used to address channel memory and increase the power of the code, and the optimum yet computationally efficient Viterbi algorithm is used for decoding at the receiver. Simulation results demonstrate the advantages of the proposed scheme.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000381","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578033
K. Mosharaf, I. Lambadaris, J. Talim, A. Shokrani
We investigate a threshold-based wavelength allocation scheme in order to support fairness and service differentiation in WDM unidirectional ring networks. A ring network can handle different classes of traffic streams, which differ by their hop-counts (i.e., the number of hops used from source to destination). We assume that for each class of traffic, call interarrival and holding times are exponentially distributed. In such a network, classes of calls with smaller hop-counts, experience lower blocking rates than ones with greater hop-counts. In this paper, a multi-threshold wavelength allocation scheme is proposed to provide equal blocking probabilities experienced by different classes. A recursive simulation-based algorithm is designed to numerically compute the optimal thresholds. Simulation results compare the performance of our proposed scheme, with that of complete sharing and complete partitioning schemes
{"title":"Fairness control in wavelength-routed WDM ring networks","authors":"K. Mosharaf, I. Lambadaris, J. Talim, A. Shokrani","doi":"10.1109/GLOCOM.2005.1578033","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578033","url":null,"abstract":"We investigate a threshold-based wavelength allocation scheme in order to support fairness and service differentiation in WDM unidirectional ring networks. A ring network can handle different classes of traffic streams, which differ by their hop-counts (i.e., the number of hops used from source to destination). We assume that for each class of traffic, call interarrival and holding times are exponentially distributed. In such a network, classes of calls with smaller hop-counts, experience lower blocking rates than ones with greater hop-counts. In this paper, a multi-threshold wavelength allocation scheme is proposed to provide equal blocking probabilities experienced by different classes. A recursive simulation-based algorithm is designed to numerically compute the optimal thresholds. Simulation results compare the performance of our proposed scheme, with that of complete sharing and complete partitioning schemes","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114000961","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578014
F. Farahmand, Qiong Zhang, J. Jue
In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framework, we introduce a new contention avoidance mechanism called proportional control algorithm with explicit reduction request (PCwER). Through source rate control, PCwER proactively attempts to prevent the network from entering the congestion state. Basic building blocks and performance trade-offs of PCwER are the main focus of this paper. In addition, through a simple fluid model we analyze the characteristics of the algorithm. Our simulation results show that the proposed contention avoidance techniques improve the network utilization and reduce the packet loss probability
{"title":"A closed-loop rate-based contention control for optical burst switched networks","authors":"F. Farahmand, Qiong Zhang, J. Jue","doi":"10.1109/GLOCOM.2005.1578014","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578014","url":null,"abstract":"In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framework, we introduce a new contention avoidance mechanism called proportional control algorithm with explicit reduction request (PCwER). Through source rate control, PCwER proactively attempts to prevent the network from entering the congestion state. Basic building blocks and performance trade-offs of PCwER are the main focus of this paper. In addition, through a simple fluid model we analyze the characteristics of the algorithm. Our simulation results show that the proposed contention avoidance techniques improve the network utilization and reduce the packet loss probability","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131559157","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577627
A. Raghuveer, Nam-Oh Kang, D. Du
Universal multimedia access (UMA) refers to accessing multimedia content over a wide range of client terminals and network capacities. Scalable coding is a very popular technique to enable UMA for video. Overhead introduced by the scalable coding approach limits the number of layers that can be stored for each video. Therefore some clients may be served the closest available quality than the best-fit quality. This is a major drawback of scalable coding from the end-user perspective. We propose to employ transcoding to tailor content exactly to the client's best-fit quality when the required layer is not stored. Inserting a transcoder in the server-client path introduces new challenges in deciding the layering structure (number of layers, bandwidth per layer) of a video. The optimal layering structure should be decided based on factors like total I/O bandwidth penalty incurred due to layering and transcoding effort required to service the "non-layered" versions. The solution to this problem is further complicated by practical issues like diverse popularity of video objects and resource availability. Another issue that we address in this paper is reducing WAN bandwidth penalty incurred due to transport and coding overhead inherent to scalable coding. This particular problem applies to all schemes that use layered encoding to broadcast video. We map the above mentioned problems onto a 0-1 multiple choice knapsack structure and propose an algorithm to find a near-optimal solution. The uniqueness of our approach not only lies in the streaming model but also in the integrated manner in which we address a variety of issues put forth by layered coding.
{"title":"Techniques for efficient stream of layered video in heterogeneous client environments","authors":"A. Raghuveer, Nam-Oh Kang, D. Du","doi":"10.1109/GLOCOM.2005.1577627","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577627","url":null,"abstract":"Universal multimedia access (UMA) refers to accessing multimedia content over a wide range of client terminals and network capacities. Scalable coding is a very popular technique to enable UMA for video. Overhead introduced by the scalable coding approach limits the number of layers that can be stored for each video. Therefore some clients may be served the closest available quality than the best-fit quality. This is a major drawback of scalable coding from the end-user perspective. We propose to employ transcoding to tailor content exactly to the client's best-fit quality when the required layer is not stored. Inserting a transcoder in the server-client path introduces new challenges in deciding the layering structure (number of layers, bandwidth per layer) of a video. The optimal layering structure should be decided based on factors like total I/O bandwidth penalty incurred due to layering and transcoding effort required to service the \"non-layered\" versions. The solution to this problem is further complicated by practical issues like diverse popularity of video objects and resource availability. Another issue that we address in this paper is reducing WAN bandwidth penalty incurred due to transport and coding overhead inherent to scalable coding. This particular problem applies to all schemes that use layered encoding to broadcast video. We map the above mentioned problems onto a 0-1 multiple choice knapsack structure and propose an algorithm to find a near-optimal solution. The uniqueness of our approach not only lies in the streaming model but also in the integrated manner in which we address a variety of issues put forth by layered coding.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133013336","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578223
K. Zachariadis, M. Honig, A. Katsaggelos
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. Here we evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We also evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed, and the layers are sequentially decoded. In addition to analyzing a finite number of layers, we evaluate the mean distortion at high signal-to-noise ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding
{"title":"Source fidelity over fading channels: erasure codes versus scalable codes","authors":"K. Zachariadis, M. Honig, A. Katsaggelos","doi":"10.1109/GLOCOM.2005.1578223","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578223","url":null,"abstract":"We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. Here we evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We also evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed, and the layers are sequentially decoded. In addition to analyzing a finite number of layers, we evaluate the mean distortion at high signal-to-noise ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132657520","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578413
C. Tan, D. Palomar, M. Chiang
In wireless cellular networks that are interference-limited, a variety of power control problems can be formulated as nonlinear optimization with a system-wide objective subject to many QoS constraints from individual users. Previous work have been done in the high SIR regime by solving these problems with nonlinear objectives and constraints as geometric programs. However, in the medium to low SIR regime, these problems cannot be transformed into tractable convex optimization problems. This paper makes two contributions: (1) In the low SIR regime, we propose a method with centralized computation to obtain the globally optimal solution by solving a series of geometric programs. (2) While efficient and robust algorithms have been extensively studied for centralized solutions of geometric programs, distributed algorithms have not been investigated before this paper. We present a systematic method of distributed algorithms for power control based on geometric programs in high SIR regime. These two contributions can be readily combined to distributively solve nonlinear power control problems in general SIR regime
{"title":"Solving nonconvex power control problems in wireless networks: low SIR regime and distributed algorithms","authors":"C. Tan, D. Palomar, M. Chiang","doi":"10.1109/GLOCOM.2005.1578413","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578413","url":null,"abstract":"In wireless cellular networks that are interference-limited, a variety of power control problems can be formulated as nonlinear optimization with a system-wide objective subject to many QoS constraints from individual users. Previous work have been done in the high SIR regime by solving these problems with nonlinear objectives and constraints as geometric programs. However, in the medium to low SIR regime, these problems cannot be transformed into tractable convex optimization problems. This paper makes two contributions: (1) In the low SIR regime, we propose a method with centralized computation to obtain the globally optimal solution by solving a series of geometric programs. (2) While efficient and robust algorithms have been extensively studied for centralized solutions of geometric programs, distributed algorithms have not been investigated before this paper. We present a systematic method of distributed algorithms for power control based on geometric programs in high SIR regime. These two contributions can be readily combined to distributively solve nonlinear power control problems in general SIR regime","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133211437","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578049
Lei Feng, W. Namgoong
This paper describes a cyclic prefixed communication structure that is a generalization of both the orthogonal frequency-division multiplexing (OFDM) system and the cyclic prefixed single-carrier (CP-SC) system. By exploiting the fact that a circulant matrix (CM) is also a block circulant matrix (BCM), the proposed generalized cyclic prefixed (GCP) communication system provides an additional degree of freedom that allows trade-offs among peak-to-average power ratio (PAR), bit allocation capability, and frequency diversity. Instead of one large IDFT operation as in the OFDM transmitter, GCP time interleaves multiple smaller sized IDFT operations, so that PAR is correspondingly reduced. By appropriately selecting the block size in the BCM, the PAR value and the number of subcarriers for bit allocation can be chosen regardless of the length of the transmission block. When the block size in BCM is selected to be one or the entire size of the transmission block, the proposed GCP becomes OFDM or CPSC, respectively
{"title":"Generalization of single-carrier and multicarrier cyclic prefixed communication","authors":"Lei Feng, W. Namgoong","doi":"10.1109/GLOCOM.2005.1578049","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578049","url":null,"abstract":"This paper describes a cyclic prefixed communication structure that is a generalization of both the orthogonal frequency-division multiplexing (OFDM) system and the cyclic prefixed single-carrier (CP-SC) system. By exploiting the fact that a circulant matrix (CM) is also a block circulant matrix (BCM), the proposed generalized cyclic prefixed (GCP) communication system provides an additional degree of freedom that allows trade-offs among peak-to-average power ratio (PAR), bit allocation capability, and frequency diversity. Instead of one large IDFT operation as in the OFDM transmitter, GCP time interleaves multiple smaller sized IDFT operations, so that PAR is correspondingly reduced. By appropriately selecting the block size in the BCM, the PAR value and the number of subcarriers for bit allocation can be chosen regardless of the length of the transmission block. When the block size in BCM is selected to be one or the entire size of the transmission block, the proposed GCP becomes OFDM or CPSC, respectively","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128778377","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578333
O. Abu-Sharkh, A. Tewfik
In IEEE 802.11 WLANs, stations can operate at different data rates. For example, in 802.11b, wireless stations transmit at four date rates 11, 5.5, 2 and 1 Mbps. A station changes its modulation type and transmits at a lower rate when it faces signal fading and interference. In this paper we introduce a model to capture the capability of the standard to operate at different data rates under both, finite load and saturation conditions. Many improvements are also made in order to make the model more consistent with the standard than existing models. The proposed analysis applies to both the basic access and the RTS/CTS access mechanisms. The results we obtained from the model also show the performance anomaly of the standard when it operates at different data rates that were previously observed in the literature, our experiments and simulation. We use the model to study a scheme we proposed earlier to avoid the degradation in the performance by changing the frame sizes of the stations according to their speeds. Throughput performance evaluation is provided and an analytical expression for average service time is given. Experiments were performed to validate the model
{"title":"Multi-rate 802.11 WLANs","authors":"O. Abu-Sharkh, A. Tewfik","doi":"10.1109/GLOCOM.2005.1578333","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578333","url":null,"abstract":"In IEEE 802.11 WLANs, stations can operate at different data rates. For example, in 802.11b, wireless stations transmit at four date rates 11, 5.5, 2 and 1 Mbps. A station changes its modulation type and transmits at a lower rate when it faces signal fading and interference. In this paper we introduce a model to capture the capability of the standard to operate at different data rates under both, finite load and saturation conditions. Many improvements are also made in order to make the model more consistent with the standard than existing models. The proposed analysis applies to both the basic access and the RTS/CTS access mechanisms. The results we obtained from the model also show the performance anomaly of the standard when it operates at different data rates that were previously observed in the literature, our experiments and simulation. We use the model to study a scheme we proposed earlier to avoid the degradation in the performance by changing the frame sizes of the stations according to their speeds. Throughput performance evaluation is provided and an analytical expression for average service time is given. Experiments were performed to validate the model","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126486741","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577877
M. H. Dahshan, P. Verma
This paper presents a hybrid integration approach for heterogeneous heavy tailed traffic from multiple classes over a channel of known capacity, where the service times follow lognormal distribution. Using our hybrid integration approach, we formulate a procedure that can minimize delay while improving the channel utilization. We show that this approach yields lower delays than either the integrated or segregated approach described in published literature.
{"title":"Performance enhancement of heavy tailed queueing systems using a hybrid integration approach","authors":"M. H. Dahshan, P. Verma","doi":"10.1109/GLOCOM.2005.1577877","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577877","url":null,"abstract":"This paper presents a hybrid integration approach for heterogeneous heavy tailed traffic from multiple classes over a channel of known capacity, where the service times follow lognormal distribution. Using our hybrid integration approach, we formulate a procedure that can minimize delay while improving the channel utilization. We show that this approach yields lower delays than either the integrated or segregated approach described in published literature.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125314802","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577900
Kaibin Huang, J. Andrews
New unified linear preceding and decoding techniques are presented in this paper, which are suitable for block transmission systems such as orthogonal frequency division multiplexing (OFDM) systems, synchronous code division multiple access (CDMA) systems, single carrier systems and multiple-input-multiple-output (MIMO) systems. First, a linear precoder that achieves minimum symbol-error-rate (MSER) is proposed and analyzed. Motivated by the fact that the conventional and the MSER precoders achieve a diversity order of one, a new method of applying linear preceding over subchannels, named multichannel precoding (MP), is developed to exploit the diversity gain. It is shown that even if a suboptimal linear decoder is used, MP improves the SER performance significantly. Given the block and linear nature of the linearly preceded system, lattice decoding is a suitable and efficient method for optimally detecting data symbols. Some analytical results are presented for the linearly preceded system with lattice decoding. The SER performance of different linearly preceded systems are also compared numerically.
{"title":"Unified linear precoding for minimum SER","authors":"Kaibin Huang, J. Andrews","doi":"10.1109/GLOCOM.2005.1577900","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577900","url":null,"abstract":"New unified linear preceding and decoding techniques are presented in this paper, which are suitable for block transmission systems such as orthogonal frequency division multiplexing (OFDM) systems, synchronous code division multiple access (CDMA) systems, single carrier systems and multiple-input-multiple-output (MIMO) systems. First, a linear precoder that achieves minimum symbol-error-rate (MSER) is proposed and analyzed. Motivated by the fact that the conventional and the MSER precoders achieve a diversity order of one, a new method of applying linear preceding over subchannels, named multichannel precoding (MP), is developed to exploit the diversity gain. It is shown that even if a suboptimal linear decoder is used, MP improves the SER performance significantly. Given the block and linear nature of the linearly preceded system, lattice decoding is a suitable and efficient method for optimally detecting data symbols. Some analytical results are presented for the linearly preceded system with lattice decoding. The SER performance of different linearly preceded systems are also compared numerically.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122674528","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
扫码关注我们
求助内容：
应助结果提醒方式：