检索结果-内蒙古大学图书馆

Reliability Ratio-Based serial algorithm of LDPC Decoder for Turbo Equalization Schemes

IEEE TRANSACTIONS ON MAGNETICS 2022年第2期58卷 1-5页

作者： Khittiwitchayakul, Sirawit Phakphisut, Watid Supnithi, Pornchai King Mongkuts Inst Technol Ladkrabang Sch Engn Bangkok 10520 Thailand

serial decoding algorithms of low-density parity-check (LDPC) code converge efficiently with low errors. Previously, a serial decoding algorithm, named a shuffled belief-propagation (SBP), was applied in turbo equalization of bit-patterned magnetic recording (BPMR) systems. With the SBP algorithm, an LDPC decoder converged twice as fast as one using conventional BP algorithms. We further improved the convergence speed of SBP by updating the messages in an adaptive order, which played a flexible role throughout decoding. We proposed two adaptive-serial algorithms for LDPC codes in turbo equalization. One updated the messages using the extrinsic loglikelihood ratio (LLR) and the result of the parity-check equation checking. The second contained an additional rule that tracked the LLR sign changes in each iteration. Both algorithms converged faster and with lower bit error rates (BERs) than the SBP and previous adaptive-serial algorithms in a BPMR system with media noise.

关键词： Decoding Belief propagation Iterative decoding Detectors Convergence Media Magnetic recording Belief propagation bit patterned media low-density parity-check (LDPC) codes serial algorithm turbo equalization

来源：评论

学校读者我要写书评

暂无评论

Intelligent Online Shared Home Design Based on Big Data Parallel algorithms

Intelligent Online Shared Home Design Based on Big Data Para...

引用

2023 International Conference on Integrated Intelligence and Communication Systems, ICIICS 2023

作者： Yang, Ying Zhang, Xilin Gao, Jialin He, Meihui Zhang, Wenhui Jiang, Jiayin Hou, Wenjing Cai, Kai Ling, Tingting DaLian University of Science and Technology Department of Foreign Languages Liaoning Dalian China DaLian University of Science and Technology College of Communications and Electrical Engineering Liaoning Dalian China

ISBN: (纸本)9798350315455

As the overall economic strength of China continues to improve and people's quality of life continues to improve, the application of high-quality engineering and environmental protection technologies is an inevitable choice for the future design of green housing. Therefore, it is necessary to consider high-tech solutions when designing similar houses. This paper puts forward the idea of utilizing modern high-tech means to renovate residential houses through the study of geographic conditions and architectural features of residential houses. With the rapid development of network information technology and the wide application of various multimedia devices, people's understanding of the living environment has changed. Based on big data, online sharing of smart home design is realized, which is both conducive to the rapid improvement of informatization level of designers and the understanding of home design resources. With the help of the Internet and the platform of interactive sharing of information, it enables designers to communicate more with other designers, thus better assisting home design. Therefore, on this basis, this paper proposes a design method for an Internet-based interactive platform for home design. The method is simulated in the paper and the results show that the method is effective. © 2023 IEEE.

关键词： BD parallel algorithm home design online sharing serial algorithm

来源：评论

学校读者我要写书评

暂无评论

The evaluation of accuracy of serial rapid HIV test algorithm in the diagnosis of HIV antibodies among pregnant women in south east Nigeria Pregnancy and Childbirth

引用

BMC Research Notes 2015年第1期8卷 1-7页

作者： Mbachu, Ikechukwu Innocent Udigwe, Gerald Joseph, Ikechebelu John, Okonkwo Samuel, Umeononihu Osita Joseph, Ugboaja Ngozi, Mbachu Chioma Department of Obstetrics and Gynaecology Nnamdi Azikiwe University Teaching Hospital PMB 5025 Nnewi Anambra State Nigeria Department of Paediatrics Nnamdi Azikiwe University Teaching Hospital PMB 5025 Nnewi Anambra State Nigeria

Background: Accurate HIV testing in pregnancy is critical to the prevention of mother to child transmission of HIV infection and linkages to other preventive strategies. Aims and objectives: This study determined the sensitivity, specificity negative and positive predictive value of serial rapid testing of HIV among pregnant women in Nnewi, south east Nigeria. Methodology: This was a comparative descriptive study conducted over a 4-month period. serial rapid testing algorithm was compared with conventional ELISA testing after obtaining informed consents from the pregnant women. All positive and discordant results were confirmed with western blot HIV test. Participants also completed a questionnaire. Data analysis was done using SPSS version 20. Result: A total of 166 pregnant women participated in this study. The mean age of the participants was 29 ± 4.3 years. The HIV prevalence was highest in the 25-29 years category. This was also the modal age category. Majority of the women were multiparous. The prevalence of HIV infection was 12 %. The sensitivity, specificity, negative and positive predictive value of serial rapid HIV testing was 95, 100, 99.3 and 100 % respectively. Conclusion: The sensitivity of the serial rapid test algorithm was high but still lower than the WHO recommended 99 % and above. The 100 % specificity and positive predictive value makes it a good diagnostic test strategy. There is need for regular review of HIV test kits and policy. © 2015 Mbachu et al.

