Abstract: Accordingly, embodiment herein disclose a method for handling block chain operation in a block chain system. The method includes parallelizing, by the block chain system, a block creation along with a consensus mechanism. The block creation along with the consensus mechanism includes parallelly combining a pre-computed state of a succeeding block (at height “k” greater than the current block, where “k” is a positive integer parameter chosen by the system designer) with transactions in a current block to obtain state to be stored in a next succeeding block (at height “k+1” greater than the current block) along with running a consensus protocol to finalize transactions to include in an immediate next block (at height one greater than the current block). Further, the method includes handling, by the block chain system, the block chain operation based on parallelizing. The method can be used for scaling up computation in blockchains.

Abstract: The present invention provides a computer implemented method in a blockchain system, wherein said method comprising: plurality of anchors, wherein said anchors includes a bitstring comprising (i) hash of a block in a main chain, and (ii) a Proof Of Work (PoW). The plurality of anchors generated, propagated and thereby accepted by plurality of peer nodes in a network on said blockchain system so as to increase the responsiveness and stability of a blockchain.

Abstract: Accordingly, embodiment herein disclose a method for handling block chain operation in a block chain system. The method includes parallelizing, by the block chain system, a block creation along with a consensus mechanism. The block creation along with the consensus mechanism includes parallelly combining a pre-computed state of a succeeding block (at height “k” greater than the current block, where “k” is a positive integer parameter chosen by the system designer) with transactions in a current block to obtain state to be stored in a next succeeding block (at height “k+1” greater than the current block) along with running a consensus protocol to finalize transactions to include in an immediate next block (at height one greater than the current block). Further, the method includes handling, by the block chain system, the block chain operation based on parallelizing. The method can be used for scaling up computation in blockchains.

Abstract: Technologies are generally provided to enable the peak-to-average power ratio (PAPR) in OFDM communication systems to be adjusted to a particular level. In some examples, an N-symbol transmission vector may be partitioned into k equal partitions, a Fast Fourier Transform (FFT) may be performed on each partition, and an interleaving union of FFT results may be generated. The results of the interleaving union may be used for transmission after mapping them to the M subcarriers and performing an M-point IFFT. On the receiver side, FFT may be performed on M subcarriers, where each of L end user devices may be assigned N subcarriers out of M=N*L available subcarriers. The N subcarriers of the FFT results may be de-mapped and subjected to an interleaving partition. Subsequently, an Inverse FFT (IFFT) may be performed on each partition and results of the IFFT operation employed for symbol detection.

Abstract: Technologies are generally provided to enable the peak-to-average power ratio (PAPR) in OFDM communication systems to be adjusted to a particular level. In some examples, an N-symbol transmission vector may be partitioned into k equal partitions, a Fast Fourier Transform (FFT) may be performed on each partition, and an interleaving union of FFT results may be generated. The results of the interleaving union may be used for transmission after mapping them to the M subcarriers and performing an M-point IFFT. On the receiver side, FFT may be performed on M subcarriers, where each of L end user devices may be assigned N subcarriers out of M=N*L available subcarriers. The N subcarriers of the FFT results may be de-mapped and subjected to an interleaving partition. Subsequently, an Inverse FFT (IFFT) may be performed on each partition and results of the IFFT operation employed for symbol detection.