Pub Date : 2009-03-15DOI: 10.1109/PSCE.2009.4840123
A. Kazemi, S. Jamali, H. Shateri
This paper studies the effects of static synchronous series compensator (SSSC), one of the series connected flexible alternating current transmission system (FACTS) devices, on the measured impedance at the relaying point for faults on a double circuit transmission line in the case of the inter phase, phase to phase and three phase, faults. The measured impedance at the relaying point is affected by several factors, including the line pre-fault loading, structural conditions, and specially the fault resistance. In the presence of SSSC, in addition to its structural and controlling parameters, its installation point affects the measured impedance at the relaying point. The variation of the measured impedance for different SSSC installation points and controlling parameters would also be investigated.
{"title":"Measured impedance by distance relay for inter phase faults in presence of SSSC on a double circuit transmission line","authors":"A. Kazemi, S. Jamali, H. Shateri","doi":"10.1109/PSCE.2009.4840123","DOIUrl":"https://doi.org/10.1109/PSCE.2009.4840123","url":null,"abstract":"This paper studies the effects of static synchronous series compensator (SSSC), one of the series connected flexible alternating current transmission system (FACTS) devices, on the measured impedance at the relaying point for faults on a double circuit transmission line in the case of the inter phase, phase to phase and three phase, faults. The measured impedance at the relaying point is affected by several factors, including the line pre-fault loading, structural conditions, and specially the fault resistance. In the presence of SSSC, in addition to its structural and controlling parameters, its installation point affects the measured impedance at the relaying point. The variation of the measured impedance for different SSSC installation points and controlling parameters would also be investigated.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87629445","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}
This paper proposes a parallel architecture for a successive elimination algorithm (SEA), which is used in block matching motion estimation. SEA effectively eliminates the search points within the search window and thus decreases the number of matching evaluation instances that require very intensive computations compared to the standard full search algorithm (FSA). The proposed architecture for SEA decreases the time to calculate the motion vector by 57 percent compared to FSA. The performance while applying the SEA to several standard video clips has been shown to be same compared to the standard FSA. The proposed architecture uses 16 processing elements accompanied with use of intelligent data arrangement and memory configuration. A technique for reducing external memory accesses has also been developed. The proposed architecture for SEA provides an efficient solution for applications requiring real-time motion estimations. For, it serves to compute motion vectors in less amount of time while requiring almost same power and some increase in area compared to a similar architecture for implementing the full search algorithm. A register-transfer level implementation as well as simulation results on benchmark video clips are presented. Relevant design statistics on area and power for comparing between SEA and FSA implementations are also provided.
{"title":"A parallel architecture for successive elimination block matching algorithm","authors":"Kota Naga Srinivasarao Batta, I. Chakrabarti","doi":"10.1109/ICVGIP.2008.16","DOIUrl":"https://doi.org/10.1109/ICVGIP.2008.16","url":null,"abstract":"This paper proposes a parallel architecture for a successive elimination algorithm (SEA), which is used in block matching motion estimation. SEA effectively eliminates the search points within the search window and thus decreases the number of matching evaluation instances that require very intensive computations compared to the standard full search algorithm (FSA). The proposed architecture for SEA decreases the time to calculate the motion vector by 57 percent compared to FSA. The performance while applying the SEA to several standard video clips has been shown to be same compared to the standard FSA. The proposed architecture uses 16 processing elements accompanied with use of intelligent data arrangement and memory configuration. A technique for reducing external memory accesses has also been developed. The proposed architecture for SEA provides an efficient solution for applications requiring real-time motion estimations. For, it serves to compute motion vectors in less amount of time while requiring almost same power and some increase in area compared to a similar architecture for implementing the full search algorithm. A register-transfer level implementation as well as simulation results on benchmark video clips are presented. Relevant design statistics on area and power for comparing between SEA and FSA implementations are also provided.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76634352","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 : 2008-11-21DOI: 10.1109/TENCON.2008.4766575
Raghunath Babu Are
This paper presents the architecture and the VHDL design of an integer 2-D DCT used in the H.264/AVC. The 2-D DCT computation is performed by exploiting itpsilas orthogonality and separability property. The symmetry of the forward and inverse transform is used in this implementation. To reduce the computation overhead for the addition, subtraction and multiplication operations, we analyze the suitability of carry-free position independent residue number system (RNS) for the implementation of 2-D DCT. The implementation has been carried out in VHDL for Altera FPGA. We used the negative number representation in RNS, bit width analysis of the transforms and dedicated registers present in the Logic element of the FPGA to optimize the area. The complexity and efficiency analysis show that the proposed architecture could provide higher through-put.
{"title":"An RNS based transform architecture for H.264/AVC","authors":"Raghunath Babu Are","doi":"10.1109/TENCON.2008.4766575","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766575","url":null,"abstract":"This paper presents the architecture and the VHDL design of an integer 2-D DCT used in the H.264/AVC. The 2-D DCT computation is performed by exploiting itpsilas orthogonality and separability property. The symmetry of the forward and inverse transform is used in this implementation. To reduce the computation overhead for the addition, subtraction and multiplication operations, we analyze the suitability of carry-free position independent residue number system (RNS) for the implementation of 2-D DCT. The implementation has been carried out in VHDL for Altera FPGA. We used the negative number representation in RNS, bit width analysis of the transforms and dedicated registers present in the Logic element of the FPGA to optimize the area. The complexity and efficiency analysis show that the proposed architecture could provide higher through-put.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84818161","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 : 2008-11-19DOI: 10.1109/TENCON.2008.4766540
G. Santhosh Kumar, M. Vinu Paul, G. Athithan, K. Jacob
In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.
{"title":"Routing protocol enhancement for handling node mobility in wireless sensor networks","authors":"G. Santhosh Kumar, M. Vinu Paul, G. Athithan, K. Jacob","doi":"10.1109/TENCON.2008.4766540","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766540","url":null,"abstract":"In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77027551","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 : 2008-11-19DOI: 10.1109/TENCON.2008.4766471
Hosik Sohn, Hana Yoo, Young Bok Lee, C. Kim, W. D. Neve, Yong Man Ro
H.264/AVC scalable video coding (SVC) aims at providing high video quality to users in heterogeneous multimedia usage environments. In order to create an adapted bitstream in an optimal way, an adaptation decision-taking algorithm is needed. This algorithm has to take into account the capabilities and the constraints of the targeted usage environment, as well as the properties of the scalable bitstream. In this paper, description tools part of MPEG-21 digital item adaptation (DIA) are used to characterize usage environments and scalable bitstreams, such as usage environment description (UED), universal constraints description (UCD), and adaptation quality of service (AdaptationQoS). Further, we also propose an adaptation decision-taking algorithm for the exploitation of medium grain scalability (MGS) in SVC. This algorithm was implemented in an adaptation decision-taking engine (ADTE). Our experimental results demonstrate the efficiency of the proposed adaptation decision-taking algorithm for the exploitation of MGS in SVC.
{"title":"MPEG-21-based scalable bitstream adaptation using medium grain scalability","authors":"Hosik Sohn, Hana Yoo, Young Bok Lee, C. Kim, W. D. Neve, Yong Man Ro","doi":"10.1109/TENCON.2008.4766471","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766471","url":null,"abstract":"H.264/AVC scalable video coding (SVC) aims at providing high video quality to users in heterogeneous multimedia usage environments. In order to create an adapted bitstream in an optimal way, an adaptation decision-taking algorithm is needed. This algorithm has to take into account the capabilities and the constraints of the targeted usage environment, as well as the properties of the scalable bitstream. In this paper, description tools part of MPEG-21 digital item adaptation (DIA) are used to characterize usage environments and scalable bitstreams, such as usage environment description (UED), universal constraints description (UCD), and adaptation quality of service (AdaptationQoS). Further, we also propose an adaptation decision-taking algorithm for the exploitation of medium grain scalability (MGS) in SVC. This algorithm was implemented in an adaptation decision-taking engine (ADTE). Our experimental results demonstrate the efficiency of the proposed adaptation decision-taking algorithm for the exploitation of MGS in SVC.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84149121","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 : 2008-11-01DOI: 10.1109/TENCON.2008.4766621
A. Indra, V. Agrawal, V. Sarma
In this paper, we propose a stratified agent architecture for an autonomous earth imaging spacecraft to achieve higher levels of autonomy. The autonomous spacecraft should possess the self-adaptation and the self-healing capabilities, in addition to other fundamental autonomy requirements including reflex, awareness and self-regulation. The architecture is configured as stratified agent architecture with two strata. The upper stratum is concerned with the adaptive behaviour, which is achieved through an on-board mission planner. This stratum is in turn configured as hierarchical agent architecture. Hierarchical planning in a Petri net framework involves refinement of a transition in the upper layer using a Petri net model and searching for a valid plan using the reachability analysis technique. The lower stratum deals with the execution aspects and provides the reactive behaviour. It is configured with three peer level agents to achieve the reflex and the awareness properties. These agents follow a generic structure with perception, action, and communication components. The agent achieves the required autonomy capabilities by using an appropriate knowledge model. The uniqueness of the architecture is the utilisation of Petri net models, with varying degree of abstraction, in the various layers to represent the planning knowledge, diagnostic knowledge and the appropriate world model. In this paper, we present how the various capabilities for autonomy are achieved by the agent organisation by exploiting the Petri net models.
{"title":"Stratified agent architecture for on-board mission planning and execution for an autonomous spacecraft","authors":"A. Indra, V. Agrawal, V. Sarma","doi":"10.1109/TENCON.2008.4766621","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766621","url":null,"abstract":"In this paper, we propose a stratified agent architecture for an autonomous earth imaging spacecraft to achieve higher levels of autonomy. The autonomous spacecraft should possess the self-adaptation and the self-healing capabilities, in addition to other fundamental autonomy requirements including reflex, awareness and self-regulation. The architecture is configured as stratified agent architecture with two strata. The upper stratum is concerned with the adaptive behaviour, which is achieved through an on-board mission planner. This stratum is in turn configured as hierarchical agent architecture. Hierarchical planning in a Petri net framework involves refinement of a transition in the upper layer using a Petri net model and searching for a valid plan using the reachability analysis technique. The lower stratum deals with the execution aspects and provides the reactive behaviour. It is configured with three peer level agents to achieve the reflex and the awareness properties. These agents follow a generic structure with perception, action, and communication components. The agent achieves the required autonomy capabilities by using an appropriate knowledge model. The uniqueness of the architecture is the utilisation of Petri net models, with varying degree of abstraction, in the various layers to represent the planning knowledge, diagnostic knowledge and the appropriate world model. In this paper, we present how the various capabilities for autonomy are achieved by the agent organisation by exploiting the Petri net models.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74421442","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 : 2008-11-01DOI: 10.1109/TENCON.2008.4766661
V. Sagar, D. Das
Multi-hop relay based WiMAX architecture is one of the proposed solutions to connectivity in difficult terrains and an economical solution for developing/under-developed countries. This paper analyzes a hybrid multi-hop architecture consists of mesh and PMP both types of connections. Architecture for relay station (RS) has been proposed to provide such hybrid connectivity. Moreover, to provide end-to-end delay guarantee in such multi-hop networks a novel-scheduling algorithm, modified earliest deadline first (MEDF) has been proposed. MEDF provides fairness along with per hop delay guarantees among flows with different delay requirements. Extensive simulation and analysis of MEDF has been done. Results are compared with earliest deadline first (EDF) scheduling under similar scenario, which shows that MEDF is able to provide better end-to-end delay performance. MEDF also ensures the difference between average end-to-end delay of voice and video packets of video-conferencing session is within prescribed delay limit (i.e. within 30 msec) of quality of perception (QoP).
{"title":"Modified EDF algorithm and WiMAX architecture to ensure end-to-end delay in multi-hop networks","authors":"V. Sagar, D. Das","doi":"10.1109/TENCON.2008.4766661","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766661","url":null,"abstract":"Multi-hop relay based WiMAX architecture is one of the proposed solutions to connectivity in difficult terrains and an economical solution for developing/under-developed countries. This paper analyzes a hybrid multi-hop architecture consists of mesh and PMP both types of connections. Architecture for relay station (RS) has been proposed to provide such hybrid connectivity. Moreover, to provide end-to-end delay guarantee in such multi-hop networks a novel-scheduling algorithm, modified earliest deadline first (MEDF) has been proposed. MEDF provides fairness along with per hop delay guarantees among flows with different delay requirements. Extensive simulation and analysis of MEDF has been done. Results are compared with earliest deadline first (EDF) scheduling under similar scenario, which shows that MEDF is able to provide better end-to-end delay performance. MEDF also ensures the difference between average end-to-end delay of voice and video packets of video-conferencing session is within prescribed delay limit (i.e. within 30 msec) of quality of perception (QoP).","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73246107","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 : 2008-11-01DOI: 10.1109/TENCON.2008.4766693
Q. Mamun, S. Ramakrishnan, B. Srinivasan
Resource-constraint nature of wireless sensor network (WSN) makes the security issue certainly a big challenge. An efficient key management scheme is the pre-requisite to ensure security in WSN. In this paper we present a secured key management protocol (SecCOSEN) adopted on COSEN, a chain oriented sensor network, which is used for periodic data collection. SecCOSEN uses partial key pre-distribution and symmetric cryptography techniques. SecCOSEN shows high resilience to different security attacks. The protocol outperforms other random key pre-distribution protocols in the sense that it requires lower space, lower communication overhead and offers very high session key candidates.
{"title":"An efficient partial key pre-distribution scheme for chain oriented sensor networks","authors":"Q. Mamun, S. Ramakrishnan, B. Srinivasan","doi":"10.1109/TENCON.2008.4766693","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766693","url":null,"abstract":"Resource-constraint nature of wireless sensor network (WSN) makes the security issue certainly a big challenge. An efficient key management scheme is the pre-requisite to ensure security in WSN. In this paper we present a secured key management protocol (SecCOSEN) adopted on COSEN, a chain oriented sensor network, which is used for periodic data collection. SecCOSEN uses partial key pre-distribution and symmetric cryptography techniques. SecCOSEN shows high resilience to different security attacks. The protocol outperforms other random key pre-distribution protocols in the sense that it requires lower space, lower communication overhead and offers very high session key candidates.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75345851","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 : 2008-11-01DOI: 10.1109/TENCON.2008.4766837
Prashanth Pai, Mohammed Zafar Ali Khan
Antenna diversity techniques are used in wireless systems to combat the effects of fading. Signals from multiple receiver antennas are combined to achieve an improved average SNR. Maximal ratio combining (MRC) technique is known to give a better SNR gain than selection combining (SC) technique. This improved performance of MRC comes at the cost of multiple receiver chains which implies increased receiver complexity and cost. In this paper we compare SC with MRC in terms of receiver area and power cost. We show that for the same bit-error rate (BER) performance, SC requires considerably lower receiver area and power consumption.
{"title":"Comparison of SC and MRC receiver complexity for two antennas","authors":"Prashanth Pai, Mohammed Zafar Ali Khan","doi":"10.1109/TENCON.2008.4766837","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766837","url":null,"abstract":"Antenna diversity techniques are used in wireless systems to combat the effects of fading. Signals from multiple receiver antennas are combined to achieve an improved average SNR. Maximal ratio combining (MRC) technique is known to give a better SNR gain than selection combining (SC) technique. This improved performance of MRC comes at the cost of multiple receiver chains which implies increased receiver complexity and cost. In this paper we compare SC with MRC in terms of receiver area and power cost. We show that for the same bit-error rate (BER) performance, SC requires considerably lower receiver area and power consumption.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73862868","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 : 2008-11-01DOI: 10.1109/TENCON.2008.4766469
K.R. Kumar, P. Ramaiah
The Auditory Prosthesis (AP) is an electronic device that is designed to provide hearing sensations to people who are profoundly deaf. The AP mimics the normal hearing operation by stimulating the auditory nerve with an electric current allowing the hearing impaired persons to understand the speech. The AP system consists of two functional units namely Body Worn Speech Processor (BWSP) and Receiver Stimulator. The laboratory model BWSP is available. The prototype model Receiver Stimulator for Auditory Prosthesis(RSAP) consists of High-speed Microcontroller DS89C420 based Speech Decoder, DAC, ADC, constant current stimulator, encoder, combinational circuit for channel selection, switch matrix and simulated resistance array. The laboratory model speech processor is used to implement the Continuous Interleaved Sampling (CIS) speech processing algorithm which generates the information required for stimulation based on the audio information. Speech Decoder receives the encoded speech data via RF transcutaneous from speech processor. The speech data format and generation of biphasic stimulation pulses based on the CIS stimulation strategy are covered. Multi-channel auditory Prosthesis with eight electrodes that are simulated as resistance array can be driven by the prototype auditory Prosthesis for testing its performance. The implementation aspects of CIS algorithm are validated using the test data of speech samples generated by the laboratory model Body worn speech processor. The results are presented using prototype model of auditory Prosthesis and simulated electrode resistance array with a high-speed data acquisition system and found satisfactory results.
{"title":"Microcontroller based receiver stimulator for auditory prosthesis","authors":"K.R. Kumar, P. Ramaiah","doi":"10.1109/TENCON.2008.4766469","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766469","url":null,"abstract":"The Auditory Prosthesis (AP) is an electronic device that is designed to provide hearing sensations to people who are profoundly deaf. The AP mimics the normal hearing operation by stimulating the auditory nerve with an electric current allowing the hearing impaired persons to understand the speech. The AP system consists of two functional units namely Body Worn Speech Processor (BWSP) and Receiver Stimulator. The laboratory model BWSP is available. The prototype model Receiver Stimulator for Auditory Prosthesis(RSAP) consists of High-speed Microcontroller DS89C420 based Speech Decoder, DAC, ADC, constant current stimulator, encoder, combinational circuit for channel selection, switch matrix and simulated resistance array. The laboratory model speech processor is used to implement the Continuous Interleaved Sampling (CIS) speech processing algorithm which generates the information required for stimulation based on the audio information. Speech Decoder receives the encoded speech data via RF transcutaneous from speech processor. The speech data format and generation of biphasic stimulation pulses based on the CIS stimulation strategy are covered. Multi-channel auditory Prosthesis with eight electrodes that are simulated as resistance array can be driven by the prototype auditory Prosthesis for testing its performance. The implementation aspects of CIS algorithm are validated using the test data of speech samples generated by the laboratory model Body worn speech processor. The results are presented using prototype model of auditory Prosthesis and simulated electrode resistance array with a high-speed data acquisition system and found satisfactory results.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74321447","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
扫码关注我们
求助内容：
应助结果提醒方式：