In this series of Post, I intend to write down something I have learnt from this Site:

It’s suitable for beginer like me to survey all about aspect of Tivas.

The first thing I learnt is about how to install Keil C and driver Launch Pad on My PC.

All thing you can follow the guiding here:

For the moment, I use Win 7, and Keil-C ver 474 so you should follow this if you intend to obey my blog.


Now after you try to install all necessary stuff, now u need to test your kit and code. There are a lot of examle from there:

It also have in TexasWare and ValvonoWare.

One notice I would like to recommend that if you want to try run there example codes, you may be got some weird error like this from Keil C:

main.c(155): error: At end of source:  #5: cannot open source input file “.\main.crf”: Permission denied

I dont know why  but I have try to copy all project to new one then delete a file namely ExtDll.iex.

Thanks God, it done.

So this is the first Post on this topic.



A taste of latex slide template.

Posted: December 18, 2010 in Uncategorized

For present in my desertion defend, I try finding some latex-interesting template and caught with ones from several sources.

First, it comes from my friends link, namely foil class. This style is so simple and make me unsatisfied.

Next, I come to a link of beamer themes as the link below:

Amazingly, it makes me so impressively and I’m nearly convinced.

An overview themes for beamer class:

Posted: December 15, 2010 in Uncategorized

free counters

Game of Life

Posted: October 22, 2010 in Uncategorized

in progressing


Pong Game

Posted: October 8, 2010 in Uncategorized

Hi everyone.

I intend introduce a pong game which is implemented on DE2 Kit. The small project will help you get a chance to discover mechanism of VGA port work as well as some basic organizations to design a game with Verilog hardware descriptive language.

The content of pong game can be found here.

You can download the code at this link.  The file includes  pong.qar and assignment pin file for DE2 Kit

I hope you enjoy it.

Notice that it remain some trivial bug and you are welcome to modified it.




Tutorial on DE2 Kit Notes

Posted: September 16, 2010 in Uncategorized

In this post, I give some notices on the Alteras tutorials. This entry will be update depend on my knowledge and practice. In my labs, all of experiments adopt Quartus II Web Edition 2010.

1. The Quartus  is require a large storage, at least 3 GB for Quartus(QII) and 2.5 GB for Nios II(NII) ISE. QII is lack of components such as Assignment editor is really stupid and you can direct assign pin on it, instead you use Chip Planner to do.

2. Your project name should be  same to your name file, if not you could see a error message like this:

Pal: An error relating SOPC builder when you make avm_master_irq that is the builder unknown your setup IRQ is multi-interrupt or individual interrupt.  When it happen you will get a message : “interrupt scheme out of range” or  incorrectly configured interrupt master“. The solution can be found here

Abstract: In this paper, I give my idea how to diminish K-sparse parameter which not to concern for aforementioned expander graph algorithms i.e. Sparse Matching Pursuit (SMP) and Sequence Sparse Matching Pursuit (SSMP).

Algorithms which combine geometrical and combinatorial methods have got a vast concerning in recently time since their performance are overwhelm others in aspect of  computing and update time, simplistic implement with modest requirement in storage. However, there is a significant notice from theory demonstration and simulation experiments in the coefficient of number measurement, it is greater five to ten times compare to the one of Linear Programming Algorithms. So, in the effort to reduces it, SMP and SSMP are deployed.

Their idea are similar to some state of the art algorithms, i.e. Subspace Pursuits and CoSaMP, which use voting-like mechanism and component-post-evaluating to select the best recover coefficients. This thing trades off  speed of algorithm a little bit O(log(N)) to a prominent improvement in required number measurement.

In the effort to reduce more, I would like to rudiment selection the best coefficients of the recovery  process and result in downgrading in computing time a order O(Nlong(N))  for an improvement  to approximate the limit bound in Expander Graph (~2Kd with d is the number of adjacent neighbors in an EG) . In addition,  to eliminate K-sparse parameter in the novel algorithm, I takes advantage of  finding components which makes minimum and maximum residue of signal and compare them to determine if stop algorithm or not.

For experiment and more detail,  I would like to refer to my paper :

Optimally Sequence Sparse Matching Pursuit.