• Title/Summary/Keyword: regular node

Search Result 77, Processing Time 0.021 seconds

Fully-Parallel Architecture for 1.4 Gbps Non-Binary LDPC Codes Decoder (1.4 Gbps 비이진 LDPC 코드 복호기를 위한 Fully-Parallel 아키텍처)

  • Choi, Injun;Kim, Ji-Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.48-58
    • /
    • 2016
  • This paper presents the high-throughput fully-parallel architecture for GF(64) (160,80) regular (2,4) non-binary LDPC (NB-LDPC) codes decoder based on the extended min sum algorithm. We exploit the NB-LDPC code that features a very low check node and variable node degree to reduce the complexity of decoder. This paper designs the fully-parallel architecture and allows the interleaving check node and variable node to increase the throughput of the decoder. We further improve the throughput by the proposed early sorting to reduce the latency of the check node operation. The proposed decoder has the latency of 37 cycles in the one decoding iteration and achieves a high throughput of 1402Mbps at 625MHz.

Differential Diagnosis of CT Images in Children with Neuroblastomas and Ganglioneuroblastomas

  • Zhuang, Bo;Lv, Deng-Kun;Gao, Si-Ju;Meng, Jing-Jing
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.23
    • /
    • pp.10509-10512
    • /
    • 2015
  • Objective: To investigate the differential features of CT images in children with neuroblastomas (N) and ganglioneuroblastomas (G). Materials and Methods: Clinical data of 12 children in group G and 15 in group N undergoing CT examination and definitely diagnosed by pathology were retrospectively analyzed. The focal conditions were observed and compared in the two groups, including location, size, boundaries, morphology, enhanced degree and mode, abdominal vascular involvement, presence or absence of spanning the midline, infiltration of peripheral organs, angiography manifestations in tumors or surroundings, presence or absence of calcification and vascular tumor emboli as well as metastases of distal organs and lymph nodes. Results: In group N, the incidence of tumors in the adrenal area was conspicuously higher than in group G (P<0.05), while that of tumors with regular morphology and clear boundaries was significantly lower than in group G (P<0.01); Angiography manifestation rate and incidences of vascular embedding, lymph node metastasis, infiltration and organic metastasis in group N were all markedly higher than in group G (P<0.05). There was no statistical significance between the two groups in terms of focal size, presence or absence of calcification and spanning the midline, and enhanced degree and mode, as well as vascular tumor emboli (P>0.05). Conclusions: Mostly located in adrenal areas and with vascular embedding as a primary manifestation, the neuroblastoma extremely readily metastases to lymph nodes and other organs as well as infiltrating local tissues, with dilation on angiography frequent in or around the tumors. With vascular displacement as a primary manifestation, ganglioneuroblastoma has a regular morphology and clear boundaries.

Motion Estimation Using Dynamic Regular Mesh (동적 정규화 메쉬를 이용한 움직임 추정)

  • Lee, Dong-Gyu;Lee, Du-Su
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.6
    • /
    • pp.599-607
    • /
    • 2001
  • In Conventional BMA, the motion vector can describe only translational movement and blocking noise is generated. To overcome this defect, motion estimation using triangular mesh has been proposed. The regular mesh is the method of dividing the image area into equal size triangle and haying the same node connection. It has no additional information about mesh structure, but do not reflect the real motion because it represents the regions by equal mesh structure regardless of the amount of motion. In this paper, motion estimation using dynamic regular mesh is proposed, In this method, the mesh structure is varied from the amount of motion and maintain the form of regular mesh. By the simulation, proposed method have better performance in PSNR and is superior to the other method in convergence rate.

  • PDF

A Distribution Key Management Protocol for improving Security of Inner Attack in WiMAX Environment (WiMAX 환경에서 내부 공격의 안전성을 향상시킨 분산 키 관리 프로토콜)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.107-115
    • /
    • 2009
  • The cryptological key which is used in WiMAX environment is used at regular intervals by mobile nodes (laptop computer, PDA, cell-phone) which is in the range of base station coverage. But it is very weak at local attack like man-in-the-middle when the mobile node is off the range of base station or enters into the range to communicate with base station because the communication section is activated wirelessly. This paper proposes a distribution key building protocol which can reuse security key used by nodes to reduce cryptological security attack danger and communication overhead which occurs when mobile node tries to communicate with base station. The proposed distribution key establishing protocol can reduce overhead which occurs between base station and mobile node through key reusing which occurs during the communication process and also, makes security better than IEEE 802.16 standard by creating shared key which is required for inter-certification through the random number which node itself creates.

