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

英文中文

Performance analysis of UWB impulse radar receiver using parallel IPCP 基于并行IPCP的超宽带脉冲雷达接收机性能分析

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-28 DOI: 10.1002/ecjc.20303

Hiroyuki Hatano, Takaya Yamazato, Hiraku Okada, Masaaki Katayama

This paper considers a vehicle-borne target detection system for short range in which an UWB (Ultra Wideband) impulse radar is used. The UWB impulse radar uses a pulse with widths of less than nanosecond order. Therefore, many multipath returns are observed on the receiving side. An IPCP (Inter-Period Correction Processing) receiver that resolves complexity of the receiver caused by multiple paths has been proposed. However, the integration time of the correlator in the IPCP receiver is limited by the period of the transmission signal (code length) and affects the range measurement accuracy. This paper considers vehicle mounting for applications. In order to assure safety, a receiver is constructed with several IPCP receivers in parallel, so that the range measurement accuracy is improved. In addition, a receiver which reduces the complexity of threshold setting in the conventional IPCP receiver when several targets are detected is proposed. The outputs of these receivers are derived analytically and improvement of the range measurement accuracy is confirmed. Further, based on the analytical results, the output of each receiver is characterized and the relationship of the threshold, detection probability, and false error probability is derived. Finally, the characteristics of use of the receiver as a vehicle-mounted radar are evaluated by simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(7): 1–14, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20303

本文研究了一种采用超宽带脉冲雷达的近距离车载目标检测系统。UWB脉冲雷达使用宽度小于纳秒级的脉冲。因此，在接收侧观察到许多多径返回。已经提出了一种IPCP（周期间校正处理）接收器，其解决了由多个路径引起的接收器的复杂性。然而，IPCP接收机中相关器的积分时间受到传输信号的周期（代码长度）的限制，并且影响距离测量精度。本文考虑了车辆安装的应用。为了确保安全，接收器由多个IPCP接收器并联构成，从而提高了测距精度。此外，提出了一种在检测到多个目标时降低传统IPCP接收机中阈值设置复杂性的接收机。分析推导了这些接收机的输出，证实了测距精度的提高。此外，基于分析结果，对每个接收器的输出进行表征，并导出阈值、检测概率和错误概率的关系。最后，通过仿真评估了该接收机作为车载雷达的使用特性。©2007 Wiley Periodicals，股份有限公司Electron Comm Jpn Pt 3，90（7）：2007年1月14日；在线发表于Wiley InterScience（www.InterScience.Wiley.com）。DOI 10.1002/ecjc.20303

