Pub Date : 2004-09-01DOI: 10.1109/WCNC.2003.1200418
T. Lo
In this paper, a simple adaptive transmit diversity technique with side information is presented. The proposed scheme has a number of attractive characteristics. First, it is simple to implement. Second, it is efficient in terms of bandwidth requirements for side information feedback. Finally, it adapts to the availability and quality of the side information to accordingly configure the space-time signal set to be transmitted so that the gain in signal-to-noise ratio (SNR) can be optimized at the receiver. In effect, it can be viewed as a flexible combination of suboptimal beamforming and space-time block coding (STBC).
{"title":"Adaptive space-time transmission with side information","authors":"T. Lo","doi":"10.1109/WCNC.2003.1200418","DOIUrl":"https://doi.org/10.1109/WCNC.2003.1200418","url":null,"abstract":"In this paper, a simple adaptive transmit diversity technique with side information is presented. The proposed scheme has a number of attractive characteristics. First, it is simple to implement. Second, it is efficient in terms of bandwidth requirements for side information feedback. Finally, it adapts to the availability and quality of the side information to accordingly configure the space-time signal set to be transmitted so that the gain in signal-to-noise ratio (SNR) can be optimized at the receiver. In effect, it can be viewed as a flexible combination of suboptimal beamforming and space-time block coding (STBC).","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"58 1","pages":"601-606 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2004-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83192215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-01DOI: 10.1109/WCNC.2003.1200597
Meng Zhang, C. Lea
We show in the paper that mobility and capacity can be viewed as equals, and develop an analytical model to study the conversion process between the two. The goal of the study is to design a network with a free convertibility between mobility and capacity. Such a network can support more users because whenever user mobility drops, it can convert that change into a capacity gain.
{"title":"On the mobility/capacity conversion in wireless networks","authors":"Meng Zhang, C. Lea","doi":"10.1109/WCNC.2003.1200597","DOIUrl":"https://doi.org/10.1109/WCNC.2003.1200597","url":null,"abstract":"We show in the paper that mobility and capacity can be viewed as equals, and develop an analytical model to study the conversion process between the two. The goal of the study is to design a network with a free convertibility between mobility and capacity. Such a network can support more users because whenever user mobility drops, it can convert that change into a capacity gain.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"19 1","pages":"1433-1438 vol.3"},"PeriodicalIF":0.0,"publicationDate":"2004-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81506286","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-12-17DOI: 10.1109/ICECS.2003.1301979
A. Gutub
Unusual processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates (x=X/Z, y=Y/Z) to convert GF(2/sup k/) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2/sup k/) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than using fully parallel multipliers with the added advantage of requiring less area. The proposed architecture is a serious contender for implementing data security systems based on elliptic curve cryptography.
提出了一种特殊的椭圆曲线加密处理器结构。该体系结构利用射影坐标(x= x /Z, y= y /Z)将椭圆点运算所需的GF(2/sup k/)除法转换为几个乘法步骤。该处理器有三个GF(2/sup k/)乘法器,使用位级流水线数字串行计算实现。结果表明,这比使用完全并行乘法器的操作速度更快,并且需要更少的面积。所提出的体系结构是实现基于椭圆曲线加密的数据安全系统的有力竞争者。
{"title":"Fast elliptic curve cryptographic processor architecture based on three parallel GF(2/sup k/) bit level pipelined digit serial multipliers","authors":"A. Gutub","doi":"10.1109/ICECS.2003.1301979","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301979","url":null,"abstract":"Unusual processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates (x=X/Z, y=Y/Z) to convert GF(2/sup k/) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2/sup k/) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than using fully parallel multipliers with the added advantage of requiring less area. The proposed architecture is a serious contender for implementing data security systems based on elliptic curve cryptography.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"82 1","pages":"72-75 Vol.1"},"PeriodicalIF":0.0,"publicationDate":"2003-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79064465","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-12-14DOI: 10.1109/ICECS.2003.1301986
H. Al-Otum
In this paper, two VQ algorithms are introduced: (1) VQ with a fast clustering algorithm (VQ-FCA) that can be implemented for codebook production, and (2) VQ with a partially reordered codebook (VQ-PRCB), that extracts the correlation between adjacent VQ indices. Based on these algorithms, two schemes are proposed: (1) 2D VQ, and (2) combined 3D VQ schemes. Experimental results are compared with other algorithms to show its advantages.
{"title":"Color image compression using combined VQ algorithms","authors":"H. Al-Otum","doi":"10.1109/ICECS.2003.1301986","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301986","url":null,"abstract":"In this paper, two VQ algorithms are introduced: (1) VQ with a fast clustering algorithm (VQ-FCA) that can be implemented for codebook production, and (2) VQ with a partially reordered codebook (VQ-PRCB), that extracts the correlation between adjacent VQ indices. Based on these algorithms, two schemes are proposed: (1) 2D VQ, and (2) combined 3D VQ schemes. Experimental results are compared with other algorithms to show its advantages.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"10 1","pages":"100-103 Vol.1"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78701517","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-12-14DOI: 10.1109/ICECS.2003.1301722
Minsik Park, Yong-Ju Lee, J. Choi, Jin-Soo Choi
This paper describes the design and implementation of the data server that provides viewers with data broadcast service to enhance the conventional broadcast service with only audio/video. There are asynchronous, synchronous and synchronized data services according to the timing association with main AN program, but only asynchronous data service is now prevailing in DTV environment. The asynchronous data service is too limited to broadcast the interactive data service such as quiz show, advertisement, polling and bidding. The proposed data server had been designed to encode asynchronous, synchronous and synchronized data elements for a variety of data broadcast services.
{"title":"The design and implementation of data server for data broadcast service","authors":"Minsik Park, Yong-Ju Lee, J. Choi, Jin-Soo Choi","doi":"10.1109/ICECS.2003.1301722","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301722","url":null,"abstract":"This paper describes the design and implementation of the data server that provides viewers with data broadcast service to enhance the conventional broadcast service with only audio/video. There are asynchronous, synchronous and synchronized data services according to the timing association with main AN program, but only asynchronous data service is now prevailing in DTV environment. The asynchronous data service is too limited to broadcast the interactive data service such as quiz show, advertisement, polling and bidding. The proposed data server had been designed to encode asynchronous, synchronous and synchronized data elements for a variety of data broadcast services.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"45 16 1","pages":"1176-1179 Vol.3"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77735896","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-12-14DOI: 10.1109/ICECS.2003.1301816
Muhammad Shafiq, F. Al-Sunni, S. Farooq
A novel technique, using the normalized least mean squares (NLMS) adaptive filter is proposed for adaptive control of the plant dynamics of a nonlinear plant. The nonlinear plant considered belongs to the Hammerstein type of nonlinear system. Stable adaptive controller for a stable discrete time nonlinear plant is designed. The nonlinear plant considered may be non-minimum phase. The controller is composed of an adaptive finite impulse response (FIR) filter in the feedback loop. This adaptive FIR filter is designed online as an L-delay approximate inverse system of the given stable nonlinear plant.
{"title":"Adaptive control of nonlinear Hammerstein model using NLMS filter","authors":"Muhammad Shafiq, F. Al-Sunni, S. Farooq","doi":"10.1109/ICECS.2003.1301816","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301816","url":null,"abstract":"A novel technique, using the normalized least mean squares (NLMS) adaptive filter is proposed for adaptive control of the plant dynamics of a nonlinear plant. The nonlinear plant considered belongs to the Hammerstein type of nonlinear system. Stable adaptive controller for a stable discrete time nonlinear plant is designed. The nonlinear plant considered may be non-minimum phase. The controller is composed of an adaptive finite impulse response (FIR) filter in the feedback loop. This adaptive FIR filter is designed online as an L-delay approximate inverse system of the given stable nonlinear plant.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"29 1","pages":"439-442 Vol.2"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78152015","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-12-14DOI: 10.1109/ICECS.2003.1301978
A. Loza, C. N. Canagarajah, D. Bull
In practical time-frequency (T-F) analysis of nonstationary signals associated with the use of the smooth pseudo Wigner-Ville distribution (SPWV), an important issue is a choice of the smoothing window. To address this problem, a fast sub-optimal technique is proposed, relating the window length to the approximate slope of the frequency modulation. The results obtained by using this automated procedure are comparable to results given by supervised decompositions and are more (locally) adapted. The developed method has been used in processing of radar returns. In order to objectively assess the performance of the transforms, several measures can be used. For signals with unknown modulation laws, cost functions are available, including measures based on entropy function. Their application to evaluation of the obtained T-F distributions is demonstrated.
{"title":"Adaptive SPWV distribution with adjustable volume 2-D separable kernel","authors":"A. Loza, C. N. Canagarajah, D. Bull","doi":"10.1109/ICECS.2003.1301978","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301978","url":null,"abstract":"In practical time-frequency (T-F) analysis of nonstationary signals associated with the use of the smooth pseudo Wigner-Ville distribution (SPWV), an important issue is a choice of the smoothing window. To address this problem, a fast sub-optimal technique is proposed, relating the window length to the approximate slope of the frequency modulation. The results obtained by using this automated procedure are comparable to results given by supervised decompositions and are more (locally) adapted. The developed method has been used in processing of radar returns. In order to objectively assess the performance of the transforms, several measures can be used. For signals with unknown modulation laws, cost functions are available, including measures based on entropy function. Their application to evaluation of the obtained T-F distributions is demonstrated.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"25 1","pages":"68-71 Vol.1"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81910797","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-12-14DOI: 10.1109/ICECS.2003.1301750
Abdul-Wahid A. Saif
In this paper, the weighted sensitivity minimization problem of multivariable linear time-invariant, bi-proper or strictly proper, non-minimum phase systems using a stable controller is considered. The problem is reduced to a linear fractional transformation problem.
{"title":"Weighted sensitivity minimization of MIMO systems with a stable controller: an LFT approach","authors":"Abdul-Wahid A. Saif","doi":"10.1109/ICECS.2003.1301750","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301750","url":null,"abstract":"In this paper, the weighted sensitivity minimization problem of multivariable linear time-invariant, bi-proper or strictly proper, non-minimum phase systems using a stable controller is considered. The problem is reduced to a linear fractional transformation problem.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"46 1","pages":"1288-1291 Vol.3"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85721951","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-12-14DOI: 10.1109/ICECS.2003.1301720
Shun-Wen Cheng
The comparator is a very basic and useful arithmetic component of digital systems. An individual, compact, high-performance, good cost-benefit ratio comparator core plays an important role on almost all hardware sorters. The study proposes a fine cost-performance ratio comparator design. Based on modified 1's complement principle and conditional sum adder scheme, the proposed design has small transistor count and short propagation delay. Post-layout simulations based on TSMC 0.6/spl mu/m 1P3M CMOS process has completed. It shown a 64-b static CMOS comparator of the proposed architecture only needs 1,556 transistors and 4.2ns.
{"title":"A high-speed magnitude comparator with small transistor count","authors":"Shun-Wen Cheng","doi":"10.1109/ICECS.2003.1301720","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1301720","url":null,"abstract":"The comparator is a very basic and useful arithmetic component of digital systems. An individual, compact, high-performance, good cost-benefit ratio comparator core plays an important role on almost all hardware sorters. The study proposes a fine cost-performance ratio comparator design. Based on modified 1's complement principle and conditional sum adder scheme, the proposed design has small transistor count and short propagation delay. Post-layout simulations based on TSMC 0.6/spl mu/m 1P3M CMOS process has completed. It shown a 64-b static CMOS comparator of the proposed architecture only needs 1,556 transistors and 4.2ns.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"21 1","pages":"1168-1171 Vol.3"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86017148","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-12-14DOI: 10.1109/ICECS.2003.1302049
G. Kothapalli
The design and simulation results of a CMOS winner-take-all (WTA) circuit are presented. A 16-cell test circuit has been designed for intended implementation in an 0.18 /spl mu/m CMOS process. This paper describes the architecture and design issues related to a CMOS WTA circuit. Several design issues such as high resolution, high speed, low power consumption, compactness, and high input voltage range have been addressed. The proposed circuit has a compact configuration of complexity O(N) where N denotes input count. It seems to be very suitable, especially for charge-based applications where input vectors are generated by a set of charged capacitances.
{"title":"Compensation of a winner take all circuit","authors":"G. Kothapalli","doi":"10.1109/ICECS.2003.1302049","DOIUrl":"https://doi.org/10.1109/ICECS.2003.1302049","url":null,"abstract":"The design and simulation results of a CMOS winner-take-all (WTA) circuit are presented. A 16-cell test circuit has been designed for intended implementation in an 0.18 /spl mu/m CMOS process. This paper describes the architecture and design issues related to a CMOS WTA circuit. Several design issues such as high resolution, high speed, low power consumption, compactness, and high input voltage range have been addressed. The proposed circuit has a compact configuration of complexity O(N) where N denotes input count. It seems to be very suitable, especially for charge-based applications where input vectors are generated by a set of charged capacitances.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"54 1","pages":"352-355 Vol.1"},"PeriodicalIF":0.0,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81159839","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}