The Experts below are selected from a list of 280884 Experts worldwide ranked by ideXlab platform
Zhang Jian-zhong - One of the best experts on this subject based on the ideXlab platform.
-
Efficient identity-based blind signature scheme
Computer Engineering and Applications, 2010Co-Authors: Zhang Jian-zhongAbstract:This paper proposes an efficient identity-based blind signature scheme based on identity-based public key cryptogra-phy by adopting blind signature scheme.By analyzing the schemei,t concludes that the scheme has unforgeability,blindness,un-traceability.Compared with other schemest,he new scheme has lower Computation Complexity and better Computational efficiency.
-
New Proxy Blind Signature Scheme Based on Bilinear Pairings
Application Research of Computers, 2007Co-Authors: Zhang Jian-zhongAbstract:A new proxy blind signature scheme based on bilinear pairings is gived because those proposed proxy blind signature schemes have secure leak.This paper analyzes its security and efficiency.The new scheme satisfies all the security requirement of proxy blind signature,and has the merits of little communication and low Computation Complexity,etc.
-
A Secure and Efficient Proxy Blind Signature Scheme
Computer Engineering, 2007Co-Authors: Zhang Jian-zhongAbstract:A new secure and efficient proxy blind signature scheme based on bilinear pairings is proposed,and it is compared with those proposed schemes.The new scheme overcomes the security leaks and has the merits of little communication and low Computation Complexity etc.
Didier Georges - One of the best experts on this subject based on the ideXlab platform.
-
Fluorescence diffuse optical tomography: A model reduction by a wavelet multiresolution method
2008Co-Authors: Anne Frassati, Anabela Da Silva, Jean-marc Dinten, Didier GeorgesAbstract:This paper is devoted to the Fluorescence Diffuse Optical Tomography. This inverse problem relies on an iterative algorithm based on solutions of partial differential equations. The goal of the paper is to present a multiresolution technique applied to these equations, with the objective of Computation Complexity reduction. The effectiveness of the approach is then illustrated on a practical example.
-
Wavelet-based model reduction applied to fluorescence diffuse optical tomography
2007Co-Authors: Anne Frassati, Anabela Da Silva, Jean-marc Dinten, Didier GeorgesAbstract:This paper is devoted to the Fluorescence Diffuse Optical Tomography. This inverse problem (physical parameter estimation problem) relies on an iterative algorithm based on repetitive solutions of a set of partial differential equations. The main goal of the paper is to present a wavelet-based model reduction technique applied to the solution of the partial differential equations involved in the problem, with the objective of Computation Complexity reduction. The effectiveness of the approach is then illustrated on a practical example.
-
Wavelet-based model reduction applied to fluorescence diffuse optical tomography
2007Co-Authors: Anne Frassati, Anabela Da Silva, Jean-marc Dinten, Didier GeorgesAbstract:This paper is devoted to the Fluorescence Diffuse Optical Tomography. This inverse problem relies on an iterative algorithm based on solutions of partial differential equations. The goal of the paper is to present a multiresolution technique applied to these equations, with the objective of Computation Complexity reduction. The effectiveness of the approach is then illustrated on a practical example.
-
Model reduction by multiresolution method applied to fluorescence diffuse optical tomography
2007Co-Authors: Anne Frassati, Anabela Da Silva, Jean-marc Dinten, Didier GeorgesAbstract:This paper is devoted to the Fluorescence Diffuse Optical Tomography. This inverse problem relies on an iterative algorithm based on solutions of partial differential equations. The goal of the paper is to present a multiresolution technique applied to these equations, with the objective of Computation Complexity reduction. The effectiveness of the approach is then illustrated on a practical example.
Hyeong Sook Park - One of the best experts on this subject based on the ideXlab platform.
-
Mitigating Empty Vector Set Using Enlarged QRLRL-M Soft SM-MIMO Detector
Wireless Personal Communications, 2015Co-Authors: Divyang Rawal, Seungjae Bahng, Youn Ok Park, Vijay Kumar Chakka, Hyeong Sook ParkAbstract:An enlargement of the candidate vector set of QR-least reliable layer (QR-LRL) based MIMO detector for efficient soft output generation is proposed. Previous work (Bahng et al. in IEICE Trans Commun, E89---B(10):2956---2960, 2008) shows that the QR-LRL based MIMO detector approaches hard decision output ML performance, but does not match soft output ML performance due to empty candidate vector set problem. Performance degradation is more severe when modulation order is low. Some of the previous methods have provided solutions to empty vector set (EVS) problem (Kawai et al. in IEICE Trans Commun, E88---B(1):47---57, 2005; Bahng et al. in IEICE Trans Commun, E89---B(10):2956---2960, 2008; Kim et al. in IEICE Trans Commun, E92---B(11):3512---3515, 2009), but are not efficient in terms of performance or Computation Complexity. In this paper, we enlarge the candidate vector set of QR-LRL detector by applying every constellation point at each layer. The proposed detector thus effectively solves the EVS problem and achieves soft ML performance while keeping the Computation Complexity low, especially at low modulation order.
-
Enlarged QR-LRL based SM-MIMO detector for efficient soft output generation
TENCON 2014 - 2014 IEEE Region 10 Conference, 2014Co-Authors: Divyang Rawal, Seungjae Bahng, Youn Ok Park, Vijay Kumar Chakka, Hyeong Sook ParkAbstract:An enlargement of candidate vector set of QR-LRL (QR - Least Reliable Layer) based MIMO detector for efficient soft output generation is proposed. Previous work [8] shows that QR-LRL based MIMO detector approaches hard decision output ML performance, but does not match the soft output ML performance due to empty candidate vector set problem. Performance degradation is more severe when modulation order is low. Some of the previous methods have provided solutions to mitigate Empty Vector Set (EVS) problem [4] [8] [9], but are not efficient in terms of performance or Computation Complexity. In this paper, we enlarged candidate vector set of QR-LRL detector by applying every constellation point at each layer. The proposed detector thus effectively removes EVS problem and achieves soft ML performance while keeping the Computation Complexity low, especially at low modulation order.
Gbenga Owojaiye - One of the best experts on this subject based on the ideXlab platform.
-
implementing differential distributed orthogonal space time block coding using coefficient vectors
Wireless Communications and Networking Conference, 2016Co-Authors: Nnamdi Nwanekezie, Gbenga OwojaiyeAbstract:A coefficient vector technique implemented on a differential distributed space time block coding (DDSTBC) scheme is presented in this paper to improve on the Computation Complexity of existing DDSTBC schemes. The full mapping scheme and differential technique for utilizing the co-efficient vectors in a two-relay cooperative network is presented and comparison is made between the proposed technique and the traditional unitary matrices based technique. Results obtained from the numerical and simulation analysis conducted, showed that the proposed method presents an improvement in terms of Computation Complexity and BER performance. The proposed scheme was extended to accommodate networks with four and eight relay nodes utilizing square-real orthogonal codes.
Lin Dong - One of the best experts on this subject based on the ideXlab platform.
-
2 n secret sharing scheme for gray and color images based on boolean operation
Science in China Series F: Information Sciences, 2012Co-Authors: Lin Dong, Dao-shun Wang, Shundong LiAbstract:Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high Computation Complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic Computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2,n)-SS scheme for binary images based on Boolean operation, which has low Computation Complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.’s binary (2,n)-SS scheme. Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image. The two approaches are both based on Boolean operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low Computation Complexity and almost ideal contrast.
-
2 n secret sharing scheme based on boolean operation
Scientia Sinica(Informationis), 2011Co-Authors: Lin Dong, Dao-shun Wang, L I ShundongAbstract:Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computa- tion Complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic Computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2, n )-SS scheme for binary images based on Boolean operation, which has low Computation Complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct a r runs (2, n )-SS scheme to improve the contrast of Wang et al.s binary (2, n )-SS scheme. Then we present two approaches to construct r runs (2, n )-SS schemes for grayscale image and color image. The two approaches are both based on Boolean operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low Computation Complexity and almost ideal contrast.