{"title":"Performance analysis of UWB impulse radar receiver using parallel IPCP","authors":"Hiroyuki Hatano, Takaya Yamazato, Hiraku Okada, Masaaki Katayama","doi":"10.1002/ecjc.20303","DOIUrl":"https://doi.org/10.1002/ecjc.20303","url":null,"abstract":"<p>This paper considers a vehicle-borne target detection system for short range in which an UWB (Ultra Wideband) impulse radar is used. The UWB impulse radar uses a pulse with widths of less than nanosecond order. Therefore, many multipath returns are observed on the receiving side. An IPCP (Inter-Period Correction Processing) receiver that resolves complexity of the receiver caused by multiple paths has been proposed. However, the integration time of the correlator in the IPCP receiver is limited by the period of the transmission signal (code length) and affects the range measurement accuracy. This paper considers vehicle mounting for applications. In order to assure safety, a receiver is constructed with several IPCP receivers in parallel, so that the range measurement accuracy is improved. In addition, a receiver which reduces the complexity of threshold setting in the conventional IPCP receiver when several targets are detected is proposed. The outputs of these receivers are derived analytically and improvement of the range measurement accuracy is confirmed. Further, based on the analytical results, the output of each receiver is characterized and the relationship of the threshold, detection probability, and false error probability is derived. Finally, the characteristics of use of the receiver as a vehicle-mounted radar are evaluated by simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(7): 1–14, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20303</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 7","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2007-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20303","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71992454","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}

引用次数: 4

Reducing peak power for coded OFDM systems by multiple symbol mapping 利用多符号映射降低编码OFDM系统的峰值功率

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-01 DOI: 10.1002/ECJC.10168

M. Harada, Takaya Yamamoto, Hiraku Okada, M. Katayama, A. Ogawa

In this paper, we propose a method for reducing the peak power of the signal for orthogonal frequency division multiplex (OFDM) system in which convolutional code is used for an error-correcting code. In the system, the bit sequence encoded using a convolutional code is mapped onto the multiple symbols which may constrain the peak power of the signal. In the conventional scheme, encoded bits are mapped onto a symbol sequentially. In such a method, the symbols assigned to each subcarrier are mutually uncorrelated and it is therefore difficult to let the symbols have a correlation with other symbols to constrain the peak power of the OFDM signal. In the proposed scheme, the encoded bit sequence is mapped onto the multiple symbols in which each symbol is correlated such as to reduce the peak power of the signal. In this way we are able to keep the peak power of the OFDM signal lower than that of the conventional scheme. For further performance improvement, set partitioning is performed to a set of multiple symbols to increase the Euclidean distance. This approach is made possible by multiple trellis-coded modulation (MTCM) that applies set partitioning to multiple symbols. We evaluate the performance of the proposed scheme in the presence of the effects of nonlinear amplification and show that the proposed scheme is effective for nonlinear amplification. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 67–76, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.10168

在本文中，我们提出了一种降低正交频分复用(OFDM)系统信号峰值功率的方法，其中使用卷积码作为纠错码。在该系统中，使用卷积码编码的位序列被映射到可能约束信号峰值功率的多个符号上。在传统的方案中，编码的位依次映射到符号上。在这种方法中，分配给每个子载波的符号是相互不相关的，因此很难让符号与其他符号具有相关性来约束OFDM信号的峰值功率。在该方案中，将编码的位序列映射到多个符号上，每个符号之间相互关联，以降低信号的峰值功率。这样可以使OFDM信号的峰值功率低于传统方案。为了进一步提高性能，对一组多个符号进行集合分区，以增加欧几里得距离。这种方法是通过多重栅格编码调制(MTCM)实现的，该调制对多个符号应用集划分。我们评估了该方案在非线性放大影响下的性能，并证明了该方案对非线性放大是有效的。©2006 Wiley期刊公司电子工程学报，2009,31 (3):397 - 397;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.10168

{"title":"Reducing peak power for coded OFDM systems by multiple symbol mapping","authors":"M. Harada, Takaya Yamamoto, Hiraku Okada, M. Katayama, A. Ogawa","doi":"10.1002/ECJC.10168","DOIUrl":"https://doi.org/10.1002/ECJC.10168","url":null,"abstract":"In this paper, we propose a method for reducing the peak power of the signal for orthogonal frequency division multiplex (OFDM) system in which convolutional code is used for an error-correcting code. In the system, the bit sequence encoded using a convolutional code is mapped onto the multiple symbols which may constrain the peak power of the signal. In the conventional scheme, encoded bits are mapped onto a symbol sequentially. In such a method, the symbols assigned to each subcarrier are mutually uncorrelated and it is therefore difficult to let the symbols have a correlation with other symbols to constrain the peak power of the OFDM signal. In the proposed scheme, the encoded bit sequence is mapped onto the multiple symbols in which each symbol is correlated such as to reduce the peak power of the signal. In this way we are able to keep the peak power of the OFDM signal lower than that of the conventional scheme. For further performance improvement, set partitioning is performed to a set of multiple symbols to increase the Euclidean distance. This approach is made possible by multiple trellis-coded modulation (MTCM) that applies set partitioning to multiple symbols. We evaluate the performance of the proposed scheme in the presence of the effects of nonlinear amplification and show that the proposed scheme is effective for nonlinear amplification. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 67–76, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.10168","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"29 1","pages":"67-76"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88499690","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

Improved particle swarm optimization and application to portfolio selection 改进粒子群算法及其在投资组合选择中的应用

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-01 DOI: 10.1002/ECJC.20263

M. Koshino, H. Murata, Haruhiko Kimura

Particle swarm optimization (PSO) is a population-based stochastic optimization technique, inspired by the social behavior of birds (flocking) or fish (schooling), which is applied to various problems in the optimization of nonlinear systems. The inertia weights approach (IWA) and the constriction factor approach (CFA) are improved methods in PSO. The IWA searches the problem space globally in the early steps, and finally searches locally near the optimal solution. CFA is a method that introduces a new parameter into velocity update equation. This paper proposes a combination of IWA and CFA (the Inertia Weights Constriction Factor Approach: IWCFA), and PSOrank, whose objective is the ranking of individuals in the population. These two proposed methods are applied to function optimizations and to the portfolio selection problem, which is a typical mathematical problem in securities finance. The results show that the original PSO finds better solutions than the GA, and the proposed method finds better solutions than the original PSO. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 13–25, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20263

粒子群优化(PSO)是一种基于种群的随机优化技术，它的灵感来自于鸟(群集)或鱼(鱼群)的社会行为，并应用于非线性系统优化中的各种问题。惯性权重法(IWA)和收缩因子法(CFA)是PSO中的改进方法。该算法在前期对问题空间进行全局搜索，最后在最优解附近局部搜索。CFA是在速度更新方程中引入新参数的一种方法。本文提出了一种结合IWA和CFA(惯性权重收缩因子法:IWCFA)和PSOrank的方法，其目标是在种群中对个体进行排名。这两种方法分别应用于函数优化和证券金融中典型的数学问题组合选择问题。结果表明，原粒子群算法的解优于遗传算法，所提方法的解优于原粒子群算法。©2006 Wiley期刊公司电子工程学报，2009,31 (3):393 - 393;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20263

{"title":"Improved particle swarm optimization and application to portfolio selection","authors":"M. Koshino, H. Murata, Haruhiko Kimura","doi":"10.1002/ECJC.20263","DOIUrl":"https://doi.org/10.1002/ECJC.20263","url":null,"abstract":"Particle swarm optimization (PSO) is a population-based stochastic optimization technique, inspired by the social behavior of birds (flocking) or fish (schooling), which is applied to various problems in the optimization of nonlinear systems. The inertia weights approach (IWA) and the constriction factor approach (CFA) are improved methods in PSO. The IWA searches the problem space globally in the early steps, and finally searches locally near the optimal solution. CFA is a method that introduces a new parameter into velocity update equation. \u0000 \u0000 \u0000 \u0000This paper proposes a combination of IWA and CFA (the Inertia Weights Constriction Factor Approach: IWCFA), and PSOrank, whose objective is the ranking of individuals in the population. These two proposed methods are applied to function optimizations and to the portfolio selection problem, which is a typical mathematical problem in securities finance. The results show that the original PSO finds better solutions than the GA, and the proposed method finds better solutions than the original PSO. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 13–25, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20263","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"64 1","pages":"13-25"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80900490","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}

引用次数: 12

All-in-focus photo image creation by wavelet transforms 全聚焦照片图像创建的小波变换

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-01 DOI: 10.1002/ECJC.20236

K. Shirai, K. Nomura, M. Ikehara

In this paper, we describe a method for creating all-in-focus photographic images where all of the subjects are in focus as much as possible from partially in-focus photographs with only its subject in focus when photographed by a camera with manual focus. Usually, the focusing range and the depth of field are wide, but become extremely narrow for nearby subjects. Consequently, it is difficult to photograph many subjects in focus in closeup photography. In this paper, we can combine the transform coefficients using wavelet transforms and easily create photographic images with natural focus but without noticeable seams. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 57–66, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20236

在本文中，我们描述了一种方法来创建全聚焦的摄影图像，其中所有的主体都在焦点上尽可能从部分聚焦的照片，只有其主体在焦点上，当相机拍摄与手动对焦。通常，对焦范围和景深都很宽，但对附近的被摄物来说就变得非常窄了。因此，在近景摄影中很难对许多物体进行对焦拍摄。在本文中，我们可以使用小波变换组合变换系数，轻松地创建自然焦点但没有明显接缝的摄影图像。©2006 Wiley期刊公司电子工程学报，2009,31 (3):557 - 566;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20236

引用次数: 2

Recent progress on geometric algorithms for approximating functions: Toward applications to data analysis 函数近似几何算法的最新进展:在数据分析中的应用

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-01 DOI: 10.1002/ECJC.20297

T. Tokuyama

Data simplification is an extremely important issue in our current information-oriented society. Normally, a real-world database contains a massive amount of raw data, and when we consider the data as a distribution function, it has fluctuations due to sampling errors, outliers, and/or invalid inputs. Therefore, for data analysis technology such as data mining, it is important to approximate the input data by a simplified function. There are various approaches to function approximation, and functional analytical methods and learning-based techniques are quite popular. Apart from them, computational geometric approach based on optimization using discrete algorithms is widely studied. However, the conventional application of computational geometrical techniques is pattern matching, and to apply them to data analysis, their formulation and optimization criteria must be changed accordingly. Therefore, various difficulties and computational barriers arise, which must be eliminated or avoided. In this paper, we discuss data approximation in computational geometry and describe current trends centered on the author's latest research. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 1–12, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20297

数据简化是当今信息化社会中一个极其重要的问题。通常，现实世界的数据库包含大量的原始数据，当我们将数据视为分布函数时，它会由于采样误差、异常值和/或无效输入而产生波动。因此，对于数据挖掘等数据分析技术，用简化函数近似输入数据是很重要的。函数逼近有多种方法，其中泛函分析方法和基于学习的技术非常流行。除此之外，基于离散算法优化的计算几何方法也得到了广泛的研究。然而，计算几何技术的传统应用是模式匹配，要将其应用于数据分析，必须相应地改变其表述和优化准则。因此，出现了各种困难和计算障碍，必须消除或避免。本文讨论了计算几何中的数据逼近，并以作者的最新研究为中心描述了当前的发展趋势。©2006 Wiley期刊公司电子工程学报，2009,31 (3):1104 - 1104;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20297

{"title":"Recent progress on geometric algorithms for approximating functions: Toward applications to data analysis","authors":"T. Tokuyama","doi":"10.1002/ECJC.20297","DOIUrl":"https://doi.org/10.1002/ECJC.20297","url":null,"abstract":"Data simplification is an extremely important issue in our current information-oriented society. Normally, a real-world database contains a massive amount of raw data, and when we consider the data as a distribution function, it has fluctuations due to sampling errors, outliers, and/or invalid inputs. Therefore, for data analysis technology such as data mining, it is important to approximate the input data by a simplified function. There are various approaches to function approximation, and functional analytical methods and learning-based techniques are quite popular. Apart from them, computational geometric approach based on optimization using discrete algorithms is widely studied. However, the conventional application of computational geometrical techniques is pattern matching, and to apply them to data analysis, their formulation and optimization criteria must be changed accordingly. Therefore, various difficulties and computational barriers arise, which must be eliminated or avoided. In this paper, we discuss data approximation in computational geometry and describe current trends centered on the author's latest research. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 1–12, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20297","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"56 1","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91216838","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}

引用次数: 1

Fractal video coding with the orthogonal transformation 正交变换的分形视频编码

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-01 DOI: 10.1002/ECJC.20248

K. Ohse, M. Nakagawa

Fractal coding, which is coding with the self-similarity of the image as redundancy, has recently been studied extensively. In this paper, a method of fractal video coding is proposed in which the redundancy along the time axis is eliminated from a sequence of videos by the orthogonal transformation and then the results are rearranged according to the frequency components before fractal video coding. In comparison with the conventional fractal video coding, the average PSNR is improved with almost identical information content. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 36–47, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20248

分形编码是一种以图像的自相似性作为冗余的编码方法，近年来得到了广泛的研究。本文提出了一种分形视频编码方法，该方法通过正交变换去除视频序列中沿时间轴的冗余，然后在分形视频编码前根据视频序列的频率分量对编码结果进行重新排列。与传统的分形视频编码相比，在信息量几乎相同的情况下，平均信噪比得到了提高。©2006 Wiley期刊公司电子工程学报，2009,31 (3):357 - 357;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20248

引用次数: 0

Performance improvement of vector quantizer with reflection group for uniform distribution on hyperspace 超空间上均匀分布反射群矢量量化器性能的改进

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-03-01 DOI: 10.1002/ECJC.20261

N. Yamane, Y. Morikawa, Tomohiro Mae, Yuji Takemoto, S. Maki

A two-stage vector quantizer (kaleidoscope vector quantizer: KVQ) using multidimensional symmetry which has a reflection group is proposed as a high-speed vector quantizer (VQ) for vectors following a uniform distribution on a hypersphere. The first-stage VQ of this method is a lattice quantizer on a hypersphere based on a reflection group and plays a central role in achieving higher dimensions and higher rates. The last-stage VQ is a full-search vector quantizer and plays the roles of repartitioning and reforming the Voronoi regions and improving the quantization properties. In this method, the code vectors are assigned only inside the first-stage Voronoi regions. In this paper, a unified-region KVQ is proposed as a method for improving the quantization characteristic in the high dimensions of KVQ. This method also assigns the code vectors of the last-stage VQ to the boundary surfaces of the Voronoi regions of the first-stage VQ. By using this method, the multiple Voronoi regions in the first-stage VQ are merged and repartitioned, and the degree of freedom in the code vector assignment is increased. Simulation tests were conducted on Gaussian vectors and showed that the quantization characteristics equivalent to the full-search VQ were obtained in the range of 16 dimensions and a rate of about 2.5 bits/sample. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 26–35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20261

提出了一种利用具有反射群的多维对称的两级矢量量化器(万花筒矢量量化器:KVQ)作为超球上均匀分布的矢量的高速矢量量化器。该方法的第一阶段VQ是基于反射群的超球上的晶格量化器，它在实现高维和高速率方面起着核心作用。最后阶段VQ是一个全搜索矢量量化器，它的作用是重新划分和改造Voronoi区域，提高量化性能。在该方法中，仅在第一阶段Voronoi区域内分配代码向量。本文提出了一种统一区域KVQ作为改进KVQ高维量化特性的方法。该方法还将最后一级VQ的编码向量赋给第一级VQ的Voronoi区域的边界面。该方法对第一阶段VQ中的多个Voronoi区域进行合并和重新划分，提高了编码矢量分配的自由度。在高斯矢量上进行了仿真测试，结果表明，在16维范围内获得了相当于全搜索VQ的量化特性，速率约为2.5 bits/sample。©2006 Wiley期刊公司电子工程学报，2009,31 (3):357 - 357;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20261

{"title":"Performance improvement of vector quantizer with reflection group for uniform distribution on hyperspace","authors":"N. Yamane, Y. Morikawa, Tomohiro Mae, Yuji Takemoto, S. Maki","doi":"10.1002/ECJC.20261","DOIUrl":"https://doi.org/10.1002/ECJC.20261","url":null,"abstract":"A two-stage vector quantizer (kaleidoscope vector quantizer: KVQ) using multidimensional symmetry which has a reflection group is proposed as a high-speed vector quantizer (VQ) for vectors following a uniform distribution on a hypersphere. The first-stage VQ of this method is a lattice quantizer on a hypersphere based on a reflection group and plays a central role in achieving higher dimensions and higher rates. The last-stage VQ is a full-search vector quantizer and plays the roles of repartitioning and reforming the Voronoi regions and improving the quantization properties. In this method, the code vectors are assigned only inside the first-stage Voronoi regions. In this paper, a unified-region KVQ is proposed as a method for improving the quantization characteristic in the high dimensions of KVQ. This method also assigns the code vectors of the last-stage VQ to the boundary surfaces of the Voronoi regions of the first-stage VQ. By using this method, the multiple Voronoi regions in the first-stage VQ are merged and repartitioned, and the degree of freedom in the code vector assignment is increased. Simulation tests were conducted on Gaussian vectors and showed that the quantization characteristics equivalent to the full-search VQ were obtained in the range of 16 dimensions and a rate of about 2.5 bits/sample. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(3): 26–35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20261","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"23 1","pages":"26-35"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88184820","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

Evaluation of smoothed group delay spectrum distance measure in speaker-independent speech recognition 独立说话人语音识别中平滑群延迟频谱距离测度的评价

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-02-22 DOI: 10.1002/ECJC.4430741005

Taizo Umezaki Member, Harald Singer Member, Fumitada Itakura Member

The smoothed group delay spectrum distance (SGDS) measure is evaluated in speaker-independent recognition experiments. First, the appropriate level of smoothing of the group delay spectrum (GDS) is investigated by adding noise, etc., to the input speech. Then a comparison with the speaker-dependent case is made. An experiment is reported in which, for low amplitude parts of speech (e.g., unvoiced speech), the standard (LPC) distance measure is used in the interframe distance calculation instead of the SGDS distance measure. This method prevents a loss of recognition accuracy due to too strong an emphasis on certain spectral elements and a consistently high recognition accuracy can be achieved. Finally, evaluate the SGDS distance measure is evaluated where the GDS is represented in the spectral domain as a discrete Fourier transform (DFT) of the LPC coefficients. In comparison to the SGDS which was calculated by weighting the LPC cepstrum co-efficients, computation time and memory space can be reduced without loss of recognition accuracy. Furthermore, a low bit quantization of the GDS is reported and a high recognition rate is achieved with only 32 bits per frame.

在与说话人无关的识别实验中，对平滑组延迟频谱距离(SGDS)测度进行了评价。首先，通过在输入语音中加入噪声等因素来研究群延迟谱(GDS)的适当平滑程度。然后与依赖说话人的情况进行了比较。本文报道了一项实验，对低振幅语音部分(如未发音语音)，在帧间距离计算中使用标准(LPC)距离度量代替SGDS距离度量。该方法防止了由于过于强调某些光谱元素而导致的识别精度损失，并且可以实现始终如一的高识别精度。最后，评估SGDS距离度量，其中GDS在谱域中表示为LPC系数的离散傅里叶变换(DFT)。与加权LPC倒谱系数计算SGDS相比，在不损失识别精度的前提下，减少了计算时间和存储空间。此外，本文还报道了GDS的低比特量化和高识别率，每帧只有32比特。

{"title":"Evaluation of smoothed group delay spectrum distance measure in speaker-independent speech recognition","authors":"Taizo Umezaki Member, Harald Singer Member, Fumitada Itakura Member","doi":"10.1002/ECJC.4430741005","DOIUrl":"https://doi.org/10.1002/ECJC.4430741005","url":null,"abstract":"The smoothed group delay spectrum distance (SGDS) measure is evaluated in speaker-independent recognition experiments. First, the appropriate level of smoothing of the group delay spectrum (GDS) is investigated by adding noise, etc., to the input speech. Then a comparison with the speaker-dependent case is made. An experiment is reported in which, for low amplitude parts of speech (e.g., unvoiced speech), the standard (LPC) distance measure is used in the interframe distance calculation instead of the SGDS distance measure. This method prevents a loss of recognition accuracy due to too strong an emphasis on certain spectral elements and a consistently high recognition accuracy can be achieved. \u0000 \u0000 \u0000 \u0000Finally, evaluate the SGDS distance measure is evaluated where the GDS is represented in the spectral domain as a discrete Fourier transform (DFT) of the LPC coefficients. In comparison to the SGDS which was calculated by weighting the LPC cepstrum co-efficients, computation time and memory space can be reduced without loss of recognition accuracy. Furthermore, a low bit quantization of the GDS is reported and a high recognition rate is achieved with only 32 bits per frame.","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2007-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83311477","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

On error exponents for a variable size list decoder using the Viterbi algorithm with likelihood testing 基于Viterbi算法和似然检验的可变大小列表解码器的误差指数

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-02-21 DOI: 10.1002/ecjc.20245

Toshihiro Niinomi, Toshiyasi Matsushima, Shigeichi Hirasawa

The likelihood ratio (LR) decision criterion [3] employed by Yamamoto and Itoh's decision feedback (ARQ) scheme [1] is known to be highly compatible with the Viterbi algorithm (VA) due to the fact that it requires a small amount of computational effort. In addition, Forney has derived an extension of the coding theorem to the variable size list decoder for maximum likelihood decoding of block codes. In this paper we propose an algorithm for extending LR-based variable size list decoding for decoding convolutional codes using the Viterbi algorithm; assuming a discrete memoryless channel we also derive a lower bound on the decoder's error exponents. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 27– 36, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20245

众所周知，Yamamoto和Itoh的决策反馈（ARQ）方案[1]所采用的似然比（LR）决策准则[3]与维特比算法（VA）高度兼容，因为它需要少量的计算工作量。此外，Forney还将编码定理推广到可变大小列表解码器，用于块码的最大似然解码。在本文中，我们提出了一种扩展基于LR的可变大小列表解码的算法，用于使用Viterbi算法解码卷积码；假设一个离散的无记忆通道，我们还导出了解码器误差指数的下界。©2007 Wiley Periodicals，股份有限公司Electron Comm Jpn Pt 3，90（6）：27-362007；在线发表于Wiley InterScience（www.InterScience.Wiley.com）。DOI 10.1002/ecjc.20245

引用次数: 0

A performance evaluation of frequency domain blind source separation using close arrangement of directional microphones 使用定向麦克风的紧密排列的频域盲源分离性能评估

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

Pub Date : 2007-02-21 DOI: 10.1002/ecjc.20300

Hiroki Shimizu, Masanori Ito, Yoshinori Takeuchi, Tetsuya Matsumoto, Hiroaki Kudo, Noboru Ohnishi

A performance evaluation of frequency-domain blind source separation (BSS) in a close arrangement of directional microphone is carried out. When a close arrangement is used in time-domain BSS, it is possible to reduce the number of taps necessary for separation while maintaining the same performance as in separation without close arrangement. In this research, from the point of view of the relationship between the number of taps and the separation performance, the calculation time, and the permutation (output order) unique to the frequency domain BSS, a comparison with nonclose arrangement is made. With regard to the calculation time and the permutation error, close arrangement is superior to nonclose arrangement in environments both with and without reverberation. With regard to the separation performance, close arrangement is better than nonclose arrangement in an anechoic chamber but nonclose arrangement is better if there are many taps. If the number of taps is small, close arrangement is superior. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20300

对近距离定向传声器中频域盲源分离（BSS）的性能进行了评估。当在时域BSS中使用紧密布置时，可以减少分离所需的抽头数量，同时保持与没有紧密布置的分离中相同的性能。在本研究中，从抽头数量与频域BSS特有的分离性能、计算时间和排列（输出顺序）之间的关系的角度，与非丢失排列进行了比较。在计算时间和排列误差方面，在有混响和无混响的环境中，紧密排列都优于非紧密排列。就分离性能而言，在消声室中，闭合布置比非闭合布置好，但如果有许多抽头，则非闭合布置更好。如果分接头数量较少，则采用紧密布置。©2007 Wiley Periodicals，股份有限公司Electron Comm Jpn Pt 3，90（6）：2007年1月9日；在线发表于Wiley InterScience（www.InterScience.Wiley.com）。DOI 10.1002/ecjc.20300

{"title":"A performance evaluation of frequency domain blind source separation using close arrangement of directional microphones","authors":"Hiroki Shimizu, Masanori Ito, Yoshinori Takeuchi, Tetsuya Matsumoto, Hiroaki Kudo, Noboru Ohnishi","doi":"10.1002/ecjc.20300","DOIUrl":"https://doi.org/10.1002/ecjc.20300","url":null,"abstract":"<p>A performance evaluation of frequency-domain blind source separation (BSS) in a close arrangement of directional microphone is carried out. When a close arrangement is used in time-domain BSS, it is possible to reduce the number of taps necessary for separation while maintaining the same performance as in separation without close arrangement. In this research, from the point of view of the relationship between the number of taps and the separation performance, the calculation time, and the permutation (output order) unique to the frequency domain BSS, a comparison with nonclose arrangement is made. With regard to the calculation time and the permutation error, close arrangement is superior to nonclose arrangement in environments both with and without reverberation. With regard to the separation performance, close arrangement is better than nonclose arrangement in an anechoic chamber but nonclose arrangement is better if there are many taps. If the number of taps is small, close arrangement is superior. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20300</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 6","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2007-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20300","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71970870","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

首页上一页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

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.

﹀