首页 > 最新文献

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)最新文献

英文 中文
Algorithms for the minimum partitioning problems in graphs 图中最小划分问题的算法
H. Nagamochi
In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non-negative weights for edges is divided into k subsets, the set of edges for which both endpoints are contained in different subsets is called a k-way cut or k-cut. The problem of obtaining the k-way cut that minimizes the sum of the weights is an important research topic that appears in many practical applications such as VLSI design. In this paper, the author introduces recent results including cases in which sets of terminals or sets of terminal pairs that are to be separated are further specified in this problem and cases in which the objects to be partitioned are extended from graphs to hypergraphs or submodular set functions. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 63– 78, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20341
在本文中,作者解释了图中最小划分问题算法的最新发展。当一个具有非负权边的图的顶点集被划分为k个子集时,两个端点都包含在不同子集中的边集称为k-way cut或k-cut。如何获得使权重总和最小的k路切割问题是在VLSI设计等许多实际应用中出现的一个重要研究课题。在本文中,作者介绍了最近的一些结果,包括在该问题中进一步规定了要分离的终端集或终端对集,以及将要划分的对象从图扩展到超图或子模集函数。©2007 Wiley期刊公司电子工程学报,2009,35 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20341
{"title":"Algorithms for the minimum partitioning problems in graphs","authors":"H. Nagamochi","doi":"10.1002/ECJC.20341","DOIUrl":"https://doi.org/10.1002/ECJC.20341","url":null,"abstract":"In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non-negative weights for edges is divided into k subsets, the set of edges for which both endpoints are contained in different subsets is called a k-way cut or k-cut. The problem of obtaining the k-way cut that minimizes the sum of the weights is an important research topic that appears in many practical applications such as VLSI design. In this paper, the author introduces recent results including cases in which sets of terminals or sets of terminal pairs that are to be separated are further specified in this problem and cases in which the objects to be partitioned are extended from graphs to hypergraphs or submodular set functions. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 63– 78, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20341","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"758 1","pages":"63-78"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77520119","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}
引用次数: 5
Evaluation of low‐quality images and imaging enhancement methods for fingerprint verification 评估低质量图像和图像增强方法的指纹验证
Hideyo Takeuchi, T. Umezaki, N. Matsumoto, K. Hirabayashi
A serious problem of fingerprint verification devices which are easily available on the market is how to handle ‘‘dry fingers,’’ which make the reading of fingerprints difficult and often result in incorrect verification. Dry fingers are frequently observed in the elderly and in housewives who are frequently engaged in wet work. In these cases, the observed fingerprint tends to become an eroded fingerprint image, with disconnected ridges. This paper proposes a method of handling eroded fingerprint images in which such images that will result in incorrect verification are automatically identified and the ridges are recovered rapidly. First, a method for image quality evaluation that consists of evaluating the noise in the fingerprint image is discussed and the effectiveness of the method is demonstrated. Then, simple ridge recovery is performed by using edge emphasis for images which are automatically judged to be eroded fingerprints. In the experiment, a fingerprint database was acquired in winter, when dry fingers are common. The acceptance rate for the right person (recognition rate) is found to be 94.8% when the rejection rate for other persons is set as 99.99%. When the ridges are recovered in fingerprint images whose quality is judged to be low by the image evaluation measure proposed in this paper, the recognition rate is improved to 96.2%. Furthermore, when tolerance to dry fingers is considered and verification is not performed for low-quality image judged to be difficult to recover, the recognition rate is improved to 97.2%. In environments in which few users have dry fingers, the recognition rate will be improved to 98.8% when the rejection rate for other persons is set as 99.99%. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 40– 53, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20345
市面上随处可见的指纹验证设备存在的一个严重问题是如何处理“干手指”,这使得指纹读取困难,往往导致验证错误。手指干燥在老年人和经常从事湿活的家庭主妇中很常见。在这些情况下,观察到的指纹往往成为侵蚀指纹图像,具有断开的脊。提出了一种自动识别可能导致验证错误的侵蚀指纹图像并快速恢复其纹路的方法。首先,讨论了一种基于噪声评价的指纹图像质量评价方法,并验证了该方法的有效性。然后,对自动判断为侵蚀指纹的图像,利用边缘强调进行简单的脊恢复;在实验中,指纹数据库是在冬季采集的,在冬季手指干燥是常见的。当对其他人的拒绝率设定为99.99%时,对合适人选的接受率(识别率)为94.8%。当采用本文提出的图像评价方法对质量较低的指纹图像进行纹线恢复时,识别率提高到96.2%。在考虑干手指容忍度,对判定为难以恢复的低质量图像不进行验证的情况下,识别率提高到97.2%。在很少用户干手指的环境下,当对其他人的拒绝率设置为99.99%时,识别率将提高到98.8%。©2007 Wiley期刊公司电子工程学报,2009,35 (3):393 - 393;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20345
{"title":"Evaluation of low‐quality images and imaging enhancement methods for fingerprint verification","authors":"Hideyo Takeuchi, T. Umezaki, N. Matsumoto, K. Hirabayashi","doi":"10.1002/ECJC.20345","DOIUrl":"https://doi.org/10.1002/ECJC.20345","url":null,"abstract":"A serious problem of fingerprint verification devices which are easily available on the market is how to handle ‘‘dry fingers,’’ which make the reading of fingerprints difficult and often result in incorrect verification. Dry fingers are frequently observed in the elderly and in housewives who are frequently engaged in wet work. In these cases, the observed fingerprint tends to become an eroded fingerprint image, with disconnected ridges. This paper proposes a method of handling eroded fingerprint images in which such images that will result in incorrect verification are automatically identified and the ridges are recovered rapidly. First, a method for image quality evaluation that consists of evaluating the noise in the fingerprint image is discussed and the effectiveness of the method is demonstrated. Then, simple ridge recovery is performed by using edge emphasis for images which are automatically judged to be eroded fingerprints. In the experiment, a fingerprint database was acquired in winter, when dry fingers are common. The acceptance rate for the right person (recognition rate) is found to be 94.8% when the rejection rate for other persons is set as 99.99%. When the ridges are recovered in fingerprint images whose quality is judged to be low by the image evaluation measure proposed in this paper, the recognition rate is improved to 96.2%. Furthermore, when tolerance to dry fingers is considered and verification is not performed for low-quality image judged to be difficult to recover, the recognition rate is improved to 97.2%. In environments in which few users have dry fingers, the recognition rate will be improved to 98.8% when the rejection rate for other persons is set as 99.99%. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 40– 53, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20345","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"33 1","pages":"40-53"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89154456","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}
引用次数: 8
Application of fingerprint identification technology to systems against inside information leaks and a proposal for its development form 指纹识别技术在防内幕信息泄露系统中的应用及其发展形式建议
Mitsuharu Kodama, T. Umezaki, Yukio Sato
Changes are occurring in the environment surrounding business organizations, such as the development of open networks and flexible migration of employees. In the context of such changes, it has recently been considered more important to prepare measures against information leaks from inside the organization. Among these, an urgent issue in ordinary organizations is to reinforce the existing business system so as to realize highly cost-effective security functions. This paper considers an actual case of information leakage as a model and systematically summarizes the conditions regarding security functions, based on the views of legal specialists. An actually introduced security system based on fingerprint identification is investigated, and it is shown that practical security measures can be established. A development configuration is then proposed in which part of the security system is placed in a data center and shared by multiple organizations. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 54– 62, 2007; Published online in Wiley InterScience (www.interscience.wiley. com). DOI 10.1002/ecjc.20346
商业组织周围的环境正在发生变化,例如开放式网络的发展和员工的灵活迁移。在这种变化的背景下,最近被认为更重要的是准备防止组织内部信息泄露的措施。其中,对现有业务系统进行加固,实现高性价比的安全功能,是普通组织急需解决的问题。本文以一个实际的信息泄露案例为模型,在法律专家观点的基础上,系统地总结了安全功能的条件。研究了一种实际引入的基于指纹识别的安全系统,并表明可以建立切实可行的安全措施。然后提出一种开发配置,其中安全系统的一部分放置在数据中心并由多个组织共享。©2007 Wiley期刊公司电子工程学报,2009,35 (3):444 - 444;在线发表于Wiley InterScience (www.interscience.wiley)。com)。DOI 10.1002 / ecjc.20346
{"title":"Application of fingerprint identification technology to systems against inside information leaks and a proposal for its development form","authors":"Mitsuharu Kodama, T. Umezaki, Yukio Sato","doi":"10.1002/ECJC.20346","DOIUrl":"https://doi.org/10.1002/ECJC.20346","url":null,"abstract":"Changes are occurring in the environment surrounding business organizations, such as the development of open networks and flexible migration of employees. In the context of such changes, it has recently been considered more important to prepare measures against information leaks from inside the organization. Among these, an urgent issue in ordinary organizations is to reinforce the existing business system so as to realize highly cost-effective security functions. This paper considers an actual case of information leakage as a model and systematically summarizes the conditions regarding security functions, based on the views of legal specialists. An actually introduced security system based on fingerprint identification is investigated, and it is shown that practical security measures can be established. A development configuration is then proposed in which part of the security system is placed in a data center and shared by multiple organizations. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 54– 62, 2007; Published online in Wiley InterScience (www.interscience.wiley. com). DOI 10.1002/ecjc.20346","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"84 1","pages":"54-62"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83556227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximum likelihood criterion based space‐time linear precoding method for eigenmode SNR increasing 基于极大似然准则的特征模信噪比增加的时空线性预编码方法
S. Narieda, K. Yamashita
This paper discusses a method for increasing the eigenmode SNR by using a space-time linear precoder designed on a maximum likelihood (ML) basis (henceforth called the space-time linear ML precoder). First, the effect of the length of the precoded signal generated in the ML precoder on the eigenmode SNR is studied. It is shown that the eigenmode SNR can be increased by varying the precoded signal length depending on the condition of the channel. Next, a transceiver configuration for increasing the eigenmode SNR by the space-time linear ML precoder is presented. In the proposed method, error propagation may be generated due to the transceiver configuration and the BER characteristics may be degraded, even if the eigenmode SNR is increased. In this paper, in order to reduce the effect of the error propagation on the BER characteristics, the relationship between the average length of the error propagation and the precoded signal length in the proposed configuration is presented. It is demonstrated that the effect of error propagation can be minimized by limiting the region of search for the precoded signal length. Finally, the effectiveness of the proposed method is verified by numerical simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 1– 8, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20304
本文讨论了一种利用基于极大似然(ML)基设计的时空线性预编码器(以下称为时空线性ML预编码器)来提高特征模信噪比的方法。首先,研究了ML预编码器中产生的预编码信号长度对特征模信噪比的影响。结果表明,根据信道条件改变预编码信号长度可以提高本征模信噪比。其次,提出了一种利用时空线性ML预编码器提高本征模信噪比的收发器结构。在所提出的方法中,即使增加特征模信噪比,也可能由于收发器的配置而产生错误传播,并且可能降低误码率特性。为了减小误差传播对误码率特性的影响,本文给出了误差传播平均长度与预编码信号长度之间的关系。结果表明,通过限制预编码信号长度的搜索区域,可以使误差传播的影响最小化。最后,通过数值仿真验证了所提方法的有效性。©2007 Wiley期刊公司电子工程学报,2009,35 (1):1 - 8;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20304
{"title":"Maximum likelihood criterion based space‐time linear precoding method for eigenmode SNR increasing","authors":"S. Narieda, K. Yamashita","doi":"10.1002/ECJC.20304","DOIUrl":"https://doi.org/10.1002/ECJC.20304","url":null,"abstract":"This paper discusses a method for increasing the eigenmode SNR by using a space-time linear precoder designed on a maximum likelihood (ML) basis (henceforth called the space-time linear ML precoder). First, the effect of the length of the precoded signal generated in the ML precoder on the eigenmode SNR is studied. It is shown that the eigenmode SNR can be increased by varying the precoded signal length depending on the condition of the channel. Next, a transceiver configuration for increasing the eigenmode SNR by the space-time linear ML precoder is presented. In the proposed method, error propagation may be generated due to the transceiver configuration and the BER characteristics may be degraded, even if the eigenmode SNR is increased. In this paper, in order to reduce the effect of the error propagation on the BER characteristics, the relationship between the average length of the error propagation and the precoded signal length in the proposed configuration is presented. It is demonstrated that the effect of error propagation can be minimized by limiting the region of search for the precoded signal length. Finally, the effectiveness of the proposed method is verified by numerical simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 1– 8, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20304","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"25 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86643471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The construction of periodically time‐variant convolutional codes using binary linear block codes 利用二进制线性分组码构造周期性时变卷积码
Naonori Ogasahara, Manabu Kobayashi, S. Hirasawa
In 1996 Rosenthal and York proposed (time-invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit. In this paper we propose a periodically time-variant convolutional code that can be constructed not only using the BCH parity check matrix but using the check matrix of any binary linear block code and show that the lower bound on the minimum free distance is guaranteed by the minimum free distance of the binary linear block code. In addition, taking 12 binary linear block codes as examples, we perform comparisons of the proposed codes with BCH convolutional codes using three evaluation criteria (minimum free distance, number of delay elements, coding rate) and show that there exist proposed codes that are superior to existing ones. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 31– 40, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20271
1996年Rosenthal和York提出了(时不变)BCH卷积码[4],其中使用了BCH码的奇偶校验矩阵来构造卷积码。BCH极限保证了BCH卷积码最小自由距离的下界。本文提出了一种周期时变卷积码,它不仅可以用BCH奇偶校验矩阵构造,而且可以用任意二进制线性分组码的校验矩阵构造,并证明了最小自由距离的下界是由二进制线性分组码的最小自由距离保证的。此外,以12个二进制线性分组码为例,采用最小自由距离、延迟元数、编码率三个评价标准,将所提出的码与BCH卷积码进行了比较,结果表明所提出的码优于现有的码。©2007 Wiley期刊公司电子工程学报,2009,31 (9):394 - 394;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20271
{"title":"The construction of periodically time‐variant convolutional codes using binary linear block codes","authors":"Naonori Ogasahara, Manabu Kobayashi, S. Hirasawa","doi":"10.1002/ECJC.20271","DOIUrl":"https://doi.org/10.1002/ECJC.20271","url":null,"abstract":"In 1996 Rosenthal and York proposed (time-invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit. In this paper we propose a periodically time-variant convolutional code that can be constructed not only using the BCH parity check matrix but using the check matrix of any binary linear block code and show that the lower bound on the minimum free distance is guaranteed by the minimum free distance of the binary linear block code. In addition, taking 12 binary linear block codes as examples, we perform comparisons of the proposed codes with BCH convolutional codes using three evaluation criteria (minimum free distance, number of delay elements, coding rate) and show that there exist proposed codes that are superior to existing ones. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 31– 40, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20271","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"49 3 1","pages":"31-40"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76334589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Overfitting of boosting and regularized Boosting algorithms 增强和正则化增强算法的过拟合
T. Onoda
The impressive generalization capacity of AdaBoost has been explained using the concept of a margin introduced in the context of support vector machines. However, this ability to generalize is limited to cases where the data does not include misclassification errors or significant amounts of noise. In addition, the research of Schapire and colleagues has served to provide theoretical support for these results from the perspective of improving margins. In this paper we propose a set of new algorithms, AdaBoostReg,ν-Arc, and ν-Boost, that attempt to avoid the overfitting that can occur with AdaBoost by introducing a normalization term into the objective function minimized by AdaBoost. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 69– 78, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20344
AdaBoost令人印象深刻的泛化能力已经用支持向量机背景下引入的边际概念来解释。然而,这种泛化能力仅限于数据不包含误分类错误或大量噪声的情况。此外,Schapire及其同事的研究从提高利润率的角度为这些结果提供了理论支持。在本文中,我们提出了一组新的算法,AdaBoostReg,ν-Arc和ν-Boost,它们试图通过在AdaBoost最小化的目标函数中引入归一化项来避免AdaBoost可能发生的过拟合。©2007 Wiley期刊公司电子工程学报,2009,29 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20344
{"title":"Overfitting of boosting and regularized Boosting algorithms","authors":"T. Onoda","doi":"10.1002/ECJC.20344","DOIUrl":"https://doi.org/10.1002/ECJC.20344","url":null,"abstract":"The impressive generalization capacity of AdaBoost has been explained using the concept of a margin introduced in the context of support vector machines. However, this ability to generalize is limited to cases where the data does not include misclassification errors or significant amounts of noise. In addition, the research of Schapire and colleagues has served to provide theoretical support for these results from the perspective of improving margins. In this paper we propose a set of new algorithms, AdaBoostReg,ν-Arc, and ν-Boost, that attempt to avoid the overfitting that can occur with AdaBoost by introducing a normalization term into the objective function minimized by AdaBoost. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 69– 78, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20344","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"19 1","pages":"69-78"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85930379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Fast aperiodic correlation algorithm for real-valued shift-orthogonal finite-length sequence of length 2ν+1 长度为2ν+1的实值移位正交有限长序列的快速非周期相关算法
Y. Tanada, Takahiro Matsumoto
Real-valued shift-orthogonal finite-length sequences are sequences in which the side lobes of the aperiodic autocorrelation function become 0, except for the endpoints of the shift to both sides, and can be applied in pulse compression radar and spread spectrum communications. In this paper, a fast correlation algorithm for efficiently calculating the periodic correlation function is discussed for real-valued shift-orthogonal finite-length sequences with length M=2ν+1. For input data, including a real-valued shift-orthogonal finite-length sequence over a certain range, the value of the aperiodic correlation function is found in a certain shift range. Based on the synthesis of this sequence by the convolution of ν+1 partial sequences, the correlation processing is broken down into correlation processing of the ν+1 stages of partial sequences. As a result, the number of multiplications and the number of additions can be suppressed on the order Mlog2M. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 18– 30, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20301
实值移位正交有限长序列是指除移向两侧的端点外,非周期自相关函数的旁瓣均为0的序列,可用于脉冲压缩雷达和扩频通信。本文讨论了长度为M=2ν+1的实值位移正交有限长序列周期相关函数的快速计算算法。对于输入数据,包括在一定范围内的实值位移-正交有限长序列,在一定的位移范围内找到非周期相关函数的值。在对该序列进行ν+1部分序列卷积合成的基础上,将相关处理分解为部分序列ν+1阶段的相关处理。因此,乘法的数量和加法的数量可以被抑制在Mlog2M的量级上。©2007 Wiley期刊公司电子工程学报,2009,35 (6):1145 - 1145;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20301
{"title":"Fast aperiodic correlation algorithm for real-valued shift-orthogonal finite-length sequence of length 2ν+1","authors":"Y. Tanada, Takahiro Matsumoto","doi":"10.1002/ECJC.20301","DOIUrl":"https://doi.org/10.1002/ECJC.20301","url":null,"abstract":"Real-valued shift-orthogonal finite-length sequences are sequences in which the side lobes of the aperiodic autocorrelation function become 0, except for the endpoints of the shift to both sides, and can be applied in pulse compression radar and spread spectrum communications. In this paper, a fast correlation algorithm for efficiently calculating the periodic correlation function is discussed for real-valued shift-orthogonal finite-length sequences with length M=2ν+1. For input data, including a real-valued shift-orthogonal finite-length sequence over a certain range, the value of the aperiodic correlation function is found in a certain shift range. Based on the synthesis of this sequence by the convolution of ν+1 partial sequences, the correlation processing is broken down into correlation processing of the ν+1 stages of partial sequences. As a result, the number of multiplications and the number of additions can be suppressed on the order Mlog2M. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 18– 30, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20301","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"38 1","pages":"18-30"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81507795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A study on an estimation system of inverse transfer function using adaptive filter estimating minimum‐phase and allpass transfer function 利用自适应滤波器估计最小相位和全通传递函数的逆传递函数估计系统的研究
Masaki Kobayashi, Y. Itoh, J. Okello
A structure is proposed for an adaptive system with an adaptive filter located before the unknown system (pre-inverse adaptive system) for estimation of the inverse of the transfer function (inverse transfer function) of the unknown system. In general, when an adaptive transversal filter is used as an adaptive filter, the delay signal of the output of the unknown system is needed in the adaptive algorithm for the weights. Since an adaptive filter is inserted in the front stage, this signal cannot be observed, so that a replica of the unknown system is needed. In this paper, an adaptive system that does not require this replica is discussed. Estimation of the inverse transfer function of the minimum phase of the unknown system is performed by an adaptive exponential filter and an inverse copy of the weights of the exponential filter placed in front of the unknown system. The signal within the adaptive algorithm consists of the observable input signal to the adaptive exponential filter and the estimation error. Estimation of the inverse transfer function for the allpass transfer function of the unknown system is performed by the adaptive transversal filter and the reversing copy of the weight to the transversal filter located before the unknown system. The signal in the adaptive system consists of the observable input signal to the exponential filter and the estimation error. Convergence of the weight is studied from the point of view of monotonic increase of the gradient. The unique feature of the approach is that the algorithm of the two adaptive filters consists of a gradient algorithm with guaranteed convergence for the weights and of copies of the weights after updating. Finally, a performance evaluation of the adaptive system and a comparison with conventional systems are performed by numerical simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 10– 17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20305
提出了一种自适应系统的结构,在未知系统(预逆自适应系统)前设置自适应滤波器,用于估计未知系统的传递函数逆(逆传递函数)。一般情况下,当采用自适应横向滤波器作为自适应滤波器时,在自适应算法中需要未知系统输出的延迟信号作为权重。由于在前级插入了自适应滤波器,因此无法观察到该信号,因此需要未知系统的副本。本文讨论了一种不需要复制的自适应系统。通过自适应指数滤波器和放置在未知系统前面的指数滤波器权值的逆拷贝来估计未知系统最小相位的逆传递函数。自适应算法中的信号由自适应指数滤波器的可观测输入信号和估计误差组成。通过自适应横向滤波器对未知系统的全通传递函数进行逆传递函数估计,并将权值反向复制到未知系统前的横向滤波器上。自适应系统中的信号由指数滤波器的可观测输入信号和估计误差组成。从梯度单调递增的角度研究了权值的收敛性。该方法的独特之处在于两个自适应滤波器的算法由保证权值收敛的梯度算法和更新后的权值副本算法组成。最后,通过数值仿真对自适应系统进行了性能评价,并与传统系统进行了比较。©2007 Wiley期刊公司电子工程学报,2009,35 (6):1145 - 1145;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20305
{"title":"A study on an estimation system of inverse transfer function using adaptive filter estimating minimum‐phase and allpass transfer function","authors":"Masaki Kobayashi, Y. Itoh, J. Okello","doi":"10.1002/ECJC.20305","DOIUrl":"https://doi.org/10.1002/ECJC.20305","url":null,"abstract":"A structure is proposed for an adaptive system with an adaptive filter located before the unknown system (pre-inverse adaptive system) for estimation of the inverse of the transfer function (inverse transfer function) of the unknown system. In general, when an adaptive transversal filter is used as an adaptive filter, the delay signal of the output of the unknown system is needed in the adaptive algorithm for the weights. Since an adaptive filter is inserted in the front stage, this signal cannot be observed, so that a replica of the unknown system is needed. In this paper, an adaptive system that does not require this replica is discussed. Estimation of the inverse transfer function of the minimum phase of the unknown system is performed by an adaptive exponential filter and an inverse copy of the weights of the exponential filter placed in front of the unknown system. The signal within the adaptive algorithm consists of the observable input signal to the adaptive exponential filter and the estimation error. Estimation of the inverse transfer function for the allpass transfer function of the unknown system is performed by the adaptive transversal filter and the reversing copy of the weight to the transversal filter located before the unknown system. The signal in the adaptive system consists of the observable input signal to the exponential filter and the estimation error. Convergence of the weight is studied from the point of view of monotonic increase of the gradient. The unique feature of the approach is that the algorithm of the two adaptive filters consists of a gradient algorithm with guaranteed convergence for the weights and of copies of the weights after updating. Finally, a performance evaluation of the adaptive system and a comparison with conventional systems are performed by numerical simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 10– 17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20305","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"104 1","pages":"10-17"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80818026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Design and evaluation of a system for running two coexisting Linux systems 设计和评估一个运行两个共存Linux系统的系统
Tabuchi Masaki, Ken Ichi Itoh, Y. Nomura, H. Taniguchi
A method to independently run two coexisting Linux systems on one computer is proposed. Up to the present time a virtual computer method has been used as a method to run multiple operating systems on one computer. This method has a problem, however, in which the guest operating system depends on the running state of the host operating system making it impossible to efficiently utilize the processing performance of each operating system. In contrast to this, because each operating system runs independently in the proposed method by time sharing the processes and exclusively dividing the other hardware resources, one of the operating systems and applications running on the operating systems are not influenced by the other operating system and the applications running on the operating system. This paper presents the proposed method and reports the results of performance evaluations when actually implemented in Linux. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 56– 68, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20343
提出了一种在一台计算机上独立运行两个共存的Linux系统的方法。到目前为止,虚拟计算机方法已被用作在一台计算机上运行多个操作系统的方法。但是,这种方法有一个问题,客户机操作系统依赖于主机操作系统的运行状态,因此无法有效地利用每个操作系统的处理性能。与此相反,由于在本文提出的方法中,每个操作系统通过分时进程和独占其他硬件资源来独立运行,因此其中一个操作系统和运行在该操作系统上的应用程序不受另一个操作系统和运行在该操作系统上的应用程序的影响。本文介绍了所提出的方法,并报告了在Linux中实际实现时的性能评估结果。©2007 Wiley期刊公司电子工程学报,2009,29 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20343
{"title":"Design and evaluation of a system for running two coexisting Linux systems","authors":"Tabuchi Masaki, Ken Ichi Itoh, Y. Nomura, H. Taniguchi","doi":"10.1002/ECJC.20343","DOIUrl":"https://doi.org/10.1002/ECJC.20343","url":null,"abstract":"A method to independently run two coexisting Linux systems on one computer is proposed. Up to the present time a virtual computer method has been used as a method to run multiple operating systems on one computer. This method has a problem, however, in which the guest operating system depends on the running state of the host operating system making it impossible to efficiently utilize the processing performance of each operating system. In contrast to this, because each operating system runs independently in the proposed method by time sharing the processes and exclusively dividing the other hardware resources, one of the operating systems and applications running on the operating systems are not influenced by the other operating system and the applications running on the operating system. This paper presents the proposed method and reports the results of performance evaluations when actually implemented in Linux. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 56– 68, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20343","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"50 1","pages":"56-68"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75819960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Fast rate‐distortion optimized coding mode decision for H.264 H.264的快速率失真优化编码模式决策
A. Tanizawa, Shin-ichiro Koto, Takeshi Chujoh
In H.264/MPEG-4 AVC a wide range of different prediction block forms and prediction signal generation methods are available. By selecting an optimal combination of coding modes from the multiple possible combinations of such modes, improvements in coding efficiency can be achieved. However, when using the rate-distortion optimized coding mode decision method based on the Lagrange multipliers, at the same time as seeing a significant improvement in coding efficiency, we are faced with the problem that the mode decision procedure becomes extremely demanding computationally. The H.264/MPEG-4 AVC high profile introduces adaptive block size transformations thereby making the number of combinations of coding mode that can be selected even larger than under the main profile. In this paper we investigate a method for hierarchically and adaptively reducing the number of mode combinations. Specifically we propose a method for quickly deciding the coding mode while limiting the reductions in coding efficiency by the correlation information between two mode decision cost functions in accordance with a quantization parameter. The results of experiments confirm that by using the proposed method, the encoding time excluding the motion search can be reduced by up to 4 times for the main profile and by up to 7 times for the high profile as compared to rate-distortion optimized coding mode decision. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 41– 55, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20342
在H.264/MPEG-4 AVC中,有各种不同的预测块形式和预测信号生成方法。通过从多种可能的编码模式组合中选择一种最优的编码模式组合,可以实现编码效率的提高。然而,在使用基于拉格朗日乘子的率失真优化编码模式决策方法时,在显著提高编码效率的同时,也面临着模式决策过程对计算量要求极高的问题。H.264/MPEG-4 AVC高调引入了自适应块大小转换,从而使得可以选择的编码模式组合的数量甚至比在主要配置文件下更大。本文研究了一种分层自适应减少模态组合数的方法。具体来说,我们提出了一种根据量化参数利用两种模式决策代价函数之间的相关信息来快速确定编码模式,同时限制编码效率降低的方法。实验结果表明,与基于率失真优化的编码模式决策相比,采用该方法剔除运动搜索后,主轮廓的编码时间最多减少4倍,高轮廓的编码时间最多减少7倍。©2007 Wiley期刊公司电子工程学报,2009,29 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20342
{"title":"Fast rate‐distortion optimized coding mode decision for H.264","authors":"A. Tanizawa, Shin-ichiro Koto, Takeshi Chujoh","doi":"10.1002/ECJC.20342","DOIUrl":"https://doi.org/10.1002/ECJC.20342","url":null,"abstract":"In H.264/MPEG-4 AVC a wide range of different prediction block forms and prediction signal generation methods are available. By selecting an optimal combination of coding modes from the multiple possible combinations of such modes, improvements in coding efficiency can be achieved. However, when using the rate-distortion optimized coding mode decision method based on the Lagrange multipliers, at the same time as seeing a significant improvement in coding efficiency, we are faced with the problem that the mode decision procedure becomes extremely demanding computationally. The H.264/MPEG-4 AVC high profile introduces adaptive block size transformations thereby making the number of combinations of coding mode that can be selected even larger than under the main profile. In this paper we investigate a method for hierarchically and adaptively reducing the number of mode combinations. Specifically we propose a method for quickly deciding the coding mode while limiting the reductions in coding efficiency by the correlation information between two mode decision cost functions in accordance with a quantization parameter. The results of experiments confirm that by using the proposed method, the encoding time excluding the motion search can be reduced by up to 4 times for the main profile and by up to 7 times for the high profile as compared to rate-distortion optimized coding mode decision. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 41– 55, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20342","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"26 1","pages":"41-55"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79376705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
期刊
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1