Pub Date : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348188
Yalan Ye, Zhi-Lin Zhang, Quanyi Mo, Jiazhi Zeng
Independent component analysis (ICA), blind source separation (BSS) and related methods like blind source extraction (BSE) are all the promising unsupervised neural network technique for analysis of biomedical signals, especially for ECG, EEG and fMRI data. However, most of source extraction algorithms based on ICA neural network are not suitable to extract the desired signal since these algorithms are not to obtain the desired signal as the first output signal. In this paper, we propose an algorithm based on ICA neural network that can extract a desired source signal as the first output signal with a given kurtosis range. Because of adopting a robust objective function, the algorithm becomes very robust to outliers and spiky noise. Simulations on artificially generated data and real-world ECG data have shown that the algorithm can achieve satisfying results.
{"title":"A Robust Extraction Algorithm Based on ICA Neural Network","authors":"Yalan Ye, Zhi-Lin Zhang, Quanyi Mo, Jiazhi Zeng","doi":"10.1109/ICCCAS.2007.4348188","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348188","url":null,"abstract":"Independent component analysis (ICA), blind source separation (BSS) and related methods like blind source extraction (BSE) are all the promising unsupervised neural network technique for analysis of biomedical signals, especially for ECG, EEG and fMRI data. However, most of source extraction algorithms based on ICA neural network are not suitable to extract the desired signal since these algorithms are not to obtain the desired signal as the first output signal. In this paper, we propose an algorithm based on ICA neural network that can extract a desired source signal as the first output signal with a given kurtosis range. Because of adopting a robust objective function, the algorithm becomes very robust to outliers and spiky noise. Simulations on artificially generated data and real-world ECG data have shown that the algorithm can achieve satisfying results.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130120535","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6247587
S. Che, Jianzhong Huang, B. Bai, Xinmei Wang
In this paper, we investigate the design and optimization of low-density parity-check (LDPC) coded bit interleaved orthogonal modulation systems with non-coherent detection over flat Rayleigh fading channels. We show that, two different EXIT chart analysis aspects can be done for this system, but the conventional approach cannot be used to optimize the system. With the aid of our designed EXIT chart analysis scheme and the linear programming method, the degree distribution for the variable nodes of the adopted LDPC code is optimized. The EXIT chart analyses show that, after optimization, the performance of the designed system is very close to channel capacity, i.e. the gap between them is only about 0.1 dB, which is much closer than those proposed in the existing literatures. Simulation results are also presented with different code lengths, indicating that the performance of the proposed system can approach that predicted by EXIT chart analysis as the code length becomes infinite.
{"title":"LDPC coded bit interleaved orthogonal modulation with non-coherent detection","authors":"S. Che, Jianzhong Huang, B. Bai, Xinmei Wang","doi":"10.1109/ICCCAS.2007.6247587","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6247587","url":null,"abstract":"In this paper, we investigate the design and optimization of low-density parity-check (LDPC) coded bit interleaved orthogonal modulation systems with non-coherent detection over flat Rayleigh fading channels. We show that, two different EXIT chart analysis aspects can be done for this system, but the conventional approach cannot be used to optimize the system. With the aid of our designed EXIT chart analysis scheme and the linear programming method, the degree distribution for the variable nodes of the adopted LDPC code is optimized. The EXIT chart analyses show that, after optimization, the performance of the designed system is very close to channel capacity, i.e. the gap between them is only about 0.1 dB, which is much closer than those proposed in the existing literatures. Simulation results are also presented with different code lengths, indicating that the performance of the proposed system can approach that predicted by EXIT chart analysis as the code length becomes infinite.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128914298","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348198
Lei Wu, Lei Peng
This paper proposes a dynamic immune algorithm used for data clustering analysis. Its immune mechanism, partially inspired by self-organized mapping theory, is introduced to adjust the antibody's quantity and improve clustering quality. In order to guarantee clustering quality for highly non-linear distributed inputs, kernel method is adopted to increase the clustering quality. In order to enhance direct descriptions about the clustering's center and result in input space, a new distance dimension instead of Euclidean distance is introduced by adopting kernel substitution method while the training procedure is still running in input space. Simulation results are also provided to verify the algorithm's feasibility, clustering performance and anti-noise capability.
{"title":"A Dynamic Immune Algorithm with Immune Network for Data Clustering","authors":"Lei Wu, Lei Peng","doi":"10.1109/ICCCAS.2007.4348198","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348198","url":null,"abstract":"This paper proposes a dynamic immune algorithm used for data clustering analysis. Its immune mechanism, partially inspired by self-organized mapping theory, is introduced to adjust the antibody's quantity and improve clustering quality. In order to guarantee clustering quality for highly non-linear distributed inputs, kernel method is adopted to increase the clustering quality. In order to enhance direct descriptions about the clustering's center and result in input space, a new distance dimension instead of Euclidean distance is introduced by adopting kernel substitution method while the training procedure is still running in input space. Simulation results are also provided to verify the algorithm's feasibility, clustering performance and anti-noise capability.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125652498","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348132
Lian Ke, Wang Houjun
Singularities and irregular structures typically characterize the content of signals. The Lipschitz Exponent (LE) is the most popular measure of the singularity behavior of a signal. Most of the existing methods of measuring LE using wavelet transform are derived from the previous work of Mallat and Hwang in [1], which equals LE to the maximum slope of straight lines that remain above the wavelet transform modulus maxima (WTMM) curve in the log-log plot of scale s versus WTMM. However this method is not always robust and precise especially in noise environment, because it is only the particular case of the inequation (25) in [1]. In this paper we adopt a new area-based objective function. Based on it, we choice the slope of the line, which minimize the objective function, as the value of LE from all the lines satisfying the inequation (25) in [1]. The results of experiment demonstrate that this method is more precise and robust.
{"title":"A Novel Wavelet Transform Modulus Maxima Based Method of Measuring Lipschitz Exponent","authors":"Lian Ke, Wang Houjun","doi":"10.1109/ICCCAS.2007.4348132","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348132","url":null,"abstract":"Singularities and irregular structures typically characterize the content of signals. The Lipschitz Exponent (LE) is the most popular measure of the singularity behavior of a signal. Most of the existing methods of measuring LE using wavelet transform are derived from the previous work of Mallat and Hwang in [1], which equals LE to the maximum slope of straight lines that remain above the wavelet transform modulus maxima (WTMM) curve in the log-log plot of scale s versus WTMM. However this method is not always robust and precise especially in noise environment, because it is only the particular case of the inequation (25) in [1]. In this paper we adopt a new area-based objective function. Based on it, we choice the slope of the line, which minimize the objective function, as the value of LE from all the lines satisfying the inequation (25) in [1]. The results of experiment demonstrate that this method is more precise and robust.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130202082","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6250854
Bailong Xiao, Wei Guo, Jun Liu, Silu Zhu
Many routing algorithms, proposed for ad hoc wireless networks, are based on source routing scheme. In routing protocols that use flooding, many routing messages are propagated unnecessarily. Gossiping can be used to significantly reduce the number of routing messages sent. When a route is broken, route recovery and maintenance are executed. However, these procedures consume many resources. With a reactive routing protocol, this leads to increased delay and routing overheads while route repair procedures are carried out. To minimize route breaking, it's important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dense ad hoc wireless networks, and it's due to the edge effect. In this paper, we derive the statistic results of link and path availability properties in ad hoc network, and propose a pseudo gossip routing algorithm based on the link stability. This routing algorithm can select a reliable path that can last longer by using fewer routing messages as to be shown by the simulation results.
{"title":"A pseudo gossip routing algorithm in mobile ad hoc networks","authors":"Bailong Xiao, Wei Guo, Jun Liu, Silu Zhu","doi":"10.1109/ICCCAS.2007.6250854","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6250854","url":null,"abstract":"Many routing algorithms, proposed for ad hoc wireless networks, are based on source routing scheme. In routing protocols that use flooding, many routing messages are propagated unnecessarily. Gossiping can be used to significantly reduce the number of routing messages sent. When a route is broken, route recovery and maintenance are executed. However, these procedures consume many resources. With a reactive routing protocol, this leads to increased delay and routing overheads while route repair procedures are carried out. To minimize route breaking, it's important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dense ad hoc wireless networks, and it's due to the edge effect. In this paper, we derive the statistic results of link and path availability properties in ad hoc network, and propose a pseudo gossip routing algorithm based on the link stability. This routing algorithm can select a reliable path that can last longer by using fewer routing messages as to be shown by the simulation results.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130742359","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6247576
Xu Zhao
Continuous phase modulation (CPM) is an attractive technique for digital communication, with the development of the trellis coded modulation (TCM), the combination of TCM and CPM is largely applied to improve the performance of MCPM. However, the combination of TCM and CPM cannot utilize unattached differential encoding simply to solve the problem that phase offset caused. As a result, a rotational-invariance system of TCM_CPM is needed to solve the problem. This paper based on the Corneliu Eugen D.Sterian's design of the rotational-invariance TCM_QPSK (QPSK: quad phase shift keying) and TCM_QAM (QAM: quadrature amplitude modulation am), considered the characteristic of CPM, and made a rotational-invariance code design for the system of TCM_CPM, which ensure the system invariant to rotations of the signal constellation by symmetry angles. We did the simulation of rotational-invariance system of 32 states 8CPM and 4CPM TCM_CPM, with pi/4 rotational-invariance.
连续相位调制(CPM)是一种极具吸引力的数字通信技术，随着栅格编码调制(TCM)技术的发展，连续相位调制与栅格编码调制的结合被广泛应用于提高连续相位调制的性能。然而，TCM和CPM的结合不能简单地利用无附加差分编码来解决相位偏移带来的问题。因此，需要一个TCM_CPM的旋转不变系统来解决这个问题。本文在Corneliu Eugen D.Sterian旋转不变性TCM_QPSK (QPSK:四相移键控)和TCM_QAM (QAM:正交调幅)设计的基础上，考虑到CPM的特性，对TCM_CPM系统进行了旋转不变性编码设计，保证了系统对信号星座对称角旋转的不变性。对具有pi/4旋转不变性的32种状态8CPM和4CPM TCM_CPM的旋转不变性系统进行了仿真。
{"title":"Rotational-invariance code design for the system of TCM_CPM","authors":"Xu Zhao","doi":"10.1109/ICCCAS.2007.6247576","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6247576","url":null,"abstract":"Continuous phase modulation (CPM) is an attractive technique for digital communication, with the development of the trellis coded modulation (TCM), the combination of TCM and CPM is largely applied to improve the performance of MCPM. However, the combination of TCM and CPM cannot utilize unattached differential encoding simply to solve the problem that phase offset caused. As a result, a rotational-invariance system of TCM_CPM is needed to solve the problem. This paper based on the Corneliu Eugen D.Sterian's design of the rotational-invariance TCM_QPSK (QPSK: quad phase shift keying) and TCM_QAM (QAM: quadrature amplitude modulation am), considered the characteristic of CPM, and made a rotational-invariance code design for the system of TCM_CPM, which ensure the system invariant to rotations of the signal constellation by symmetry angles. We did the simulation of rotational-invariance system of 32 states 8CPM and 4CPM TCM_CPM, with pi/4 rotational-invariance.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130936298","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6251632
Yao-Tang Chang, Jen-Fa Huang, K. Hsu, Li-Wei Chou
Exploiting the inherent cyclic and periodic free-spectral-range (FSR) properties of arrayed-waveguide-grating (AWG) routers, the time-spreading and free-spectral-range (FSR) group hopping code, which embedded maximum length sequence (i.e., called TS/GH embedded M-sequence code) is configured over fiber-to-the-home (FTTH) network. In this study, the proposed codeword, which integrated time and spectral (wavelength) domain, is constructed as the same prime code sequence and therefore is referred as two-dimension (2-D) optical codes. Importantly, for the proposed broadband light source (BLS), the total number of available wavelengths is partitioned into the different groups G based on the M-sequence code length. Every group is referred as hopping pattern and characterized by the FSR interval of AWG router. To improve the prime-hop code (PHC) and modified prime-hop code (MPHC) of 2-D OCDMA system with cascading one additional AWG router, the cardinality of proposed scheme is significantly increased by the factor of 15 times under the optimum arrangement for group hopping number of G=l. Moreover, the correlation property and bit error rate (BER) of proposed scheme is evaluated and the result reveals that the BER of proposed scheme is better than MPHC and PHC.
{"title":"Time-spreading and wavelength-group-hopping codes implemented over fiber-to-the-home networks","authors":"Yao-Tang Chang, Jen-Fa Huang, K. Hsu, Li-Wei Chou","doi":"10.1109/ICCCAS.2007.6251632","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6251632","url":null,"abstract":"Exploiting the inherent cyclic and periodic free-spectral-range (FSR) properties of arrayed-waveguide-grating (AWG) routers, the time-spreading and free-spectral-range (FSR) group hopping code, which embedded maximum length sequence (i.e., called TS/GH embedded M-sequence code) is configured over fiber-to-the-home (FTTH) network. In this study, the proposed codeword, which integrated time and spectral (wavelength) domain, is constructed as the same prime code sequence and therefore is referred as two-dimension (2-D) optical codes. Importantly, for the proposed broadband light source (BLS), the total number of available wavelengths is partitioned into the different groups G based on the M-sequence code length. Every group is referred as hopping pattern and characterized by the FSR interval of AWG router. To improve the prime-hop code (PHC) and modified prime-hop code (MPHC) of 2-D OCDMA system with cascading one additional AWG router, the cardinality of proposed scheme is significantly increased by the factor of 15 times under the optimum arrangement for group hopping number of G=l. Moreover, the correlation property and bit error rate (BER) of proposed scheme is evaluated and the result reveals that the BER of proposed scheme is better than MPHC and PHC.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251382","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348229
Chorng-Sii Hwang, Chih-Wei Sung, H. Tsao
In this paper, the new architecture of a high-speed continuous time digitizer has been proposed. With the aid of a two-level multiphase sampling technique, the time digitizer can use only 16 delay cells and DFFs to perform the flash-type conversion of 64-stage interpolation. The time digitizer can obtain 78 ps resolution with a reference frequency running at 200 MHz. The continuous input clock frequency can be up to 250 MHz. The layout area occupies 1.08 mm2. A novel clock multiplier is also introduced to provide multiphase generation with frequency output range within 640 MHz ~1.8 GHz.
{"title":"High-Speed Continuous Time Digitizer Using a Two-Level Multiphase Sampling Technique","authors":"Chorng-Sii Hwang, Chih-Wei Sung, H. Tsao","doi":"10.1109/ICCCAS.2007.4348229","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348229","url":null,"abstract":"In this paper, the new architecture of a high-speed continuous time digitizer has been proposed. With the aid of a two-level multiphase sampling technique, the time digitizer can use only 16 delay cells and DFFs to perform the flash-type conversion of 64-stage interpolation. The time digitizer can obtain 78 ps resolution with a reference frequency running at 200 MHz. The continuous input clock frequency can be up to 250 MHz. The layout area occupies 1.08 mm2. A novel clock multiplier is also introduced to provide multiphase generation with frequency output range within 640 MHz ~1.8 GHz.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125540645","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6250849
Ye Ning, Shao Jie, W. Ru-chuan, Wang Zhi-li
Energy efficiency is a very important criterion for the wireless sensor networks. The technology of data aggregation can be adopted to decrease the power costs of redundancy information and delay time. In this paper, we proposed an optimization data aggregation routing algorithm based on ant colony schema (ACAR) using agent collaboration and migration for wireless sensor networks. A number of ant-like mobile agents traverse the wireless sensor network in search of data aggregation paths between given source-destination node pairs while seeking to fulfill a set of requirements (the path objective) provided by the owner/producer of the agents. Our simulation results show that our algorithms perform well in energy efficient compared with directed diffusion protocol.
{"title":"An ant-like agent based data aggregation routing scheme in wireless sensor networks","authors":"Ye Ning, Shao Jie, W. Ru-chuan, Wang Zhi-li","doi":"10.1109/ICCCAS.2007.6250849","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6250849","url":null,"abstract":"Energy efficiency is a very important criterion for the wireless sensor networks. The technology of data aggregation can be adopted to decrease the power costs of redundancy information and delay time. In this paper, we proposed an optimization data aggregation routing algorithm based on ant colony schema (ACAR) using agent collaboration and migration for wireless sensor networks. A number of ant-like mobile agents traverse the wireless sensor network in search of data aggregation paths between given source-destination node pairs while seeking to fulfill a set of requirements (the path objective) provided by the owner/producer of the agents. Our simulation results show that our algorithms perform well in energy efficient compared with directed diffusion protocol.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123281574","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6247592
Haiyang Huang, Shaoqian Li
This paper proposes a novel method to reduce the peak-to-average power ratio (PAPR) of multicarrier signals in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems by jointly frequency-block operations. Our design improves the performance and framework flexibility (compatible with both space-time and space-frequency patterns) of PAPR reduction in MIMO-OFDM system, which utilizes additional degrees of frequency freedom. Especially, this proposed design can be freely combined with many good-featured space-time or space-frequency coding to achieve better whole system performance, which is unlike the previous typical methods strictly based on space-time block coding structure with relative low data rate. Simulation results show that the good performance is achieved by our novel design.
{"title":"An efficient PAPR reduction method in MIMO-OFDM systems by jointly frequency-block operations","authors":"Haiyang Huang, Shaoqian Li","doi":"10.1109/ICCCAS.2007.6247592","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6247592","url":null,"abstract":"This paper proposes a novel method to reduce the peak-to-average power ratio (PAPR) of multicarrier signals in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems by jointly frequency-block operations. Our design improves the performance and framework flexibility (compatible with both space-time and space-frequency patterns) of PAPR reduction in MIMO-OFDM system, which utilizes additional degrees of frequency freedom. Especially, this proposed design can be freely combined with many good-featured space-time or space-frequency coding to achieve better whole system performance, which is unlike the previous typical methods strictly based on space-time block coding structure with relative low data rate. Simulation results show that the good performance is achieved by our novel design.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126381268","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
扫码关注我们
求助内容：
应助结果提醒方式：