关键词： Accuracy Pregnant women Rapid HIV test serial algorithm

来源：评论

学校读者我要写书评

暂无评论

Accurate approximation and MPI parallelization of spatial stochastic reaction-diffusion in STEPS

引用

BMC Neurosci 2014年第SUPPL 1期15卷 P177-P177页

作者： Iain Hepburn Weiliang Chen Erik De Schutter Theoretical Neurobiology University of Antwerp 2610 Antwerpen Belgium Computational Neuroscience Unit Okinawa Institute of Science and Technology Okinawa 904-0411 Japan

来源：评论

学校读者我要写书评

暂无评论

A partition-based serial algorithm for generating viewshed on massive DEMs

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2007年第9期21卷 955-964页

作者： Wu, Huanping Pan, Mao Yao, Lingqing Luo, Bing Peking Univ Sch Earth & Space Sci Beijing 100871 Peoples R China China Meterol Adm Natl Meteorol Ctr Guangzhou Peoples R China

As increasingly large-scale and higher-resolution terrain data have become available, for example air-form and space-borne sensors, the volume of these datasets reveals scalability problems with existing GIS algorithms. To address this problem, a kind of serial algorithm was developed to generate viewshed on large grid-based digital elevation models (DEMs). We first divided the whole DEM into rectangular blocks in row and column directions (called block partitioning), then processed these blocks with four axes followed by four sectors sequentially. When processing the particular block, we adopted the ' reference plane' algorithm to calculate the visibility of the target point on the block, and adjusted the calculation sequence according to the different spatial relationships between the block and the viewpoint since the viewpoint is not always inside the DEM. By adopting the ' Reference Plane' algorithm and using a block partitioning method to segment and load the DEM dynamically, it is possible to generate viewshed efficiently in PC-based environments. Experiments showed that the divided block should be dynamically loaded whole into computer main memory when partitioning, and the suggested approach retains the accuracy of the reference plane algorithm and has near linear compute complexity.

关键词： massive DEMs viewshed analysis serial algorithm block partitioning method

来源：评论

学校读者我要写书评

暂无评论

serial and parallel algorithms for computing distances between unrooted and cyclically ordered trees

引用

Electronics and Communications in Japan (Part II: Electronics) 1998年第9期80卷

作者： Masahiro Yamamoto Eiichi Tanaka Graduate School of Science and Technology Kobe University Kobe Japan 657 Faculty of Engineering Kobe University Kobe Japan 657

For unrooted and cyclically ordered trees (CO-tree), the distance based on the ancestor-descendant relation-preserving mapping (TD), the distance based on the structure-preserving mapping (SPD), and the distance based on the strongly structure-preserving mapping (SSPD) have been defined and their computing methods have been proposed. Let T a and T b be CO-trees. Let the numbers of their vertices be N a and N b , and the numbers of their leaves be L a and L b , respectively. Let the maximum orders of the vertices of T a and T b be m a and m b , respectively. In this paper, improved serial computing methods for TD and SPD are presented. The time complexities of those methods are O(N a N b L a L b ) and O(m a N a N b L b ), respectively. Based on the improved serial computing methods for TD and SPD, the parallel computing methods for TD, SPD, and SSPD are proposed. The time complexities of those methods are O(max{N a , N b }). The numbers of required processors are O(N a L a L b ), O(m a N a L b ), and O(m a m b max{N a , N b }), respectively. Each of those parallel methods is optimal in the sense that the cost is equal to the time complexity of the serial computing method. © 1998 Scripta Technica. Electron Comm Jpn Pt. 2, 80(9): 35–49, 1997

关键词： tree distance parallel algorithm serial algorithm pattern matching

来源：评论

学校读者我要写书评

暂无评论

serial and parallel algorithms for computing distances between unrooted and cyclically ordered trees

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS 1997年第9期80卷 35-49页

