首页 > 最新文献

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

英文 中文
How to derive a quantum complexity lower bound 如何导出量子复杂度下界
Tetsuro Nishino

The modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20298

使用逻辑电路的计算建模在包括量子复杂度理论在内的复杂度理论基础中占有重要地位。因此,对计算量子电路上的逻辑函数以及最小化和简化这种电路的方法的研究变得极其重要。在本文中,我们明确地公式化了量子逻辑电路的深度最小化问题,并表明这个问题与导出量子逻辑电路大小下界的几何方法密切相关。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(10):2007年9月17日;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20298
{"title":"How to derive a quantum complexity lower bound","authors":"Tetsuro Nishino","doi":"10.1002/ecjc.20298","DOIUrl":"https://doi.org/10.1002/ecjc.20298","url":null,"abstract":"<p>The modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20298</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 10","pages":"9-17"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20298","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976121","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
Stochastic complexity of complete bipartite graph-type Boltzmann machines in mean field approximation 完全二分图型Boltzmann机在平均场近似中的随机复杂性
Yu Nishiyama, Sumio Watanabe

A variational Bayes method is proposed as an approximation method for implementing Bayesian posterior distribution with moderate computational complexity. Its effectiveness for real problems has been confirmed. The variational Bayes method is a method which generalizes the mean field approximation used in calculating partition functions in statistical physics. In recent years, the mathematical properties of the precision with which it is approximated have been investigated. In this paper, the authors consider the asymptotic stochastic complexity in the case of applying the mean field approximation to complete bipartite graph-type Boltzmann machines and theoretically derive that asymptotic form. Also, based on the results, the authors quantitatively consider the difference between Bayesian posterior distribution and the posterior distribution of the mean field approximation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20307

提出了一种变分贝叶斯方法作为实现具有中等计算复杂度的贝叶斯后验分布的近似方法。它对实际问题的有效性已经得到证实。变分贝叶斯方法是一种推广统计物理中用于计算配分函数的平均场近似的方法。近年来,人们对其近似精度的数学性质进行了研究。在本文中,作者考虑了将平均场近似应用于完全二部图型Boltzmann机的情况下的渐近随机复杂性,并从理论上推导了它的渐近形式,定量地考虑了贝叶斯后验分布与平均场近似后验分布之间的差异。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(9):2007年1月9日;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20307
{"title":"Stochastic complexity of complete bipartite graph-type Boltzmann machines in mean field approximation","authors":"Yu Nishiyama,&nbsp;Sumio Watanabe","doi":"10.1002/ecjc.20307","DOIUrl":"https://doi.org/10.1002/ecjc.20307","url":null,"abstract":"<p>A variational Bayes method is proposed as an approximation method for implementing Bayesian posterior distribution with moderate computational complexity. Its effectiveness for real problems has been confirmed. The variational Bayes method is a method which generalizes the mean field approximation used in calculating partition functions in statistical physics. In recent years, the mathematical properties of the precision with which it is approximated have been investigated. In this paper, the authors consider the asymptotic stochastic complexity in the case of applying the mean field approximation to complete bipartite graph-type Boltzmann machines and theoretically derive that asymptotic form. Also, based on the results, the authors quantitatively consider the difference between Bayesian posterior distribution and the posterior distribution of the mean field approximation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20307</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 9","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20307","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976122","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
Characterization of sonochemical reactors by chemical dosimetry 声化学反应器的化学剂量测定表征
Yoshiyuki Asakura, Masahiro Maebayashi, Tatsuro Matsuoka, Shinobu Koda

Irradiation of ultrasonic waves induces cavitation in a solution, and a chemical action instigated by radicals occurs. This chemical action is reported to be most efficient in the region of several hundred kilohertz frequencies. Application of sonochemistry based on ultrasonic chemical action remains at the laboratory scale and has not yet reached the industrial practical scale. In order to realize practical applications of sonochemistry, there is a need to scale-up the sonochemical reactors. For this purpose, we used a 490-kHz cylindrical sonochemical reactor that is long in the irradiation direction, and used potassium iodide (KI) dosimetry, sonochemical luminescence, and calorimetry to evaluate the sonochemical reaction efficiency and reaction field of the reactor. We performed the evaluation with the ultrasonic irradiation direction in the horizontal and vertical directions. As a result, we observed sonochemical luminescence and a rise in temperature near the reflection surface, for both the horizontal and vertical irradiation. For the horizontal irradiation, the I3 concentration was evenly distributed in the irradiation direction. Moreover, we found that the sonochemical reaction efficiency was the same for both the horizontal irradiation and the vertical irradiation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 1– 8, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20315

超声波的照射会在溶液中引发空化,并发生由自由基引发的化学作用。据报道,这种化学作用在几百千赫兹的频率范围内最有效。基于超声化学作用的声化学应用仍停留在实验室规模,尚未达到工业实用规模。为了实现声化学的实际应用,需要扩大声化学反应器的规模。为此,我们使用了一个在辐射方向上较长的490kHz圆柱形声化学反应器,并使用碘化钾(KI)剂量测定、声化学发光和量热法来评估反应器的声化学反应效率和反应场。我们用水平和垂直方向上的超声照射方向进行了评估。结果,对于水平和垂直照射,我们观察到反射表面附近的声化学发光和温度升高。对于水平照射,I3−浓度在照射方向上均匀分布。此外,我们发现水平辐射和垂直辐射的声化学反应效率是相同的。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(8):2007年1月8日;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20315
{"title":"Characterization of sonochemical reactors by chemical dosimetry","authors":"Yoshiyuki Asakura,&nbsp;Masahiro Maebayashi,&nbsp;Tatsuro Matsuoka,&nbsp;Shinobu Koda","doi":"10.1002/ecjc.20315","DOIUrl":"https://doi.org/10.1002/ecjc.20315","url":null,"abstract":"<p>Irradiation of ultrasonic waves induces cavitation in a solution, and a chemical action instigated by radicals occurs. This chemical action is reported to be most efficient in the region of several hundred kilohertz frequencies. Application of sonochemistry based on ultrasonic chemical action remains at the laboratory scale and has not yet reached the industrial practical scale. In order to realize practical applications of sonochemistry, there is a need to scale-up the sonochemical reactors. For this purpose, we used a 490-kHz cylindrical sonochemical reactor that is long in the irradiation direction, and used potassium iodide (KI) dosimetry, sonochemical luminescence, and calorimetry to evaluate the sonochemical reaction efficiency and reaction field of the reactor. We performed the evaluation with the ultrasonic irradiation direction in the horizontal and vertical directions. As a result, we observed sonochemical luminescence and a rise in temperature near the reflection surface, for both the horizontal and vertical irradiation. For the horizontal irradiation, the I<sub>3</sub><sup>−</sup> concentration was evenly distributed in the irradiation direction. Moreover, we found that the sonochemical reaction efficiency was the same for both the horizontal irradiation and the vertical irradiation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 1– 8, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20315</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 8","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20315","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71977091","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}
引用次数: 17
Algorithms for the minimum partitioning problems in graphs 图中最小划分问题的算法
Hiroshi 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向割或k割。在VLSI设计等许多实际应用中,获得最小化权重之和的k路切割问题是一个重要的研究课题。在本文中,作者介绍了最近的结果,包括在这个问题中进一步指定了要分离的端子集或端子对集的情况,以及将要划分的对象从图扩展到超图或子模集函数的情况。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(10):63–782007;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20341
{"title":"Algorithms for the minimum partitioning problems in graphs","authors":"Hiroshi Nagamochi","doi":"10.1002/ecjc.20341","DOIUrl":"https://doi.org/10.1002/ecjc.20341","url":null,"abstract":"<p>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 <i>k</i> subsets, the set of edges for which both endpoints are contained in different subsets is called a <i>k</i>-way cut or <i>k</i>-cut. The problem of obtaining the <i>k</i>-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</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 10","pages":"63-78"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20341","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976118","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}
引用次数: 6
Design and evaluation of a system for running two coexisting Linux systems 运行两个共存Linux系统的系统的设计与评估
Masaki Tabuchi, Ken-Ichi Itoh, Yoshinari Nomura, Hideo 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 Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(9):56-682007;在线发表于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":"Masaki Tabuchi,&nbsp;Ken-Ichi Itoh,&nbsp;Yoshinari Nomura,&nbsp;Hideo Taniguchi","doi":"10.1002/ecjc.20343","DOIUrl":"https://doi.org/10.1002/ecjc.20343","url":null,"abstract":"<p>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</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 9","pages":"56-68"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20343","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976126","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的快速率失真优化编码模式决策
Akiyuki Tanizawa, Shinichiro 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-4AVC中,广泛的不同预测块形式和预测信号生成方法是可用的。通过从编码模式的多个可能组合中选择编码模式的最佳组合,可以实现编码效率的提高。然而,当使用基于拉格朗日乘子的率失真优化编码模式决策方法时,在看到编码效率显著提高的同时,我们面临着模式决策过程在计算上变得极其苛刻的问题。H.264/MPEG-4AVC高简档引入了自适应块大小变换,从而使得可以选择的编码模式的组合的数量甚至比在主简档下更大。在本文中,我们研究了一种分层自适应地减少模式组合数量的方法。具体地,我们提出了一种用于快速决定编码模式的方法,同时通过根据量化参数的两个模式决定成本函数之间的相关信息来限制编码效率的降低。实验结果证实,与率失真优化编码模式决策相比,通过使用所提出的方法,对于主简档,排除运动搜索的编码时间可以减少多达4倍,对于高简档,可以减少多达7倍。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(9):41-552007;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20342
{"title":"Fast rate-distortion optimized coding mode decision for H.264","authors":"Akiyuki Tanizawa,&nbsp;Shinichiro Koto,&nbsp;Takeshi Chujoh","doi":"10.1002/ecjc.20342","DOIUrl":"https://doi.org/10.1002/ecjc.20342","url":null,"abstract":"<p>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</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 9","pages":"41-55"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20342","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976127","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
Resolution enhancement of digital images with data-dependent biasing 基于数据相关偏置的数字图像分辨率增强
Yasuaki Okamoto, Akira Taguchi, Masamitsu Tokuda

In the information and communications field, digital images have come to be widely used in mobile communications devices, and digital image processing is very important. Because of the different resolutions of the displays and output devices in each terminal, digital images undergo reduction and enlargement processing very frequently. Conventionally, reduction and enlargement processing is performed using an interpolation algorithm based on the sinc function. However, because the frequency band increases when digital images are enlarged, an enlarged image of sufficient quality cannot be attained through interpolation. In recent years, an enlargement method has been proposed which uses estimation of the frequency bands (high-frequency components) which increase with the enlargement of a digital image. The authors have also clarified interpolation algorithms using the preservation of step edge signals, coordinate point warping for generating peak signals, and signal amplitude biasing. They have implemented an interpolation algorithm which produces high-frequency components. In calculating the bias in this method, the smaller of the biases found to either side of the interpolation is selected. This choice is not necessarily optimal; the larger bias should be selected depending on certain conditions. For example, the selection of the larger bias makes it possible to preserve the precipitous changes in a step edge signal. This makes it possible to preserve step edge signals and generate peaks, without also using coordinate point warping, by selecting the optimal bias according to local information. The proposed interpolation algorithm using data-dependent biasing was compared to an interpolation algorithm using coordinate point warping and signal amplitude biasing. The proposed algorithm was found to have a similar performance and clearly shown to be a method with low computational complexity. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 18–28, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20306

在信息和通信领域,数字图像已被广泛应用于移动通信设备中,数字图像处理非常重要。由于每个终端中的显示器和输出设备的分辨率不同,数字图像非常频繁地进行缩小和放大处理。传统上,使用基于sinc函数的插值算法来执行缩小和放大处理。然而,由于当数字图像被放大时频带增加,所以不能通过插值获得足够质量的放大图像。近年来,已经提出了一种放大方法,该方法使用对随着数字图像的放大而增加的频带(高频分量)的估计。作者还阐明了使用阶跃边缘信号的保留、用于生成峰值信号的坐标点扭曲和信号幅度偏置的插值算法。他们已经实现了一种产生高频分量的插值算法。在计算这种方法中的偏差时,选择插值两侧的偏差中较小的一个。这种选择不一定是最优的;应该根据某些条件来选择较大的偏置。例如,选择较大的偏置使得可以保持阶跃边缘信号中的陡峭变化。这使得可以通过根据局部信息选择最佳偏置来保持阶跃边缘信号并生成峰值,而无需使用坐标点扭曲。将所提出的使用数据相关偏置的插值算法与使用坐标点扭曲和信号幅度偏置的插值方法进行了比较。所提出的算法被发现具有类似的性能,并且清楚地表明是一种计算复杂度较低的方法。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(8):2007年18月28日;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20306
{"title":"Resolution enhancement of digital images with data-dependent biasing","authors":"Yasuaki Okamoto,&nbsp;Akira Taguchi,&nbsp;Masamitsu Tokuda","doi":"10.1002/ecjc.20306","DOIUrl":"https://doi.org/10.1002/ecjc.20306","url":null,"abstract":"<p>In the information and communications field, digital images have come to be widely used in mobile communications devices, and digital image processing is very important. Because of the different resolutions of the displays and output devices in each terminal, digital images undergo reduction and enlargement processing very frequently. Conventionally, reduction and enlargement processing is performed using an interpolation algorithm based on the sinc function. However, because the frequency band increases when digital images are enlarged, an enlarged image of sufficient quality cannot be attained through interpolation. In recent years, an enlargement method has been proposed which uses estimation of the frequency bands (high-frequency components) which increase with the enlargement of a digital image. The authors have also clarified interpolation algorithms using the preservation of step edge signals, coordinate point warping for generating peak signals, and signal amplitude biasing. They have implemented an interpolation algorithm which produces high-frequency components. In calculating the bias in this method, the smaller of the biases found to either side of the interpolation is selected. This choice is not necessarily optimal; the larger bias should be selected depending on certain conditions. For example, the selection of the larger bias makes it possible to preserve the precipitous changes in a step edge signal. This makes it possible to preserve step edge signals and generate peaks, without also using coordinate point warping, by selecting the optimal bias according to local information. The proposed interpolation algorithm using data-dependent biasing was compared to an interpolation algorithm using coordinate point warping and signal amplitude biasing. The proposed algorithm was found to have a similar performance and clearly shown to be a method with low computational complexity. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 18–28, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20306</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 8","pages":"18-28"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20306","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71977092","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
Neuro-hardware for peak power reduction of oversampled OFDM signal 用于降低过采样OFDM信号峰值功率的神经硬件
Atsushi Mori, Masaya Ohta, Katsumi Yamashita

OFDM communication system has recently been attracting attention because of its features of high spectrum efficiency and robustness in a multipath environment. The OFDM signal often exhibits a high peak power. It is important to reduce the peak power, since communication quality is degraded and unnecessary outband power radiation is produced when such a signal is amplified by a nonlinear amplifier. This paper considers the peak power suppression problem in an oversampled OFDM signal and presents a solution using a mutually coupled neural network. The peak power suppression performance of the proposed method and the accompanying reduction of the outband radiation power and the bit error rate are evaluated by numerical experiments. Neuro-hardware which can handle the peak power suppression process in real time is experimentally constructed, and its performance is evaluated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 54– 62, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20285

OFDM通信系统由于其在多径环境中具有高频谱效率和鲁棒性的特点,近年来引起了人们的关注。OFDM信号经常表现出高峰值功率。降低峰值功率是重要的,因为当这样的信号被非线性放大器放大时,通信质量降低并且产生不必要的带外功率辐射。本文考虑了过采样OFDM信号中的峰值功率抑制问题,并提出了一种使用相互耦合的神经网络的解决方案。通过数值实验评估了所提出方法的峰值功率抑制性能以及带外辐射功率和误码率的降低。实验构建了能够实时处理峰值功率抑制过程的神经硬件,并对其性能进行了评估。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(8):54–62007;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20285
{"title":"Neuro-hardware for peak power reduction of oversampled OFDM signal","authors":"Atsushi Mori,&nbsp;Masaya Ohta,&nbsp;Katsumi Yamashita","doi":"10.1002/ecjc.20285","DOIUrl":"https://doi.org/10.1002/ecjc.20285","url":null,"abstract":"<p>OFDM communication system has recently been attracting attention because of its features of high spectrum efficiency and robustness in a multipath environment. The OFDM signal often exhibits a high peak power. It is important to reduce the peak power, since communication quality is degraded and unnecessary outband power radiation is produced when such a signal is amplified by a nonlinear amplifier. This paper considers the peak power suppression problem in an oversampled OFDM signal and presents a solution using a mutually coupled neural network. The peak power suppression performance of the proposed method and the accompanying reduction of the outband radiation power and the bit error rate are evaluated by numerical experiments. Neuro-hardware which can handle the peak power suppression process in real time is experimentally constructed, and its performance is evaluated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 54– 62, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20285</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 8","pages":"54-62"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20285","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71977094","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
Stochastic complexity of complete bipartite graph-type Boltzmann machines in mean field approximation 平均场近似下完全二部图型玻尔兹曼机的随机复杂度
Yu Nishiyama, Sumio Watanabe
A variational Bayes method is proposed as an approximation method for implementing Bayesian posterior distribution with moderate computational complexity. Its effectiveness for real problems has been confirmed. The variational Bayes method is a method which generalizes the mean field approximation used in calculating partition functions in statistical physics. In recent years, the mathematical properties of the precision with which it is approximated have been investigated. In this paper, the authors consider the asymptotic stochastic complexity in the case of applying the mean field approximation to complete bipartite graph-type Boltzmann machines and theoretically derive that asymptotic form. Also, based on the results, the authors quantitatively consider the difference between Bayesian posterior distribution and the posterior distribution of the mean field approximation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20307
提出了一种变分贝叶斯方法,作为实现贝叶斯后验分布的近似方法,计算复杂度适中。它对实际问题的有效性已得到证实。变分贝叶斯方法是统计物理中用于计算配分函数的平均场近似的一种推广方法。近年来,人们研究了用来逼近它的精度的数学性质。本文考虑了用平均场近似求解完全二部图型玻尔兹曼机的渐近随机复杂度,并从理论上推导了该渐近形式。在此基础上,定量地考虑了贝叶斯后验分布与平均场近似后验分布的区别。©2007 Wiley期刊公司电子工程学报,2009,29 (1):1 - 9;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20307
{"title":"Stochastic complexity of complete bipartite graph-type Boltzmann machines in mean field approximation","authors":"Yu Nishiyama, Sumio Watanabe","doi":"10.1002/ECJC.20307","DOIUrl":"https://doi.org/10.1002/ECJC.20307","url":null,"abstract":"A variational Bayes method is proposed as an approximation method for implementing Bayesian posterior distribution with moderate computational complexity. Its effectiveness for real problems has been confirmed. The variational Bayes method is a method which generalizes the mean field approximation used in calculating partition functions in statistical physics. In recent years, the mathematical properties of the precision with which it is approximated have been investigated. In this paper, the authors consider the asymptotic stochastic complexity in the case of applying the mean field approximation to complete bipartite graph-type Boltzmann machines and theoretically derive that asymptotic form. Also, based on the results, the authors quantitatively consider the difference between Bayesian posterior distribution and the posterior distribution of the mean field approximation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20307","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"46 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73352500","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
How to derive a quantum complexity lower bound 如何推导出量子复杂度的下界
T. Nishino
The modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20298
逻辑电路计算建模在包括量子复杂性理论在内的复杂性理论基础中占有重要地位。因此,研究在量子电路上计算逻辑函数的方法以及最小化和简化这种电路变得极其重要。本文明确地表述了量子逻辑电路的深度最小化问题,并表明该问题与推导量子逻辑电路尺寸下界的几何方法密切相关。©2007 Wiley期刊公司电子工程学报,2009,29 (3):397 - 397;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20298
{"title":"How to derive a quantum complexity lower bound","authors":"T. Nishino","doi":"10.1002/ECJC.20298","DOIUrl":"https://doi.org/10.1002/ECJC.20298","url":null,"abstract":"The modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20298","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"18 1","pages":"9-17"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73586905","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
期刊
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