Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366573
M. Yasin, A.A. Awan
Intrusion detection systems (IDS) are complimentary to other security mechanisms such as access control and authentication. While signature based IDS are limited to known attacks only, anomaly based IDS are capable of detecting novel attacks. However, anomaly based systems usually trade performance for efficiency. We analyze various anomaly based IDS and list the strengths and weaknesses of different schemes. We conclude that the abstract stack model proposed by D. Wagner and D. Dean (see Proc. IEEE Symp. on Security and Privacy, 2001) shows best performance in detecting various types of attacks, while it suffers from substantial runtime overhead owing to its non deterministic nature. In a recently published approach utilizing code instrumentation, J.T. Giffin et al. (see Proc. NDSS Conf., 2004) minimize the runtime overhead while approaching the detection capability of the abstract stack model.
{"title":"A study of host-based IDS using system calls","authors":"M. Yasin, A.A. Awan","doi":"10.1109/INCC.2004.1366573","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366573","url":null,"abstract":"Intrusion detection systems (IDS) are complimentary to other security mechanisms such as access control and authentication. While signature based IDS are limited to known attacks only, anomaly based IDS are capable of detecting novel attacks. However, anomaly based systems usually trade performance for efficiency. We analyze various anomaly based IDS and list the strengths and weaknesses of different schemes. We conclude that the abstract stack model proposed by D. Wagner and D. Dean (see Proc. IEEE Symp. on Security and Privacy, 2001) shows best performance in detecting various types of attacks, while it suffers from substantial runtime overhead owing to its non deterministic nature. In a recently published approach utilizing code instrumentation, J.T. Giffin et al. (see Proc. NDSS Conf., 2004) minimize the runtime overhead while approaching the detection capability of the abstract stack model.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116746904","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-06-11DOI: 10.1109/INCC.2004.1366594
M. Khan, C. M. Imran, M. Shoaib, M. Sikander, H. Khiyal
Image communication is primarily constrained by its large bandwidth requirement. Therefore, researchers have worked on various compression algorithms to achieve low bit rates. Images and video sequences are highly-correlated sources and their correlation should be exploited in a given compression algorithm. Differential pulse code modulation (DPCM) emerged as a means of exploiting the correlation among image pixels. Later, DPCM was improved by predictive vector quantization (PVQ). PVQ employs block by block prediction and results in satisfactory performance at low bit rates. However, its design is complicated and recently an asymptotic closed-loop (ACL) was proposed to stabilize the design. We attempt to replace the VQ with a multistage VQ structure in the hope of further reducing the stress on the closed-loop design. We use the multistage VQ structure called reflected residual vector quantization (RRVQ). RRVQ works by imposing an additional symmetry constraint on the multistage codebook design. RRVQ has been quite popular where large block-length vector quantization is needed due to its very low codebook search capability. Our proposed design goal in replacing VQ with RRVQ in a PVQ design is our wish to use large block lengths like 16/spl times/16 or 32/spl times/32 size vectors to grab any linear/nonlinear correlation among the vector components. The way to incorporate RRVQ within PVQ structure is proposed and simulation results are discussed.
{"title":"Design and analysis of predictive reflected residual vector quantization","authors":"M. Khan, C. M. Imran, M. Shoaib, M. Sikander, H. Khiyal","doi":"10.1109/INCC.2004.1366594","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366594","url":null,"abstract":"Image communication is primarily constrained by its large bandwidth requirement. Therefore, researchers have worked on various compression algorithms to achieve low bit rates. Images and video sequences are highly-correlated sources and their correlation should be exploited in a given compression algorithm. Differential pulse code modulation (DPCM) emerged as a means of exploiting the correlation among image pixels. Later, DPCM was improved by predictive vector quantization (PVQ). PVQ employs block by block prediction and results in satisfactory performance at low bit rates. However, its design is complicated and recently an asymptotic closed-loop (ACL) was proposed to stabilize the design. We attempt to replace the VQ with a multistage VQ structure in the hope of further reducing the stress on the closed-loop design. We use the multistage VQ structure called reflected residual vector quantization (RRVQ). RRVQ works by imposing an additional symmetry constraint on the multistage codebook design. RRVQ has been quite popular where large block-length vector quantization is needed due to its very low codebook search capability. Our proposed design goal in replacing VQ with RRVQ in a PVQ design is our wish to use large block lengths like 16/spl times/16 or 32/spl times/32 size vectors to grab any linear/nonlinear correlation among the vector components. The way to incorporate RRVQ within PVQ structure is proposed and simulation results are discussed.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131766000","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-06-11DOI: 10.1109/INCC.2004.1366572
M.N. Shah, M. A. Khan, R. Mahmood
Spamming is a serious issue for the Internet community. As well as incurring financial losses to many organisations, spamming causes mental frustration, and the spam content (much of which includes indecent material) causes embarrassment and presents moral issues. Many techniques and solutions have been presented over the past few years, but most of them cannot effectively deter the spamming issue totally. The major reason for the failure of these solutions is that spammers use the very protocols used for email transmission and forwarding to flood the network. One reason for the failure of new solutions is the high drop rate of legitimate emails by the receiver entity. Various solutions have been tried to deter spamming, but in vain. Although in theoretical tests these techniques provide an effective defence against the email message flood, the practical implementation of 100% spam protection is still far from reality. We describe a technical solution to prevent end users from receiving spam messages. Although our approach is simple and intuitive, it provides significant resistance against spam attack generation. Rather than countering the spamming at the receiver side,our solution counters the spamming attack at the point of origination, making it a more deterrent solution against spam based attacks.
{"title":"FLeSMA: a firewall level spam mitigation approach through a genetic classifier model","authors":"M.N. Shah, M. A. Khan, R. Mahmood","doi":"10.1109/INCC.2004.1366572","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366572","url":null,"abstract":"Spamming is a serious issue for the Internet community. As well as incurring financial losses to many organisations, spamming causes mental frustration, and the spam content (much of which includes indecent material) causes embarrassment and presents moral issues. Many techniques and solutions have been presented over the past few years, but most of them cannot effectively deter the spamming issue totally. The major reason for the failure of these solutions is that spammers use the very protocols used for email transmission and forwarding to flood the network. One reason for the failure of new solutions is the high drop rate of legitimate emails by the receiver entity. Various solutions have been tried to deter spamming, but in vain. Although in theoretical tests these techniques provide an effective defence against the email message flood, the practical implementation of 100% spam protection is still far from reality. We describe a technical solution to prevent end users from receiving spam messages. Although our approach is simple and intuitive, it provides significant resistance against spam attack generation. Rather than countering the spamming at the receiver side,our solution counters the spamming attack at the point of origination, making it a more deterrent solution against spam based attacks.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438425","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-06-11DOI: 10.1109/INCC.2004.1366566
I. Hussain
Summary form only given. Multiprotocol label switching (MPLS) employs label information to identify packets, and, unlike conventional IP routing, forwards packets based on label information instead of the packet's IP destination address. Label switched routers (LSRs) use signaling protocols to establish label switched paths (LSPs). In general, LSPs can follow conventionally routed shortest paths or explicit paths that could be different from the shortest paths. When an LSP is established along an explicit path, it is referred to as a traffic engineered (TE) LSP. In addition to allowing high performance forwarding architectures, MPLS technology enables other important applications. MPLS, TE mechanisms in particular, are increasingly being deployed by service providers to guarantee quality of service (QoS), to utilize network resources efficiently and to protect data traffic against network failures. The tutorial includes the following: a brief introduction of fundamental components of the MPLS technology; a brief overview of RSVP (resource reservation protocol) and its traffic engineering enhancements; an illustration of how enhanced RSVP can be used to establish TE LSP; a brief overview of the MPLS fast reroute (FRR) mechanism which can be used to reroute traffic quickly against link/node failures. Some previous exposure to IP routing protocols may be useful, but is not required.
{"title":"Overview of MPLS technology and traffic engineering applications","authors":"I. Hussain","doi":"10.1109/INCC.2004.1366566","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366566","url":null,"abstract":"Summary form only given. Multiprotocol label switching (MPLS) employs label information to identify packets, and, unlike conventional IP routing, forwards packets based on label information instead of the packet's IP destination address. Label switched routers (LSRs) use signaling protocols to establish label switched paths (LSPs). In general, LSPs can follow conventionally routed shortest paths or explicit paths that could be different from the shortest paths. When an LSP is established along an explicit path, it is referred to as a traffic engineered (TE) LSP. In addition to allowing high performance forwarding architectures, MPLS technology enables other important applications. MPLS, TE mechanisms in particular, are increasingly being deployed by service providers to guarantee quality of service (QoS), to utilize network resources efficiently and to protect data traffic against network failures. The tutorial includes the following: a brief introduction of fundamental components of the MPLS technology; a brief overview of RSVP (resource reservation protocol) and its traffic engineering enhancements; an illustration of how enhanced RSVP can be used to establish TE LSP; a brief overview of the MPLS fast reroute (FRR) mechanism which can be used to reroute traffic quickly against link/node failures. Some previous exposure to IP routing protocols may be useful, but is not required.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"107 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113960504","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-06-11DOI: 10.1109/INCC.2004.1366563
S. A. Mujtaba
Summary form only given. The success of wireless communications for voice applications is evidenced by the sale of 400 million GSM cellular telephones every year world-wide. Wireless telephony has changed the way we live, work, and play. The emergence of the Internet in the last decade changed the way we share information with each other, be it via e-mail or through Web browsing. Today, all forms of information are available in digital formats, such as digital speech, digital audio, digital images, digital video, and of course digital text. The next revolution in our lives will be access to broadband digital content - anytime and anywhere. The underlying technology enabling this revolution would be seamless, ubiquitous broadband wireless communications. We present the fundamental mechanisms available to increase the data rate of wireless communication systems. These include bandwidth, constellation order, and multiple antennas. We step through the history of wireless communication systems (such as AMPS, IS-136/GSM, IS-95, IEEE 802.11, IEEE 802.15, IEEE 802.16), and show how the various standards have steadily pushed the broadband frontier. We highlight the practical limitations associated with the various signaling techniques (such as TDMA, CDMA, OFDM etc.), and discuss tradeoffs for designing a wireless communication system operating at 1 gigabit per second.
{"title":"The roadmap to broadband wireless communications - from kbps to Gbps","authors":"S. A. Mujtaba","doi":"10.1109/INCC.2004.1366563","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366563","url":null,"abstract":"Summary form only given. The success of wireless communications for voice applications is evidenced by the sale of 400 million GSM cellular telephones every year world-wide. Wireless telephony has changed the way we live, work, and play. The emergence of the Internet in the last decade changed the way we share information with each other, be it via e-mail or through Web browsing. Today, all forms of information are available in digital formats, such as digital speech, digital audio, digital images, digital video, and of course digital text. The next revolution in our lives will be access to broadband digital content - anytime and anywhere. The underlying technology enabling this revolution would be seamless, ubiquitous broadband wireless communications. We present the fundamental mechanisms available to increase the data rate of wireless communication systems. These include bandwidth, constellation order, and multiple antennas. We step through the history of wireless communication systems (such as AMPS, IS-136/GSM, IS-95, IEEE 802.11, IEEE 802.15, IEEE 802.16), and show how the various standards have steadily pushed the broadband frontier. We highlight the practical limitations associated with the various signaling techniques (such as TDMA, CDMA, OFDM etc.), and discuss tradeoffs for designing a wireless communication system operating at 1 gigabit per second.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122380485","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-06-11DOI: 10.1109/INCC.2004.1366595
S.A. Azad, M. Murshed, L. Dooley
Ideally, video-on-demand (VOD) systems provide the user with the facility to watch any video at the time of their choice and permit interactive (VCR) functionality. Special contingency channels can be allocated in order to provide VCR functions; however; this threatens the scalability of the VOD system. Client buffering is an alternative, but, due to its discrete nature, present algorithms suffer from discontinuous VCR actions. A novel scheme for providing VCR functions is proposed by buffering a multiple-rate video channel. Significant improvements in both the overall percentage of discontinuous VCR actions and destination shifts are achieved, without having a dedicated interaction channel. It also has a simpler video fetching mechanism which leads to a low cost client system.
{"title":"A novel scalable interactive multiple-rate staggered broadcasting video-on-demand system","authors":"S.A. Azad, M. Murshed, L. Dooley","doi":"10.1109/INCC.2004.1366595","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366595","url":null,"abstract":"Ideally, video-on-demand (VOD) systems provide the user with the facility to watch any video at the time of their choice and permit interactive (VCR) functionality. Special contingency channels can be allocated in order to provide VCR functions; however; this threatens the scalability of the VOD system. Client buffering is an alternative, but, due to its discrete nature, present algorithms suffer from discontinuous VCR actions. A novel scheme for providing VCR functions is proposed by buffering a multiple-rate video channel. Significant improvements in both the overall percentage of discontinuous VCR actions and destination shifts are achieved, without having a dedicated interaction channel. It also has a simpler video fetching mechanism which leads to a low cost client system.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128102716","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-06-11DOI: 10.1109/INCC.2004.1366591
M. Khan
Multispectral imagery and video coding applications benefit from the use of large vector sizes. Other applications also require large vector sizes such as variable dimension vector quantizers (VQ) and transform VQ. Entropy-constrained reflected residual vector quantization (EC-RRVQ) is an algorithm that is used to design codebooks for image coding with large vector sizes in addition to high output rate while maintaining a very low complexity in terms of computations and memory requirements. EC-RRVQ has several advantages which are important. It can outperform entropy-constrained residual vector quantization (EC-RVQ) in terms of rate-distortion performance, encoder complexity computations, and memory. Experimental results indicate that good image reproduction quality can be accomplished at relatively low bit rates. For example, a peak signal-to-noise ratio of 29 dB is obtained for the 51/spl times/512 image Lena at a bit rate of 0.2 bpp with vector dimension of 16/spl times/16.
{"title":"Large block entropy-constrained reflected residual vector quantization","authors":"M. Khan","doi":"10.1109/INCC.2004.1366591","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366591","url":null,"abstract":"Multispectral imagery and video coding applications benefit from the use of large vector sizes. Other applications also require large vector sizes such as variable dimension vector quantizers (VQ) and transform VQ. Entropy-constrained reflected residual vector quantization (EC-RRVQ) is an algorithm that is used to design codebooks for image coding with large vector sizes in addition to high output rate while maintaining a very low complexity in terms of computations and memory requirements. EC-RRVQ has several advantages which are important. It can outperform entropy-constrained residual vector quantization (EC-RVQ) in terms of rate-distortion performance, encoder complexity computations, and memory. Experimental results indicate that good image reproduction quality can be accomplished at relatively low bit rates. For example, a peak signal-to-noise ratio of 29 dB is obtained for the 51/spl times/512 image Lena at a bit rate of 0.2 bpp with vector dimension of 16/spl times/16.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133846934","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-06-11DOI: 10.1109/INCC.2004.1366574
H. Shahriari, R. Jalili
The spread of networks and their increasing complexity have complicated the task of security analysis. Accordingly, automatic verification approaches have received more attention recently. We have modeled a network, including a set of hosts (clients and servers), using the process algebra CSP (communicating sequential processes) in order to verify the Transmission Control Protocol (TCP) behavior against an active intruder. The model is verified using the FDR tool and, as a result, some attack scenarios which violate security are found. The scenarios show how an intruder can compromise the server trust to its clients. As the model is modular, extendable, and scalable, more complex attack scenarios (combinations of simple ones) can be detected using it.
{"title":"Using CSP to model and analyze Transmission Control Protocol vulnerabilities within the broadcast network","authors":"H. Shahriari, R. Jalili","doi":"10.1109/INCC.2004.1366574","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366574","url":null,"abstract":"The spread of networks and their increasing complexity have complicated the task of security analysis. Accordingly, automatic verification approaches have received more attention recently. We have modeled a network, including a set of hosts (clients and servers), using the process algebra CSP (communicating sequential processes) in order to verify the Transmission Control Protocol (TCP) behavior against an active intruder. The model is verified using the FDR tool and, as a result, some attack scenarios which violate security are found. The scenarios show how an intruder can compromise the server trust to its clients. As the model is modular, extendable, and scalable, more complex attack scenarios (combinations of simple ones) can be detected using it.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117112342","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-06-11DOI: 10.1109/INCC.2004.1366587
D. Pezaros, David Hutchison, Robert Gardner, Francisco Garcia, Joe Sventek
Next generation convergence networks require ubiquitous measurement mechanisms able to assess dynamically the performance quality characteristics experienced by the different, aggregated traffic flows traversing end-to-end Internet paths. Existing service measurements fall into two main categories: active and passive. The paper introduces a complementary technique called 'inline measurements' that makes use of the extendible features of the emerging IPv6. Through the exploitation of native IPv6 extension headers, measurement triggers and minimal measurement data may be carried in the same packets as the payload data itself, providing a high level of probability that the behaviour of the real user traffic flow is being observed. By adding measurement functionality natively, at the network (IPv6) layer, inline measurements can potentially target all transport and application services, providing an accurate performance evaluation framework for next generation networks. The paper also presents the results from a dynamically configurable prototype implementation in which end-to-end, one-way delay and delay variation of real-time video streams have been measured.
{"title":"Inline measurements: a native measurement technique for IPv6 networks","authors":"D. Pezaros, David Hutchison, Robert Gardner, Francisco Garcia, Joe Sventek","doi":"10.1109/INCC.2004.1366587","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366587","url":null,"abstract":"Next generation convergence networks require ubiquitous measurement mechanisms able to assess dynamically the performance quality characteristics experienced by the different, aggregated traffic flows traversing end-to-end Internet paths. Existing service measurements fall into two main categories: active and passive. The paper introduces a complementary technique called 'inline measurements' that makes use of the extendible features of the emerging IPv6. Through the exploitation of native IPv6 extension headers, measurement triggers and minimal measurement data may be carried in the same packets as the payload data itself, providing a high level of probability that the behaviour of the real user traffic flow is being observed. By adding measurement functionality natively, at the network (IPv6) layer, inline measurements can potentially target all transport and application services, providing an accurate performance evaluation framework for next generation networks. The paper also presents the results from a dynamically configurable prototype implementation in which end-to-end, one-way delay and delay variation of real-time video streams have been measured.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134367688","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-06-11DOI: 10.1109/INCC.2004.1366592
M. A. Tahir, A. Munawar, I. Taj
The paper focuses on a microprocessor implementation of the Hamming distance for binary correlation. It uses the fact that the binary correlation result can be derived from binary convolution (i.e., modeled with AND gates instead of XOR); as a result, convolution of multiple bits with multiple bits can be computed by a single multiplication instruction. This follows from a general proof for base-n convolution that is presented. Furthermore, using a hierarchical shift-addition approach, we can also reduce the number of additions in the subsequent step. The paper also shows that this approach can also be used in the frequency domain where an N/spl times/N point binary circular convolution can be modeled using an N/spl times/M double precision FFT, where M is a sub-multiple of N depending on the kernel size. Comparison of the time/frequency approaches is presented for different kernel/image sizes, with the help of benchmarking results.
{"title":"Efficient use of multipliers in microprocessor implementation of Hamming distance for binary sequence correlation","authors":"M. A. Tahir, A. Munawar, I. Taj","doi":"10.1109/INCC.2004.1366592","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366592","url":null,"abstract":"The paper focuses on a microprocessor implementation of the Hamming distance for binary correlation. It uses the fact that the binary correlation result can be derived from binary convolution (i.e., modeled with AND gates instead of XOR); as a result, convolution of multiple bits with multiple bits can be computed by a single multiplication instruction. This follows from a general proof for base-n convolution that is presented. Furthermore, using a hierarchical shift-addition approach, we can also reduce the number of additions in the subsequent step. The paper also shows that this approach can also be used in the frequency domain where an N/spl times/N point binary circular convolution can be modeled using an N/spl times/M double precision FFT, where M is a sub-multiple of N depending on the kernel size. Comparison of the time/frequency approaches is presented for different kernel/image sizes, with the help of benchmarking results.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131962258","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
扫码关注我们
求助内容：
应助结果提醒方式：