Pub Date : 2009-12-04DOI: 10.1109/IWSDA.2009.5346418
Fang Liu, D. Peng, Xiaohu Tang, Xianhua Niu
For odd prime p, two new p-ary sequence families with period pn−1 are constructed for odd n=2l+1=me and even n=2l=me respectively. It is shown that, for a given integer ρ, the proposed sequence families have maximum correlation 1+pn/2+(ρ−1)e+1, family size (pn−1)pnρ/2, and maximum linear span n(n+3).
{"title":"New p-ary sequences with low correlation and large family size","authors":"Fang Liu, D. Peng, Xiaohu Tang, Xianhua Niu","doi":"10.1109/IWSDA.2009.5346418","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346418","url":null,"abstract":"For odd prime p, two new p-ary sequence families with period p<sup>n</sup>−1 are constructed for odd n=2l+1=me and even n=2l=me respectively. It is shown that, for a given integer ρ, the proposed sequence families have maximum correlation 1+p<sup>n/2+(ρ−1)e+1</sup>, family size (p<sup>n</sup>−1)p<sup>nρ</sup>/2, and maximum linear span n(n+3).","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133381884","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346444
T. Yan, Yuansheng Tang, Ming Chen
For the decoding of a binary block code of Hamming distance of d over AWGN channels, a soft-decision decoder is said to achieve bounded-distance (BD) decoding if its squared error-correction radius is equal to d. A Chase-3-like algorithm outputs the best (most likely) codeword in a list of candidates generated by a conventional algebraic binary decoder whose input sequences have nonzero entries confined in the most unreliable positions. Let η(d) denote the smallest size of input sequence sets of Chase-3-like algorithms which achieve BD decoding. In this paper, we show that there are positive numbers C1 and C2 such that C1 ≤ η(d)d−1/2 ≤ C2 for sufficiently large d.
{"title":"Chase-3-like algorithms achieving bounded-distance decoding","authors":"T. Yan, Yuansheng Tang, Ming Chen","doi":"10.1109/IWSDA.2009.5346444","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346444","url":null,"abstract":"For the decoding of a binary block code of Hamming distance of d over AWGN channels, a soft-decision decoder is said to achieve bounded-distance (BD) decoding if its squared error-correction radius is equal to d. A Chase-3-like algorithm outputs the best (most likely) codeword in a list of candidates generated by a conventional algebraic binary decoder whose input sequences have nonzero entries confined in the most unreliable positions. Let η(d) denote the smallest size of input sequence sets of Chase-3-like algorithms which achieve BD decoding. In this paper, we show that there are positive numbers C<inf>1</inf> and C<inf>2</inf> such that C<inf>1</inf> ≤ η(d)d<sup>−1/2</sup> ≤ C<inf>2</inf> for sufficiently large d.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124629925","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346419
Dianhua Wu, P. Fan, Xun Wang, Minquan Cheng
Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, it is proved that for each prime v ≡ 1 (mod 24), there exists a (v, {3, 4}, 1, {2/3, 1/3})-OOC.
{"title":"A new class of optimal variable-weight OOCs based on cyclic difference families","authors":"Dianhua Wu, P. Fan, Xun Wang, Minquan Cheng","doi":"10.1109/IWSDA.2009.5346419","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346419","url":null,"abstract":"Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, it is proved that for each prime v ≡ 1 (mod 24), there exists a (v, {3, 4}, 1, {2/3, 1/3})-OOC.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127558452","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346434
Yanan Huang, X. Fang, Yue Zhao
Being a new feature of next generation of wireless networks, MMR (Mobile Multi-hop Relay) is proposed for the purpose of coverage extension and throughput enhancement in IMT-Advanced, IEEE 802.16j/m. Besides, with the help of relay, the system energy consumption could be well saved. In this paper, an energy saving scheduling scheme is proposed for OFDMA based two-hop relay systems. The novel scheme adjusts the modulation and coding (MC) mode and allocates the transmitting power dynamically according to the resource usage. It can also guarantee the QoS of different services by setting the scheduling priority. The simulation results show that the novel scheduling scheme can not only save system energy but also achieve higher throughput.
{"title":"An energy saving scheduling scheme for OFDMA two-hop relay systems","authors":"Yanan Huang, X. Fang, Yue Zhao","doi":"10.1109/IWSDA.2009.5346434","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346434","url":null,"abstract":"Being a new feature of next generation of wireless networks, MMR (Mobile Multi-hop Relay) is proposed for the purpose of coverage extension and throughput enhancement in IMT-Advanced, IEEE 802.16j/m. Besides, with the help of relay, the system energy consumption could be well saved. In this paper, an energy saving scheduling scheme is proposed for OFDMA based two-hop relay systems. The novel scheme adjusts the modulation and coding (MC) mode and allocates the transmitting power dynamically according to the resource usage. It can also guarantee the QoS of different services by setting the scheduling priority. The simulation results show that the novel scheduling scheme can not only save system energy but also achieve higher throughput.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125843759","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346410
Y. Horii, T. Kojima
Digital watermarking technologies with spread spectrum (SS) sequences have been previously proposed. The sequences used in previous studies, however, do not necessarily have good correlation properties. It is known that complete complementary codes have ideal correlation properties and very effective for mobile communication systems like CDMA. In this paper, it is shown that correlation properties of sequences play very important roles in detecting the embedded secret information from the watermarked images. In addition, we propose a method to embed multiple secret data simultaneously into a single image.
{"title":"On digital watermarks based on complete complementary codes","authors":"Y. Horii, T. Kojima","doi":"10.1109/IWSDA.2009.5346410","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346410","url":null,"abstract":"Digital watermarking technologies with spread spectrum (SS) sequences have been previously proposed. The sequences used in previous studies, however, do not necessarily have good correlation properties. It is known that complete complementary codes have ideal correlation properties and very effective for mobile communication systems like CDMA. In this paper, it is shown that correlation properties of sequences play very important roles in detecting the embedded secret information from the watermarked images. In addition, we propose a method to embed multiple secret data simultaneously into a single image.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127357239","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 : 2009-10-01DOI: 10.1109/iwsda.2009.5346429
F. Adachi
Broadband wireless technology which allows higher-than-1Gbps data transmission with extremely low transmit power may be necessary in future wireless communication systems. The wireless channel for such broadband transmissions is severely frequency-selective. Frequency-domain wireless signal processing may play an important role in achieving a good signal transmission performance. The multi-carrier (MC) multi-access technique, including OFDMA and MC-CDMA, has been gaining popularity. Meanwhile, it has been shown that the use of frequency-domain equalization (FDE) based on minimum mean square error (MMSE) criterion improves the transmission performance of single-carrier (SC) multi-access, including DS-CDMA. This suggests that either SC- or MC-based multi-access technique with FDE can be used. Unfortunately, the available wireless bandwidth is limited while a higher-than-1Gbps transmission is demanded. Particular attention has been paid to multi-input/multi-output (MIMO) multiplexing (SDM) to significantly increase the throughput without expanding the signal bandwidth. Besides the broadband wireless signal processing, another practically important issue exists, which is a significant reduction of transmit power. Applying wireless multi-hop technique or distributed antenna technique is a possible solution to this issue. In this talk, we will overview the state-of-the-art broadband wireless technology.
{"title":"Wireless challenge","authors":"F. Adachi","doi":"10.1109/iwsda.2009.5346429","DOIUrl":"https://doi.org/10.1109/iwsda.2009.5346429","url":null,"abstract":"Broadband wireless technology which allows higher-than-1Gbps data transmission with extremely low transmit power may be necessary in future wireless communication systems. The wireless channel for such broadband transmissions is severely frequency-selective. Frequency-domain wireless signal processing may play an important role in achieving a good signal transmission performance. The multi-carrier (MC) multi-access technique, including OFDMA and MC-CDMA, has been gaining popularity. Meanwhile, it has been shown that the use of frequency-domain equalization (FDE) based on minimum mean square error (MMSE) criterion improves the transmission performance of single-carrier (SC) multi-access, including DS-CDMA. This suggests that either SC- or MC-based multi-access technique with FDE can be used. Unfortunately, the available wireless bandwidth is limited while a higher-than-1Gbps transmission is demanded. Particular attention has been paid to multi-input/multi-output (MIMO) multiplexing (SDM) to significantly increase the throughput without expanding the signal bandwidth. Besides the broadband wireless signal processing, another practically important issue exists, which is a significant reduction of transmit power. Applying wireless multi-hop technique or distributed antenna technique is a possible solution to this issue. In this talk, we will overview the state-of-the-art broadband wireless technology.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127484395","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 : 1900-01-01DOI: 10.1109/iwsda.2009.5346404
Junru Zheng, T. Kaida
The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT.
{"title":"On Boston bound for cyclic codes by DFT with unknown elements","authors":"Junru Zheng, T. Kaida","doi":"10.1109/iwsda.2009.5346404","DOIUrl":"https://doi.org/10.1109/iwsda.2009.5346404","url":null,"abstract":"The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124386273","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
扫码关注我们
求助内容：
应助结果提醒方式：