Pub Date : 2002-04-08DOI: 10.1109/ITCC.2002.1000354
David Holmes, David Holmes
We present a phonetic algorithm for name searches that fuses existing techniques [the Soundex system of Russell and the techniques of J. Celko (1995) and U. Pfeifer et al.] and that introduces new features. This combination offers improved precision and recall. The described experiments assign multiple phonetic codes to each name. Counting common phonetic codes and digrams, the experiments implement the Dice coefficient to assign a similarity score between names. We use the Pfeifer corpus and relevance assessments to compare and contrast our experimental results with traditional techniques.
{"title":"Improving precision and recall for Soundex retrieval","authors":"David Holmes, David Holmes","doi":"10.1109/ITCC.2002.1000354","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000354","url":null,"abstract":"We present a phonetic algorithm for name searches that fuses existing techniques [the Soundex system of Russell and the techniques of J. Celko (1995) and U. Pfeifer et al.] and that introduces new features. This combination offers improved precision and recall. The described experiments assign multiple phonetic codes to each name. Counting common phonetic codes and digrams, the experiments implement the Dice coefficient to assign a similarity score between names. We use the Pfeifer corpus and relevance assessments to compare and contrast our experimental results with traditional techniques.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114473598","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000360
S. Deshpande
A multimedia presentation consists of a set of media with different characteristics (push/ pull nature), different delivery mechanisms, and different priority or importance for the overall effect of the presentation. We propose a scheme where the server can dynamically allocate bandwidth to various media data, so that the overall bandwidth for the presentation will be constant equal to the client bandwidth. Such a real-time bandwidth allocation will improve the user perceived quality of service. Apart from our innovative concept of reallocation of bandwidth between push and pull media based on their discrete or continuous nature, we present a mathematical formulation, which allows the bandwidth allocation considering the distortion and the delay.
{"title":"Prioritized optimal server side bandwidth allocation in a multimedia session with push and pull sources","authors":"S. Deshpande","doi":"10.1109/ITCC.2002.1000360","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000360","url":null,"abstract":"A multimedia presentation consists of a set of media with different characteristics (push/ pull nature), different delivery mechanisms, and different priority or importance for the overall effect of the presentation. We propose a scheme where the server can dynamically allocate bandwidth to various media data, so that the overall bandwidth for the presentation will be constant equal to the client bandwidth. Such a real-time bandwidth allocation will improve the user perceived quality of service. Apart from our innovative concept of reallocation of bandwidth between push and pull media based on their discrete or continuous nature, we present a mathematical formulation, which allows the bandwidth allocation considering the distortion and the delay.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073180","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000359
Hong Zhao, N. Ansari, Y. Shi
To guarantee quality of service (QoS), the requirements for video transmission such as delay and cell loss rate (CLR) are very stringent. These constraints are difficult to meet if high network utilization is desired. Dynamic bandwidth allocation is thus needed. Video traffic prediction can play an important role in dynamic bandwidth allocation and traffic management in high speed networks. We propose a fast convergent algorithm to predict the variation of I frames, based on which the bandwidth is assigned. The new algorithm can achieve fast convergence and small prediction error.
{"title":"A fast non-linear adaptive algorithm for video traffic prediction","authors":"Hong Zhao, N. Ansari, Y. Shi","doi":"10.1109/ITCC.2002.1000359","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000359","url":null,"abstract":"To guarantee quality of service (QoS), the requirements for video transmission such as delay and cell loss rate (CLR) are very stringent. These constraints are difficult to meet if high network utilization is desired. Dynamic bandwidth allocation is thus needed. Video traffic prediction can play an important role in dynamic bandwidth allocation and traffic management in high speed networks. We propose a fast convergent algorithm to predict the variation of I frames, based on which the bandwidth is assigned. The new algorithm can achieve fast convergence and small prediction error.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124992117","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000381
S. Ngamsuriyaroj, A. Hurson, T. Keefe
In this paper we propose an invalidation-based consistency protocol using timestamp ordering for concurrency control. The protocol works for a system composed of a security server and object managers located on different machines. The security server defines the security policy in a small database and object managers enforce the policy replicated on each machine. Thus, the system can be modeled as a replicated database. Since transient inconsistency among replicas may lead to unauthorized accesses, our goal of consistency is one-copy serializability (1SR) because it guarantees a one-copy view of the security policy regardless of which copy is accessed. However the requirement for good performance is also desirable. We evaluate the performance of the proposed protocol and compare it with the performance of the transactional consistency protocol, an invalidation-based consistency protocol based on a locking mechanism. Both protocols guarantee 1SR consistency. The results show that both protocols demonstrate compatible performance. However the proposed protocol offers 1SR consistency with less overhead.
{"title":"Maintaining consistency of the security policy using timestamp ordering","authors":"S. Ngamsuriyaroj, A. Hurson, T. Keefe","doi":"10.1109/ITCC.2002.1000381","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000381","url":null,"abstract":"In this paper we propose an invalidation-based consistency protocol using timestamp ordering for concurrency control. The protocol works for a system composed of a security server and object managers located on different machines. The security server defines the security policy in a small database and object managers enforce the policy replicated on each machine. Thus, the system can be modeled as a replicated database. Since transient inconsistency among replicas may lead to unauthorized accesses, our goal of consistency is one-copy serializability (1SR) because it guarantees a one-copy view of the security policy regardless of which copy is accessed. However the requirement for good performance is also desirable. We evaluate the performance of the proposed protocol and compare it with the performance of the transactional consistency protocol, an invalidation-based consistency protocol based on a locking mechanism. Both protocols guarantee 1SR consistency. The results show that both protocols demonstrate compatible performance. However the proposed protocol offers 1SR consistency with less overhead.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117018268","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000426
Namkyung Lee, Hojin Lee, Hokyom Kim, S. Chae
The DSM-CC (Digital Storage Media Command and Control) Data Carousel can improve reliability, usability and compatibility by cyclic retransmission. In MPEG (Moving Picture Experts Group)-4 system, each object can be managed independently by object-based coding. The object is composed of an ES (Elementary Stream) and transmitted through the DMIF (Delivery Multimedia Integration Framework) layer. The cooperation system of DSM-CC-Data Carousel and MPEG-4 system via satellite (CMS) is using the current MPEG-4 system and DSM-CC-Data Carousel. Each of the systems can work together using the DMIF Descriptor and streams are transmitted via satellite. The CMS can change the contents of the data stream in run-time using DMIF, MPEG-4 ES (Elementary Stream) and DSM-CC Data Carousel and improve reliability, usability and compatibility by cyclic retransmission. This paper describes the cooperation system of DSM-CC-Data Carousel and MPEG-4 system via satellite.
DSM-CC(数字存储媒体指挥与控制)数据传送带可以通过循环重传提高可靠性、可用性和兼容性。在MPEG (Moving Picture Experts Group)-4系统中，通过基于对象的编码可以对每个对象进行独立管理。该对象由ES (Elementary Stream)组成，并通过DMIF (Delivery Multimedia Integration Framework)层传输。通过卫星(CMS)实现的DSM-CC-Data Carousel与MPEG-4系统的合作系统是使用现有的MPEG-4系统和DSM-CC-Data Carousel。每个系统可以使用DMIF描述符一起工作，流通过卫星传输。CMS采用DMIF、MPEG-4 ES (Elementary stream)和DSM-CC data Carousel等技术在运行时改变数据流的内容，并通过循环重传提高可靠性、可用性和兼容性。介绍了基于卫星的DSM-CC-Data Carousel与MPEG-4系统的协作系统。
{"title":"Cooperation system of DSM-CC Data Carousel and MPEG-4 system via satellite","authors":"Namkyung Lee, Hojin Lee, Hokyom Kim, S. Chae","doi":"10.1109/ITCC.2002.1000426","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000426","url":null,"abstract":"The DSM-CC (Digital Storage Media Command and Control) Data Carousel can improve reliability, usability and compatibility by cyclic retransmission. In MPEG (Moving Picture Experts Group)-4 system, each object can be managed independently by object-based coding. The object is composed of an ES (Elementary Stream) and transmitted through the DMIF (Delivery Multimedia Integration Framework) layer. The cooperation system of DSM-CC-Data Carousel and MPEG-4 system via satellite (CMS) is using the current MPEG-4 system and DSM-CC-Data Carousel. Each of the systems can work together using the DMIF Descriptor and streams are transmitted via satellite. The CMS can change the contents of the data stream in run-time using DMIF, MPEG-4 ES (Elementary Stream) and DSM-CC Data Carousel and improve reliability, usability and compatibility by cyclic retransmission. This paper describes the cooperation system of DSM-CC-Data Carousel and MPEG-4 system via satellite.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121149097","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000399
M. Sainz, N. Bagherzadeh, A. Susín
An optimized linear factorization method for recovering both the 3D geometry of a scene and the camera parameters from multiple uncalibrated images is presented. In a first step, we recover a projective approximation using a well-known iterative approach. Then we are able to upgrade from a projective to a Euclidean structure by computing the projective distortion matrix in a way that is analogous to estimating the absolute quadric. Using singular value decomposition (SVD) as the main tool, and from a study of the ranks of the matrices involved in the process, we are able to enforce an accurate Euclidean reconstruction. Moreover, in contrast to other approaches, our process is essentially a linear one and does not require an initial estimation of the solution. Examples of synthetic and real data reconstructions are presented.
{"title":"Recovering 3D metric structure and motion from multiple uncalibrated cameras","authors":"M. Sainz, N. Bagherzadeh, A. Susín","doi":"10.1109/ITCC.2002.1000399","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000399","url":null,"abstract":"An optimized linear factorization method for recovering both the 3D geometry of a scene and the camera parameters from multiple uncalibrated images is presented. In a first step, we recover a projective approximation using a well-known iterative approach. Then we are able to upgrade from a projective to a Euclidean structure by computing the projective distortion matrix in a way that is analogous to estimating the absolute quadric. Using singular value decomposition (SVD) as the main tool, and from a study of the ranks of the matrices involved in the process, we are able to enforce an accurate Euclidean reconstruction. Moreover, in contrast to other approaches, our process is essentially a linear one and does not require an initial estimation of the solution. Examples of synthetic and real data reconstructions are presented.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584066","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000405
G. Greco, S. Greco, E. Zumpano
Search services on hyperlinked data are becoming popular among users because of the huge amount of data available and the consequent difficulty of retrieving and filtering relevant documents. Traditional term-based search engines are not very useful for this purpose since the resulting ranking depends on the users's precision in expressing the query. Current research, instead, takes a different approach, called topic distillation, which consists of finding documents related to the query topic, but these do not necessarily contain the query string. Current algorithms for topic distillation first compute a base set containing all the relevant pages and then apply an iterative procedure to obtain the authoritative pages. In this paper we present STED, a system for topic distillation and enumeration (i.e. identification of different communities) of Web documents. The system is based on a technique which computes authoritative pages by analyzing the structure of the base set. More specifically, the system applies a statistical approach to the co-citation matrix associated with the base set, to find the most co-cited pages and analyzes both the link structure and the content of pages. Several experiments have demonstrated the effectiveness and efficiency of the system.
{"title":"STED: a system for topic enumeration and distillation","authors":"G. Greco, S. Greco, E. Zumpano","doi":"10.1109/ITCC.2002.1000405","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000405","url":null,"abstract":"Search services on hyperlinked data are becoming popular among users because of the huge amount of data available and the consequent difficulty of retrieving and filtering relevant documents. Traditional term-based search engines are not very useful for this purpose since the resulting ranking depends on the users's precision in expressing the query. Current research, instead, takes a different approach, called topic distillation, which consists of finding documents related to the query topic, but these do not necessarily contain the query string. Current algorithms for topic distillation first compute a base set containing all the relevant pages and then apply an iterative procedure to obtain the authoritative pages. In this paper we present STED, a system for topic distillation and enumeration (i.e. identification of different communities) of Web documents. The system is based on a technique which computes authoritative pages by analyzing the structure of the base set. More specifically, the system applies a statistical approach to the co-citation matrix associated with the base set, to find the most co-cited pages and analyzes both the link structure and the content of pages. Several experiments have demonstrated the effectiveness and efficiency of the system.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123407978","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000438
Babak Akhgar, J. Siddiqi, Samir Al-Khayatt
Modern organisations currently face a multitude of technologies that are seeking to climb on to the budgetary agenda of management boards. Two of the main contenders are enterprise resource planning (ERP) and e-business related technologies. There appears to be a misunderstanding, which has not been well-publicised, regarding the relationship between ERP and e-business, particularly the viewpoint that ERP is a platform for e-business. This paper, based on research from an ongoing information systems (IS) investigation project at a large multinational company, examines this relationship. The paper discusses different scenarios of ERP implementation status that organisations may find themselves part of. It examines the components of e-business success, namely the visibility of information, processes and technology that will be either enabled or restricted by ERP. What transpires from this research is that, for many start-ups, e-business becomes synonymous with business in general. We argue that e-business should form part of the corporate strategy and that an IS or IT strategy should form the basis for determining ERP implementation structures, thereby ensuring that e-business requirements become the platform for ERP.
{"title":"Strategic exploitation of ERP for e-business","authors":"Babak Akhgar, J. Siddiqi, Samir Al-Khayatt","doi":"10.1109/ITCC.2002.1000438","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000438","url":null,"abstract":"Modern organisations currently face a multitude of technologies that are seeking to climb on to the budgetary agenda of management boards. Two of the main contenders are enterprise resource planning (ERP) and e-business related technologies. There appears to be a misunderstanding, which has not been well-publicised, regarding the relationship between ERP and e-business, particularly the viewpoint that ERP is a platform for e-business. This paper, based on research from an ongoing information systems (IS) investigation project at a large multinational company, examines this relationship. The paper discusses different scenarios of ERP implementation status that organisations may find themselves part of. It examines the components of e-business success, namely the visibility of information, processes and technology that will be either enabled or restricted by ERP. What transpires from this research is that, for many start-ups, e-business becomes synonymous with business in general. We argue that e-business should form part of the corporate strategy and that an IS or IT strategy should form the basis for determining ERP implementation structures, thereby ensuring that e-business requirements become the platform for ERP.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124135790","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000383
Won Jay Song, B. Ahn, Won Hee Kim
This research paper presents a new two-way double-type smart card terminal and a new system design and development for a prescription order communication system (POCS) between the hospital and pharmacy, based on the Internet, public-key infrastructure (PKI), and concurrently parallel co-operation with both medical professional and patient smart cards in synchronized status, in order to control security and privacy of patients and manage drug histories. A concurrently parallel co-operation method in synchronized status has been proposed in order to merge the digital signature generated by a medical professional with a patient's prescription data. The digital signatures written by the medical professionals (doctors and pharmacists) holding and using their individually master smart cards are applied to all contents of the prescription stored on a patient slave smart card in synchronized status in the two-way double-type terminal. Therefore, digital signatures for all prescriptions stored on the smart card should effectively be used to prevent it being altered, forged, or reused by unauthorized users and being repudiated by medical professionals.
{"title":"Healthcare information systems using digital signature and synchronized smart cards via the Internet","authors":"Won Jay Song, B. Ahn, Won Hee Kim","doi":"10.1109/ITCC.2002.1000383","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000383","url":null,"abstract":"This research paper presents a new two-way double-type smart card terminal and a new system design and development for a prescription order communication system (POCS) between the hospital and pharmacy, based on the Internet, public-key infrastructure (PKI), and concurrently parallel co-operation with both medical professional and patient smart cards in synchronized status, in order to control security and privacy of patients and manage drug histories. A concurrently parallel co-operation method in synchronized status has been proposed in order to merge the digital signature generated by a medical professional with a patient's prescription data. The digital signatures written by the medical professionals (doctors and pharmacists) holding and using their individually master smart cards are applied to all contents of the prescription stored on a patient slave smart card in synchronized status in the two-way double-type terminal. Therefore, digital signatures for all prescriptions stored on the smart card should effectively be used to prevent it being altered, forged, or reused by unauthorized users and being repudiated by medical professionals.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117308357","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000423
Chung-Lin Huang, Sling Liang
This paper proposes a joint source and channel coding (JSCC) method for MPEG-2 video transmission. Based on the current channel status, this JSCC method finds the best source and channel code rate distribution. Due to the different bit error sensitivity of the source code, we apply unequal error protection (UEP) for the source bits by using so-called rate compatible punctured convolution (RCPC) channel coder for efficient protection during channel transmission. In the simulations, we illustrate that under the conditions of the same channel status and total bit rate, our method provides the minimal overall distortion of the MPEG-2 video compared to the equal error protection (EEP) coding.
{"title":"A model-driven joint source and channel coder for MPEG-2 video transmission","authors":"Chung-Lin Huang, Sling Liang","doi":"10.1109/ITCC.2002.1000423","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000423","url":null,"abstract":"This paper proposes a joint source and channel coding (JSCC) method for MPEG-2 video transmission. Based on the current channel status, this JSCC method finds the best source and channel code rate distribution. Due to the different bit error sensitivity of the source code, we apply unequal error protection (UEP) for the source bits by using so-called rate compatible punctured convolution (RCPC) channel coder for efficient protection during channel transmission. In the simulations, we illustrate that under the conditions of the same channel status and total bit rate, our method provides the minimal overall distortion of the MPEG-2 video compared to the equal error protection (EEP) coding.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115301387","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
扫码关注我们
求助内容：
应助结果提醒方式：