Numerical Simulations of Added Resistance and Motions of KCS in Regular Head Waves (선수 규칙파 중 KCS의 부가저항 및 운동성능 수치해석)

  • Seo, Seonguk;Park, Sunho
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.54 no.2
    • /
    • pp.132-142
    • /
    • 2017
  • As the International Maritime Organization (IMO) recently introduced the Energy Efficiency Design Index (EEDI) for new ships building and the Energy Efficiency Operational Indicator (EEOI) for ship operation, thus an accurate estimation of added resistance of ships advancing in waves has become necessary. In the present study, OpenFOAM, computational fluid dynamics libraries of which source codes are opened to the public, was used to calculate the added resistance and motions of the KCS. Unstructured grid using a hanging-node and cut-cell method was used to generate dense grid around a wave and KCS. A dynamic deformation mesh method was used to consider the motions of the KCS. Five wavelengths from a short wavelength (${\lambda}/LPP=0.65$) to a long wavelength (${\lambda}/LPP=1.95$) were considered. The added resistance and the heave & pitch motions calculated for various waves were compared with the results of model experiments.

CANCAR - Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

  • Pertovt, Erik;Alic, Kemal;Svigelj, Ales;Mohorcic, Mihael
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4205-4227
    • /
    • 2018
  • Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

Energy Efficiency Enhancement of TICK -based Fuzzy Logic for Selecting Forwarding Nodes in WSNs

  • Ashraf, Muhammad;Cho, Tae Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4271-4294
    • /
    • 2018
  • Communication cost is the most important factor in Wireless Sensor Networks (WSNs), as exchanging control keying messages consumes a large amount of energy from the constituent sensor nodes. Time-based Dynamic Keying and En-Route Filtering (TICK) can reduce the communication costs by utilizing local time values of the en-route nodes to generate one-time dynamic keys that are used to encrypt reports in a manner that further avoids the regular keying or re-keying of messages. Although TICK is more energy efficient, it employs no re-encryption operation strategy that cannot determine whether a healthy report might be considered as malicious if the clock drift between the source node and the forwarding node is too large. Secure SOurce-BAsed Loose Synchronization (SOBAS) employs a selective encryption en-route in which fixed nodes are selected to re-encrypt the data. Therefore, the selection of encryption nodes is non-adaptive, and the dynamic network conditions (i.e., The residual energy of en-route nodes, hop count, and false positive rate) are also not focused in SOBAS. We propose an energy efficient selection of re-encryption nodes based on fuzzy logic. Simulation results indicate that the proposed method achieves better energy conservation at the en-route nodes along the path when compared to TICK and SOBAS.

Synchronous Distributed Load Balancing Algorithm Employing SBIBD (SBIBD를 이용한 분산시스템의 부하 균형 알고리즘)

  • 김성열
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.386-393
    • /
    • 2004
  • In order to maintain load balancing in distributed systems in a decentralized manner, every node should obtain workload information from all the nodes on the network. It requires $Ο({v^2})$ traffic overheads, where v is the number of nodes. This paper presents a new synchronous dynamic distributed load balancing algorithm for a ( v,k+1,1)-configured network topology, which is a kind of 2k regular graph, based on symmetric balanced incomplete block design, where v equals ${k^2}+k+1$. Our algorithm needs only Ο(v√v) message overheads and each node receives workload information from all the nodes without redundancy. And load balancing in this algorithm is maintained so that every link has same amount of traffic by √v for transferring workload information.

A Tree-structured XPath Query Reduction Scheme for Enhancing XML Query Processing Performance (XML 질의의 수행성능 향상을 위한 트리 구조 XPath 질의의 축약 기법에 관한 연구)

  • Lee, Min-Soo;Kim, Yun-Mi;Song, Soo-Kyung
    • The KIPS Transactions:PartD
    • /
    • v.14D no.6
    • /
    • pp.585-596
    • /
    • 2007
  • XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.

A study on the discriminant analysis of node deployment based on cable type Wi-Fi in indoor (케이블형 Wi-Fi 기반 실내 공간의 노드 배치 판별 분석에 관한 연구)

  • Zin, Hyeon-Cheol;Kim, Won-Yeol;Kim, Jong-Chan;Kim, Yoon-Sik;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.9
    • /
    • pp.836-841
    • /
    • 2016
  • An indoor positioning system using Wi-Fi is essential to produce a radio map that combines the indoor space of two or more dimensions, the information of node positions, and etc. in processing for constructing the radio map, the measurement of the received signal strength indicator(RSSI) and the confirmation of node placement information counsume substantial time. Especially, when the installed wireless environment is changed or a new space is created, easy installation of the node and fast indoor radio mapping are needed to provide indoor location-based services. In this paper, to reduce the time consumption, we propose an algorithm to distinguish the straight and curve lines of a corridor section by RSSI visualization and Sobel filter-based edge detection that enable accurate node deployment and space analysis using cable-type Wi-Fi node installed at a 3 m interval. Because the cable type Wi-Fi is connected by a same power line, it has an advantage that the installation order of nodes at regular intervals could be confirmed accurately. To be able to analyze specific sections in space based on this advantage, the distribution of the signal was confirmed and analyzed by Sobel filter based edge detection and total RSSI distribution(TRD) computation through a visualization process based on the measured RSSI. As a result to compare the raw data with the performance of the proposed algorithm, the signal intensity of proposed algorithm is improved by 13.73 % in the curve section. Besides, the characteristics of the straight and the curve line were enhanced as the signal intensity of the straight line decreased by an average of 34.16 %.