作者： Yamamoto, M Tanaka, E Kobe Univ Grad Sch Sci & Technol Kobe Hyogo 657 Japan Kobe Univ Fac Engn Kobe Hyogo 657 Japan

For unrooted and cyclically ordered trees (CO-tree), the distance based on the ancestor-descendant relation-preserving mapping (TD), the distance based on the structure-preserving mapping (SPD), and the distance based on the strongly structure-preserving mapping (SSPD) have been defined and their computing methods have been proposed. Let T-a and T-b be CO-trees. Let the numbers of their vertices be N-a and N-b, and the numbers of their leaves be L-a and L-b respectively. Let. the maximum orders of the vertices of T-a and T-b be m(a) and m(b), respectively. In this paper, improved serial computing methods for TD and SPD are presented. The time complexities of those methods are O(NaNbLaLb) and O(m(a)N(a)N(b)L(b)), respectively. Based on the improved serial computing methods for TD and SPD, the parallel computing methods for TD, SPD, and SSPD are proposed. The time complexities of those methods are O(max{N-a, N-b}) The numbers of required processors are O(NaLaLb), O(m(a)N(a)L(b)), and O(m(a)m(b)max{N-a,N-b}), respectively. Each of those parallel methods is optimal in the sense that the cost is equal to the time complexity of the serial computing method. (C) 1998 Scripta Technica.

关键词： tree distance parallel algorithm serial algorithm pattern matching

来源：评论

学校读者我要写书评

暂无评论

A 2-PASS TMS320C25 FOR THE MOTOROLA EXORMACS

引用

MICROPROCESSORS AND MICROSYSTEMS 1992年第3期16卷 133-140页

作者： DEKA, R SINGH, B GLOVER, IA UNIV BRADFORD DEPT ELECT ENGNBRADFORD BD7 1DPW YORKSHIREENGLAND UNIV BRADFORD PARALLEL & NOVEL PROCESSERS SYST GRPBRADFORD BD7 1DPW YORKSHIREENGLAND

This paper describes the development of a cross-assembler, denoted XTIC25, which runs on Motorola's EXORMacs system. First a suitable data format called TIC25 is derived from the TMS320C25 digital signal microprocessor. This data format is then used in conjunction with software written using a combination of subsets of Pascal and MC68000 assembler routines, based on a two-pass algorithm. The cross-assembler is validated using several test programs and is capable of developing software, using the TMS320C25 assembler, within a microcomputer environment. In this way, the use of a host microcomputer for developing digital signal processing software is demonstrated.

关键词： CROSS-ASSEMBLER DIGITAL MICROPROCESSOR DATA FORMAT MICROCOMPUTER serial algorithm TMS320C25

来源：评论

学校读者我要写书评

暂无评论

AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING algorithm FOR BIPARTITE GRAPHS

引用

INFORMATION PROCESSING LETTERS 1987年第1期24卷 15-17页

作者： KIM, T CHWA, KY Department of Computer Science Korea Advanced Institute of Science and Technology P.O. Box 150 Cheongryang Seoul Korea

The authors give an O(n log n log log n) time bound using the unbounded parallel machine model for the processors. In this model, an unlimited polynomial number of processors is available in a parallel machine. These processors are synchronized and have access to a common memory. Different processors can obtain the content of one memory location simultaneously, but no two processors should attempt to change the content of the same memory location at the same time.

关键词： Parallel algorithm serial algorithm computational complexity matching graph tree

来源：评论

学校读者我要写书评

暂无评论

PARALLEL algorithmS FOR A DEPTH 1ST SEARCH AND A BREADTH 1ST SEARCH

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1986年第1期19卷 39-54页

作者： KIM, T CHWA, K Department of Computer Science Korea Advanced Institute of Science and Technology Cheongryang Seoul P.O. Box 150 South Korea

Two graph search problems are considered in a parallel computational environment. In this paper, we use the shortest path algorithm as a useful parallel computational technique. Based on the parallel shortest path algorithm presented by Dekel [8], we develop a parallel breadth first search algorithm for general graphs and a parallel depth first search algorithm for acyclic digraphs which run in timeO(logd-logn) using0(n2[n/logn]) *** a breadth first search, the resulting algorithm is the same with that of Ghosh and Bhattacharjee [9]. But the difference between them is that the algorithm presented in [9] is based on the parallel breadth first search algorithm for trees while our algorithm is based on the shortest path algorithm. Furthermore, the algorithms presented in this paper have a unified algorithm structure.

关键词： Parallel algorithm serial algorithm breadth first search depth first search time complexity GT: algorithm SD:G.1.0 G.2.2

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：