Skip to main content

PC Power supply and hacks

For posterity and myself, I'm leaving some tips and tricks of PC Power Supply Unit (PSU) whcih is an SMPS (Switched Mode Power Supply). There are a variety of uses of a +12V, +5V and +3V DC power supply like lighting up an LED strip or powering a raspberry pi.


There are various colored cables in a typical ATX 12V SMPS. I'll list out the various color lines and what they mean,

Sr. NoCable colorNumber of cables in a PSUUse
1Greenexactly one (1)Wake up signal from motherboard.
Pressing PC power button makes this signal carry wake
up signal to PSU to start.
Green needs to be touched with the any ground to make the
SMPS start. For self-starting PSUs, green needs to be connected
with one black all the time.
2Blueexactly one (1)-12V
3Purpleexactly one (1)+5V standby. When power supply is on standby mode (not
on by signalling green), this line can give 1-2 A current.
4Grayexactly one (1)Power good signal. When PSU levels has reached specification,
it turns to +5V level. It takes a few millisecond to reach correct voltage levels.
5Brownexactly one (1)+3.3 Sense signal. Generates signals to determine voltage drop across +3.3V rails.
6BlackmanyGround (0V reference)
7Redmany+5V
8Orangemany+3.3 V
9Yellowmany+ 12V (Majority of power come from this rail)

Some Caveat,
  • Power supplied by various rail depend upon the particular model. For example, the image below is a spec sheet of Corsair Power Supply, VS model (cheapest one).
    Note how, the VS model only supplies 25A on +12V rails and 14A on +5V rail. It's not advisable to exceed the current rating but there are other ways of using the remaining power on other rails.
  • Switched mode power supplies need a minimum load across the output for it to start, otherwise the voltage will not be stable or it won't start.

Comments

  1. I have a hard time describing my thoughts on content, but I really felt I should here. Your article is really great. I like the way you wrote this information. dell power supply

    ReplyDelete
  2. I would like to thank you for the efforts you have made in writing this article. I am hoping the same best work from you in the future as well. Thanks... nfrtk

    ReplyDelete

Post a Comment

Popular posts from this blog

Multimaster replication with Symmetric DS

Symmetric DS is an awesome tool for trigger based replication whcih works for all major database vendors, including but not limited to PostgreSQL, MySQL, MSSQL, Oracle and many others. Symmetric-DS is a java application and can execute on any platform on whcih JRE is available including Windows and Linux. Trigger based replication, in constrast to disk based (eg. DRBD ) or transaction log file shipping based or statement based , works by registering triggers on DMLs and sending the data thus generated to remote machines. Another very popular trigger based DB replication tool is Slony . Symmetric-DS in addition to being database agnostic also supports multi-master replication (MMR). MMR usecase involves multiple database nodes, connected in a pool with DML updates coming from any of them. This is different from the normal master-slave replication, where slaves are not expected to generate any data events, and the sole authority of database is the master. MMR requirement causes d...

Cryptographic Primitive III: RSA Asymmetric Keys

RSA cryptosystems involves, a private key (which is kept private) and a public key, which is kept public i.e. known to everyone. The security of RSA hinges on the mathematically difficult problem of finding prime factorization of a very large number. Let's quickly disuss how a public, private key pair can be generated, Let, p and q be two large primes, then $n = q \times q$ $\phi(n) = (p-1) \times (q-1)$ Here, $\phi(n)$ is called euler's totient function Choose a random number $e$ such that, $e \in \left\{0,1,2...\phi(n)-1\right\}$ and $gcd(e,\phi(n)) = 1$ The gcd condition will ensure that we have an inverse of $e$ in $\mathbb{Z}_{26}$. Now, using extended euclidian algorithm one can get the inverse of e as d such that, $d \equiv e \pmod{\phi(n)}$ So, there we have it, the private key is $e$ and the public key is $(n,d)$. Few points to note here are, $p$ and $q$ are both $\geq 2^{512}$, although the recommened size is $2^{1024}$ $n$ is $\geq 2^{1024}$, although the recommended...