{"title":"Nonlinear programming based detectors for multiuser systems","authors":"A. Yener","doi":"10.1109/ITCC.2001.918815","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918815","url":null,"abstract":"Maximum likelihood (ML) detection problems for several multiuser systems result in nonlinear optimization problems with unacceptably high complexity. One way of achieving near-optimum performance without the complexity associated with the ML detector is using nonlinear programming relaxations to approximate the solution of the ML detection problem at hand. Using this approach, new detectors are formulated and it is observed that some popular suboptimum receivers correspond to relaxations of the ML detectors. We concentrate on two types of systems to demonstrate this concept and evaluate the performance of the resulting detectors.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133646367","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}
{"title":"An innovative local area network architecture for native multimedia support","authors":"P. Montessoro, D. Pierattoni","doi":"10.1109/ITCC.2001.918807","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918807","url":null,"abstract":"New communication technologies are being developed and new user requirements are growing due to advances in fiber optics providing high link capacity at low cost. Traditional solutions are based on processing resources of host and network nodes in order to optimize link utilization. A simpler and lightweight solution could be reached by a new approach for designing network protocols; our proposal is initially limited to the LAN/structured cabling system environment, not excluding a further extension to MAN/WAN support. The leading idea is a broadband network architecture, based on native flow control, dynamic resource allocation and reallocation, and synchronous, connection-oriented fast circuit switching. It will provide a service based on multi-rate channels with short setup time and fixed switching requirements, as well as applications with bursty asynchronous traffic. A project framework is presented addressing the most important issues; physical, data link and network layer functions, data transfer schemes and traditional TCP/IP compatibility.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099615","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}
{"title":"Novel technique for tonal language speech compression based on a bit rate scalable MP-CELP coder","authors":"S. Chompun, S. Jitapunkul, D. Tancharoen","doi":"10.1109/ITCC.2001.918839","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918839","url":null,"abstract":"This paper proposes a modification of the flexible multi-pulse based code excited linear predictive (MP-CELP) coder with bit rate scalabilities for tonal language speech in multimedia applications. The coder consists of a core coder and bit rate scalable tools. The high pitch delay resolutions are applied to the adaptive codebook of the core coder for tonal language speech quality improvement. The bit rate scalable tool employs multi-stage excitation coding based on an embedded-coding approach. The multi-pulse excitation codebook at each stage is adaptively produced depending on the selected excitation signal ut the previous stage. The experimental results show that the speech quality of the proposed coder is improved compared to that of the conventional coder without pitch-resolution adaptation.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165047","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}
{"title":"An optical watermarking solution for authenticating printed documents","authors":"Qibin Sun, Peirong Feng, R. Deng","doi":"10.1109/ITCC.2001.918767","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918767","url":null,"abstract":"We present a novel and simple optical watermarking system aiming at overriding some practical problems when the state-of-the art digital watermarking techniques are applied to authenticate printed documents. We name our technique optical watermarking differing from traditional digital watermarking in the sense that the watermark extraction is done by some optical and visual means like a photocopier, while no digitization is required. The system security is guaranteed by adopting a content-based key share scheme originated from visual cryptography. The non-obtrusiveness effect of the watermarked document is achieved by modulating the watermark into a higher resolution grating level. Experimental results demonstrate the availability and practicality of the proposed approach.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132988281","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}
{"title":"Coding theory framework for target location in distributed sensor networks","authors":"K. Chakrabarty, S. Iyengar, H. Qi, E. Cho","doi":"10.1109/ITCC.2001.918778","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918778","url":null,"abstract":"Distributed, real time sensor networks are essential for effective surveillance in the digitized battlefield and for environmental monitoring. We present the first systematic theory that leads to novel sensor deployment strategies for effective surveillance and target location. We represent the sensor field as a grid (two- or three-dimensional) of points (coordinates), and use the term target at a grid point at any instant in time. We use the framework of unidentified codes to determine sensor placement for unique target location. We provide coding-theoretic-bounds on the number of sensors and present methods for determining their placement in the sensor field. We also show that sensor placement for single targets provides asymptotically complete (unambiguous) location of multiple targets.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133454305","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}
{"title":"New bounds on a hypercube coloring problem and linear codes","authors":"H. Q. Ngo, D. Du, R. Graham","doi":"10.1109/ITCC.2001.918853","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918853","url":null,"abstract":"In studying the scalability of optical networks, one problem arising involves coloring the vertices of the n-dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of /spl chi//sub k~/(n), the minimum number of colors needed, appears to be a difficult problem. We improve the known lower and upper bounds of /spl chi//sub k~/(n) and indicate the connection of this colouring problem to linear codes.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"19 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132059646","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}
{"title":"Advanced research issues for tomorrow's multimedia networks","authors":"P. Montessoro, D. Pierattoni","doi":"10.1109/ITCC.2001.918817","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918817","url":null,"abstract":"Computer networks require complex solutions for traffic shaping and for bandwidth management on links and switching nodes, in order to provide a reliable QoS-based infrastructure for multimedia and bandwidth-on-demand applications. A simpler and lightweight solution could be reached by a new approach in designing the network protocols. The evolution of the hardware technology will make available faster processing units and larger memories for network devices; this could lead to a radical change of paradigm in network design if a long term research plan for innovative network architectures became popular in the research community. The wide variety of arguments to be investigated requires a multidisciplinary approach, possibly involving several research groups worldwide from research institutions and industrial R&D. The main purpose of the article is to suggest some guidelines for designing an innovative architecture for computer networks. Our proposal descends from a circumstantial survey of existing technologies, and offers a general framework for individuating and approaching research topics of common interest in the networking environment.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"32 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941464","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}
{"title":"Speech content integrity verification integrated with ITU G.723.1 speech coding","authors":"Chung-Ping Wu, C.-C. Jay Kuo","doi":"10.1109/ITCC.2001.918876","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918876","url":null,"abstract":"A speech content integrity verification scheme integrated with ITU G.723.1 speech coding to minimize the total computational cost is proposed in this research. Speech features relevant to the semantic meaning are extracted, encrypted and attached as the header information. This scheme is not only much faster than cryptographic bitstream integrity algorithms, but also more compatible with a variable of applications. The speech signal could go through recompression, amplification, transcoding, re-sampling, D/A and A/D conversion and minor white noise pollution without triggering the verification alarm.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128978139","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}
{"title":"QoS scheduling for energy-efficient wireless communication","authors":"P. Havinga, G. Smit","doi":"10.1109/ITCC.2001.918785","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918785","url":null,"abstract":"Presents a QoS (quality of service) scheduler that assigns bandwidth over a wireless channel such that the amount of energy spent by a mobile device is minimized, while maintaining the QoS of the connections. Energy efficiency is an important issue for mobile computers, since they must rely on their batteries. We have designed and implemented an energy-efficient architecture and MAC protocol for wireless multimedia traffic. The scheduling is based on two mechanisms: (1) short-term transmission frame scheduling that concatenates the uplink and downlink traffic of a mobile device, and (2) long-term scheduling that tries to collect traffic as much as possible within the QoS requirements of the connections. The result is that the transceiver can be in a low-power operating mode for an extended period of time and that the number of operating mode transitions is reduced.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125726210","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}
{"title":"Enterprise text processing: a sparse matrix approach","authors":"Nazli Goharian, D. Grossman, T. El-Ghazawi","doi":"10.1109/ITCC.2001.918768","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918768","url":null,"abstract":"Documents, both internal and related publicly available, are now considered a corporate asset. The potential to efficiently and accurately search such documents is of great significance. We demonstrate the application of sparse matrix-vector multiplication algorithms for text storage and retrieval as a means of supporting efficient and accurate text processing. As many parallel sparse matrix-vector multiplication algorithms exist, such an information retrieval approach lends itself to parallelism. This enables us to attack the problem of parallel information retrieval, which has resisted good scalability. We use sparse matrix compression algorithms and compare the storage of a subcollection of the commonly used NIST TREC corpus with a traditional inverted index. We demonstrate query processing using a sparse matrix-vector multiplication algorithm. Our results indicate that our approach saves approximately 35% of the total storage requirements for the inverted index. Additionally to improve accuracy, we develop a novel matrix based relevance feedback technique as well as a proximity search algorithm. The results of our experiment to incorporate proximity search capability into the system also indicate 35% less storage for the sparse matrix over the inverted index.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126387662","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}