发布求助
文献互助 智能选刊 最新文献

7th International Multi Topic Conference, 2003. INMIC 2003.最新文献

筛选
英文 中文
Reducing peak-to-average power ratio (PAPR) using partial transmit sequence in OFDM systems 利用部分发射序列降低OFDM系统的峰均功率比
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416667
A. Latif, N. Gohar
{"title":"Reducing peak-to-average power ratio (PAPR) using partial transmit sequence in OFDM systems","authors":"A. Latif, N. Gohar","doi":"10.1109/INMIC.2003.1416667","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416667","url":null,"abstract":"OFDM is a multicarrier system supporting high data rate transmission and generally requires no equalization at the receiver, making it simple and efficient. However, a drawback of this system is the large peak-to-average-power ratio (PAPR) of the transmit signal, which makes its straightforward implementation quite costly. There are several techniques to attack this problem, but most of them are suited for specific applications or small numbers of subcarriers. Selected mapping (SLM) is one of these; however, this method becomes inefficient, if the number of subcarriers or the vector-size is large. The partial transmit sequence (PTS) method was proposed as an improved strategy to tackle the problem. In this work, four variants of PTS, in terms of subblock partitioning, are discussed and the results of the implementations are presented.","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750273","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}
引用次数: 10
Message encryption with image processing 带有图像处理的消息加密
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416607
S. Ashar, T. M. Shah, R. Khalid
{"title":"Message encryption with image processing","authors":"S. Ashar, T. M. Shah, R. Khalid","doi":"10.1109/INMIC.2003.1416607","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416607","url":null,"abstract":"The paper proposes a new steganographic model for secret data communication. A stack of four modules is used. The \"compression module\" gives the benefit of entropy coding. The \"cryptographic module\" provides confidentiality in the communication. To preserve integrity of data, the \"hash module\" is used with a shared secret key. A technique is proposed in which it is not required that the receiver should know the secret key before reception of the message. For the \"steganographic module\", an image steganographic method is proposed that is derived from the method of Yeuan-Kuen Lee and Ling-Hwei Chen (see IEEE Proc. Vision, Image and Sig. Process., 2000). As compared to that method, we make little use of the smooth regions of the cover image that provides better image fidelity and perceptual transparency. The proposed method can also hide data in 24 bit true color images. Furthermore, we spread the data on the whole image instead of using part of the image. This steganographic method is used to hide the encrypted communication. Experimental results show the effectiveness and efficiency of the proposed model","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127368518","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}
引用次数: 2
A throughput improvement scheme for asymmetrical digital subscriber line (ADSL) transceivers 非对称数字用户线(ADSL)收发器的吞吐量改进方案
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416670
A. Rashdi, N. Sheikh, S. Abbas
{"title":"A throughput improvement scheme for asymmetrical digital subscriber line (ADSL) transceivers","authors":"A. Rashdi, N. Sheikh, S. Abbas","doi":"10.1109/INMIC.2003.1416670","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416670","url":null,"abstract":"Echo cancellation technique enables full duplex transmission using the same transmission band and thereby increases the aggregate data throughput of a channel. This tutorial paper introduces high speed echo cancellation for Full Rate (ITU-T Recommendation G.992.1) and Splitterless (ITU-T Recommendation G.992.2, aliased G.Lite) ADSL Transceivers. Symmetric and multirate Asymmetric echo cancellation Transceiver structures based completely on time domain or frequency domain as well as both time and frequency domain echo cancellation have been analyzed using different algorithms for performance and computational complexity. Combined Time and Frequency Domain Echo Cancellation (TAFDEC) structure with the so called DMT algorithm appears to be most suitable to achieve lower complexity with better performance as compared to echo cancellation in either time or frequency domain using LMS algorithm","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093669","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}
引用次数: 29
Design and implementation of E1 stream analyzer for CCSS7 protocol 基于CCSS7协议的E1流分析仪的设计与实现
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416618
Akshat Malik, M.M. Ahmed, A. Azhar, O. Khan
{"title":"Design and implementation of E1 stream analyzer for CCSS7 protocol","authors":"Akshat Malik, M.M. Ahmed, A. Azhar, O. Khan","doi":"10.1109/INMIC.2003.1416618","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416618","url":null,"abstract":"The E1 (PCM-30) stream is a European telecommunication standard for communication of data/voice channels in a digital network. This paper deals with the design and implementation of a transparent stream analyzer, capable of handling (up to 2 Mbps) E1 stream and analyzing 30 voice/data channels using an out-of-band common channel signaling system number 7 (CCSS7) protocol. The analyzer is capable of generating an E1 stream and thus can be used for generation, monitoring and blocking of channels. The analyzer can perform analysis and maintenance of E1 (2.048 Mbps) lines. As our analyzer performs the analysis functions in software it is very flexible and can perform many additional features such as algorithms and protocol testing and analysis. The workable synchronous finite state machine (FSM) design of the analyzer is implemented in Verilog and verified on Altera's FLEX10K70 FPGA along with its subsequent interfacing with a PC through an enhanced parallel port","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131025479","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}
引用次数: 0
Constraint based temporal partitioning model for partial reconfigurable architectures 部分可重构体系结构的基于约束的时间划分模型
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416714
K. Jafri, N. Jafri, S. Khan
{"title":"Constraint based temporal partitioning model for partial reconfigurable architectures","authors":"K. Jafri, N. Jafri, S. Khan","doi":"10.1109/INMIC.2003.1416714","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416714","url":null,"abstract":"Partial reconfiguration has opened the door to efficient implementation of large applications on area constrained hardware. It requires a divide and mapping technique through which large applications are divided and mapped on reconfigurable hardware. A technique is proposed for dividing the application taking into account implementation and architectural constraints on hardware processing elements which are swappable. Each time a new task is mapped, an objective function considers mapping of the new task on existing PE or loading a new configuration bit stream for an optimized PE. The decision is critical because it can minimize configuration time at the cost of execution time.","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131450053","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}
引用次数: 3
Analysis of single server queueing systems with heavy tail distributions 具有重尾分布的单服务器排队系统分析
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416689
A.A. Rizvi, A. Hussain
{"title":"Analysis of single server queueing systems with heavy tail distributions","authors":"A.A. Rizvi, A. Hussain","doi":"10.1109/INMIC.2003.1416689","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416689","url":null,"abstract":"Heavy tail distributions serve as better models in today's high speed communication networks, where the traffic is heterogeneous in nature. It has been asserted that these distributions do not have closed form for their Laplace transforms, hence classical queueing models can not be applied. A little is known about exact solutions of queueing systems with heavy tail distributions. In this paper it has been shown that the exact expressions for the Laplace transforms of some heavy tail distributions can be obtained with little attempt and these expressions offer exact analysis of queueing systems using classical queueing models. A simulator has been developed to verify the analytical results","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"189 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113992590","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}
引用次数: 3
Discrete multi-tone (DMT) transceiver with dynamic rate adaptive water-filling bit-loading technique for in-home power line communication networks 用于家庭电力线通信网络的动态速率自适应充水比特加载技术离散多音收发器
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416620
S. Baig, N. Gohar
{"title":"Discrete multi-tone (DMT) transceiver with dynamic rate adaptive water-filling bit-loading technique for in-home power line communication networks","authors":"S. Baig, N. Gohar","doi":"10.1109/INMIC.2003.1416620","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416620","url":null,"abstract":"Power line based home networking is an emerging technology that allows consumers, using their existing electrical wiring system, to get their computers and other home-electronics devices communicating among themselves, and also share the Internet bandwidth. Discrete multi-tone (DMT), a variant of OFDM, for wired channels is adopted as a multiplexing technique that has the inherent flexibility to adapt the modulation scheme according to the signal-to-noise ratio (SNR) on each subchannel. The power line channel being a slow time variant channel, sub-channel SNRs may change with time, then the bit and energy distribution may need a corresponding change. Such variation in the bit and energy distributions calls for dynamic bit-loading. We propose the application of a dynamic rate adaptive water filling bit-loading technique in order to increase the transmission rate by changing the subchannel bit-loading according to the estimated channel state information","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127864999","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}
引用次数: 7
A new algorithm of stereo matching using epipolar geometry 基于极极几何的立体匹配新算法
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416609
N. Rais, Hammad, Khan, Habibullah Jamal
{"title":"A new algorithm of stereo matching using epipolar geometry","authors":"N. Rais, Hammad, Khan, Habibullah Jamal","doi":"10.1109/INMIC.2003.1416609","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416609","url":null,"abstract":"We present a new stereo matching algorithm using epipolar geometry. The proposed algorithm does not completely rely on the fundamental matrix for the identification of the corresponding pairs. In fact, it uses epipolar geometry to locate the corresponding epipolar line in the other image in order to reduce the search space from the whole image plane to just one-dimension. A search window around the point is selected and a correlation-based matching algorithm is used to identify the corresponding points on the epipolar lines. An optimized search window size for correlation computation is also presented in the proposed algorithm. The algorithm provides more accurate results over normal stereo matching algorithms at the cost of marginal computational complexity","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128526051","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}
引用次数: 2
Eliminating process of normalization in relational database design 关系型数据库设计中消除规范化过程
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416760
T. Hussain, S. Shamail, M. Awais
{"title":"Eliminating process of normalization in relational database design","authors":"T. Hussain, S. Shamail, M. Awais","doi":"10.1109/INMIC.2003.1416760","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416760","url":null,"abstract":"The relational database design approach requires the process of normalization in order to minimize data redundancy and update anomalies in the relational schema. Algorithms defined in normalization theory depend upon various dependencies namely functional, multivalued, join and inclusion dependencies that should be carefully defined for a database application. Identification of these dependencies and a minimal cover is a complex and time consuming task for almost all practical problems. This work discusses how the normalization process can be eliminated from the required steps of database design. It explores various constructs of entity relationship diagram (ERD) and their transformation to relational schema. This work elaborates how un-normalized relations are created during the entity relationship (ER) model to relational schema transformation. A set of rules is presented which if followed at the stage of conceptual modeling would always generate a relational schema that satisfies normal forms up to Boyce-Codd normal form (BCNF), thus eliminating the need for normalization. The motivation behind this paper is to save the database designer's valuable time and effort otherwise required in defining dependencies, in finding a minimal cover and in normalizing a given relational schema.","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114666394","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}
引用次数: 15
Simplified BLAST architecture for achieving high data rates over dispersive fading channels 简化BLAST架构，在分散衰落信道上实现高数据速率
7th International Multi Topic Conference, 2003. INMIC 2003. Pub Date : 2003-12-08 DOI: 10.1109/INMIC.2003.1416623
M.A.R. Chaudhry, M. I. Sheikh, N. Sheikh, S. F. Shah, F. Shabber, Y. Saleemi, R. Jabeen, M. Basit
{"title":"Simplified BLAST architecture for achieving high data rates over dispersive fading channels","authors":"M.A.R. Chaudhry, M. I. Sheikh, N. Sheikh, S. F. Shah, F. Shabber, Y. Saleemi, R. Jabeen, M. Basit","doi":"10.1109/INMIC.2003.1416623","DOIUrl":"https://doi.org/10.1109/INMIC.2003.1416623","url":null,"abstract":"This paper presents a simplified BLAST (Bell-Laboratories Layered Space Time Systems) architecture which is capable of achieving low BERs at very low SNRs thus resulting in high spectral efficiencies and higher data rates","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127005245","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信